1. The segment of code in which the process may change common variables, update tables, write into files is known as
-
program
critical section
non – critical section
2. The primary job of the operating system of a compute is to
-
Command resources
Manage resources
Provide utility
3. Which of the following conditions must be satisfied to solve the critical section problem?
-
mutual exclusion
progress
bounded waiting
4. The operating system of a computer serves as a software interface between the user and
-
Hardware
Peripheral
Memory
5. A minimum of variable(s) is/are required to be shared between processes to solve the critical section problem.
-
one
two
three
6. What is the name of the system which deals with the running of the actual computer and not with the programming problems?
-
Operating system
System program
Object program
7. In the bakery algorithm to solve the critical section problem
-
each process is put into a queue and picked up in an ordered manner
each process receives a number (may or may not be unique) and the one with the lowest number is served next
each process gets a unique number and the one with the highest number is served next
8. There are types of threads
-
User Level Threads
Kernel-Level Threads
Both are threads
9. If binding is done at assembly or load time, then the process be moved to different locations after being swapped out and in again.
-
can
must
can never
10. The process of transferring data intended for a peripheral device into a disk (or intermediate store) so that it can be transferred to peripheral at a more convenient time or in bulk, is known as
-
Multiprogramming
Spooling
Caching
11. In a system that does not support swapping
-
the compiler normally binds symbolic addresses (variables) to relocatable addresses
the compiler normally binds symbolic addresses to physical addresses
the loader binds relocatable addresses to physical addresses
12. Context Switching and Sharing are
13. The address generated by the CPU is referred to as
14. Page replacement algorithms
15. The address loaded into the memory address register of the memory is referred to as
16. The time required to create a new thread in an existing process is
17. When the event for which a thread is blocked occurs?
18. If the wait for graph contains a cycle
19. If no frames are free, page transfer(s) is/are required.
20. A page fault occurs when?
21. When a page fault occurs, the state of the interrupted process is
22. Which of the following system calls transforms executable binary file into a process?
23. Which of the following calls never returns an error?
24. The consists of all processes whose memory images are in the backing store or in memory and are ready to run.
25. The time in a swap out of a running process and swap in of a new process into the memory is very high.
26. If the thread pool contains no available thread
27. Thread pools help in
28. The number of the threads in the pool can be decided on factors such as
29. The One to One model allows
30. The valid – invalid bit, in this case, when valid indicates?
Post a Comment
0 Comments