Correct : A. Address of an instruction to be fetched
3. MAR (memory address register)
Correct : C. Specifies location in memory for next read/or writer.
4. IR (Instruction register)
Correct : B. Contains the instruction most recently fetched
5. Which of the following is not an address register?
Correct : D. Data register.
6. Following is not the state of Five-State process model
Correct : C. Not Running
7. Memory table is used
Correct : D. A, B and C are true.
8. I/O tables are used
Correct : C. A and B both true
9. The operating system control tables maintains file table, because
Correct : B. These tables provide information about the existence of files, their location on secondary memory and their current status.
10. Processor in computer
Correct : A. Controls the operations of the computer/ processes data functions.
11. Memory buffer register (MBR) contains
Correct : A. Data that is to be written into memory
12. I/O modules move data
Correct : A. Between external environment and computer.
13. I/O OBR (I/O Buffer register) is
Correct : A. Used for the exchange of data between an I/O module and the processor.
14. User-visible register
Correct : C. A and B both true.
15. User-Visible register Which of the following do not support GUI (Graphical User Interface)
Correct : A. DOS
16. The MS-DOS an operating system supports
Correct : C. Single user process and single thread
17. The UNIX, an operating system supports
Correct : C. Single user process and single thread per process.
18. The Java run time environment is an example of
Correct : A. Single user process with multiple threads
19. The Windows 2000, operating system supports
Correct : B. Multiple processes with multiple thread per process.
20. In the pure User Level Threads (ULT)
(i) Thread management is done by application,
(ii) Thread management is done by kernel,
(iii) Kernel is not aware of the existence of thread,
(iv) Application program interface (API) to the kernel thread facility.
Correct : A. i, iii are true
21. The Window 2000 (W2K) and Linux are the example of
Correct : B. Kernel Level Thread (KLT)
22. The following is not an advantage of User Level Threads (ULT).
Correct : D. When ULT executes a system call, not only that thread blocked, but all of the threads within the process are blocked.
23. The Linux operating system supports
Correct : D. Multiple thread per process and multiple processes.
24. In semaphore the process blocked by wait operation is unblocked if
Correct : B. Semaphore value becomes non- positive
25. In cluster
Correct : A. Computers communicate with each other’s via fixed paths or via some network facilities
26. The cluster is a case of
Correct : A. Distributed memory
27. The master/slave architecture is an example of
Correct : B. Shared memory processing
28. I/O modules in computer
Correct : C. Move data between the computer and external environment.
29. Instruction register contains
Correct : B. The instructions most recently fetched.
30. The following
Correct : C. Instruction cycle without interrupt
31. Instruction processing consists of
Correct : C. Fetch and Execution cycle both
32. Operating System is
Correct : A. Software
33. The concept used to support multi programming environment on a computer is
Correct : C. Display of multiple windows
34. Which combination of the following features will suffice to characterize an OS as a multi programmed OS ?
(i) More than one program may be loaded into main memory at the same time for execution.
(ii) If a program waits for certain events such as I/O, another program is immediately scheduled for execution.
(iii) If the execution of a program terminates, another program is immediately scheduled for execution.
Correct : D. (i), (ii) and (iii).
35. Turnaround time is defined as
Correct : A. Delay between job submission and job completion
36. The only state transition initiated by the user process itself in an operating system is
Correct : A. Block
37. Window 98 is a
Correct : A. Single user system
38. OS/390 is a
Correct : B. Multi user system
39. Thread is
Correct : C. A and B both true
40. Multithreading allows
Correct : D. A and B both true.
41. For multithreading
Correct : A. Tasks to be performed can be independent
42. The principal function of a process is
Correct : A. To execute machine instructions residing in main memory.
43. The trace of the process is
Correct : B. A listing of sequence of instructions that execute process
44. The two state process models have the following states
Correct : A. Running and Not Running
45. The process control blocks are referred for
Correct : A. Process control
46. With trap in process control
Correct : A. Operating system determines the error or exception condition that is fatal.
47. Process control block is also referred as
Correct : D. A, B, C are all true.
48. The operating system control tables maintain process tables, because
Correct : D. None of these.
49. Windows XP is
Correct : B. Multi programming processes
50. The OS/2 is the operating system that support
Correct : B. Multiple thread per process
51. In shared memory multi processor
Correct : B. Computer communicates to each other via a shared memory.
52. The following is not true for master/slave architecture
Correct : C. Operating system kernel can run on any processor either master or slave.
53. In monolithic operating system
Correct : A. Virtually any procedure can call any other procedure.
54. In Layered operating system following statement is false
Correct : D. None of these.
55. When operating system always run on a particular processor and that particular processor do all scheduling and process management then this is an example of
Correct : A. Master/slave architecture
56. In micro kernel architecture following is false.
Correct : A. Intersection takes place only between adjacent layers.
57. In the following processes: a = a + 1; b = 2 × b; b = b + 1; a = 2 × a;the output is.
Correct : D. None of these.
58. A Semaphore is initialized to
Correct : C. Non-negative integer value
59. The wait operation
Correct : A. Decrements the semaphore value
60. In semaphore, the process executing the wait is blocked if
Correct : A. The semaphore value becomes negative
61. In semaphore when the order of processes that are waiting to be removed from the queue is first in first out (FIFO) then it is called
Correct : B. Strong semaphore
62. The compaction is the technique in memory management that is used to over come
Correct : B. External fragmentation
63. Physical address (absolute address) in memory partitioning is
Correct : A. Actual location in main memory
64. The frame
Correct : A. Can hold exactly one page of data
65. In real time computing
Correct : A. The result of computation does not depend on the time at which computa- tion is done.
66. Match the following pairs
A. Logical address(1) An actual location in main memory B. Relative address (2) An address is expressed as a location relative to some known point. C. Physical address (3) A memory location independent of the current assignment of data to memory
Correct : A. A – 3, B – 2, C–1
67. The Least Recently Used (LRU) policy
Correct : A. Replaces the page in memory that has not been referenced for the least time.
68. Physical address in memory management is
Correct : A. Actual location in main memory
69. Relative address in memory management is
Correct : B. Dependent to some known point
70. A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form.
Correct : A. A – 1, B – 2, C – 3
71. For Load-time dynamic linking
Correct : A. Load module (application module) to be loaded is read into memory.
72. In thread scheduling, load sharing is referred to
Correct : C. A global queue of ready thread is maintained and each processor, when idle, selects a thread from queue.
73. The real time task
Correct : A. The tasks that reacts to events that take place in out side world.
74. Hard real-time tasks are
Correct : B. A real time task that requires dead line constraints.
75. The deterministic operating system
Correct : A. Where operations are performed with in pre-determined time interval.
76. In Responsive real time operating system
Correct : A. The interruption is acknowledge and operating system response to interrupt.
77. In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
Correct : D. A – 3, B – 1, C – 1
78. In soft real time tasks
Correct : B. The dead line is desirable but not mandatory.
79. In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.
Correct : A. A – 1, B – 2, C – 3
80. Match the following I/O devices : A- Keyboard, 1- Human readable, B- Disk and tape drives, 2- Communication, C- Modems, 3-Machine readable
Correct : A. A – 1, B – 3, C – 2
81. Arrange the following I/O device in increasing data rate Hard disk, Floppy disk, Key board
Correct : A. Key board, Floppy disk, Hard disk
82. Resident set of process is
Correct : A. Portion of a process that is actually in main memory at any time.
83. Main memory is referred as
Correct : B. Real memory
84. Memory that is located on the disk either Hard or floppy is referred as
Correct : A. Virtual memory
85. The principle of locality states
Correct : A. The program and data references within a process tend to cluster.
86. In memory management : A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.
Correct : C. A – 2, B – 1, C – 3
87. In memory management when demand cleaning policy is applied
Correct : B. A page is written out to secondary memory only when it has been selected for replacement.
88. In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (212 pages) then the 4-Gbyte (232) virtual address space is composed of
Correct : B. 220 pages
89. When pre cleaning policy is applied in
memory management
Correct : B. Modified pages are written before their page frames are needed so that can be written out in batches.
90. In virtual memory management, when local control policy is applied
Correct : A. It determines the number of processes that are to be resident in main memory.
91. In two level scheme if each page is mapped by 4-byte (22) page table entry then to create a page table composed of 220 page table entry one requires
Correct : A. 222 bytes
92. In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as
Correct : C. Inverted page table structure.
93. A fetch policy for virtual memory determines
Correct : A. When a page should be bought into main memory.
94. When process is swapped out of main memory and put in a suspended state
Correct : A. All of its resident pages are moved out.
95. Statement A: The placement policy determines where in real memory a process piece is to reside. Statement B: The fetch policy determines when a page should be bought into main memory.
Correct : A. A and B both true
96. When a frame in main memory is locked
Correct : B. The page currently stored in that frame cannot be replaced.
97. Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page. Statement B: In memory management, the policy the fetch policy determines when a page should be bought into main memory.
Correct : B. A and B both true
98. In memory management where replacement is allowed in First-in-First-out (FIFO) fashion
Correct : B. The page frames are allocated to a process as circular buffer and pages are removed in round-robin order.
99. By principle of locality, in least recently used policy, in memory management
Correct : A. The page replaced in memory is least likely to be referenced in the near future.
100. In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and
Correct : B. The most recent page is removed at the last