ADVANCE OPERATING SYSTEM

1The basic functions of an operating system are a) Controls and coordinates the use of the hardware b) Acts as resource allocate and manager c) Controls the user programs to prevent errors and improper use of the computer d) All of the above Paging is solution to a) External fragmentation problem b) Internal fragmentation c) Both a & b d) None of the above While running DOS on a PC, which command would be used to duplicate the entire diskette a) Diskcopy b) Cp c) cmd d) mv The benefit of code sharing is that a) It allows inter process communication b) It allows an application to have several different threads of activity all within the same address space. c) Reusability d) Modularity _____________ is a hardware technique where the system appears to have more memory that it actually does a) Paging b) Semaphore c) Virtual memory d) Fragmentation The term used to calculate number of processes that complete their execution per time unit is a) Turnaround time b) Response time c) Waiting time d) Throughput The term used to calculate the amount of time to execute a particular process. a) Turnaround time b) Response time c) Waiting time d) Throughput The term used to calculate the amount of time a process has been waiting in the ready queue a) Turnaround time -1-

2.

3.

4.

5.

6.

7.

8.

b) Response time c) Waiting time d) Throughput 9. The term used to calculate the amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment). a) Turnaround time b) Response time c) Waiting time d) Throughput 10. What is the state of the processor, when a process is waiting for some event to occur? a) Waiting state b) Ready state c) Running state d) Suspended state 11. A real time operating system has a) Variable time constraints b) Well defined fixed time constraints c) The defined constraints d) None of the above 12. The properties of Hard real-time operating system are a) Secondary storage limited or absent b) Data stored in short term memory, or read-only memory (ROM) c) Conflicts with time-sharing systems not supported by general-purpose operating systems d) All of the above 13. The properties of Soft real-time operating system are a) Limited utility in industrial control of robotics b) Useful in applications (multimedia, virtual reality) requiring advanced operating-system features. c) Both a & b d) None of the above 14. _____________ is caused by under allocation of the minimum number of pages required by a process, forcing it to continuously page fault. a) Thrashing b) Throughput c) Threading d) None of the above 15. The technique of running several programs at a time using timesharing. It allows a computer to do several things at the same time is known as a) Multithreading b) Multiprogramming c) Multi tasking d) All of the above 16. The function of Multiprogramming is a) Creates logical parallelism. b) To keep several jobs in memory simultaneously

-2-

c) To keep CPU busy all the time. d) All of the above 17. In__________ the switching between jobs occurs so frequently that the users can interact with each program while it is running. a) Programming b) Paging c) Multi tasking d) Multi threading 18. _____________ occurs in a dynamic memory allocation system when many of the free blocks are too small to satisfy any request. a) Fragmentation b) Segmentation c) Virtual memory d) Page fault 19. _________ happens when a dynamic memory allocation algorithm allocates some memory and a small piece is left over that cannot be effectively used. a) Fragmentation b) Segmentation c) External Fragmentation d) Internal Fragmentation 20. ______________ is the space wasted inside of allocated memory blocks because of restriction on the allowed sizes of allocated blocks. a) Internal fragmentation b) Fragmentation c) Segmentation d) External Fragmentation 21. The module gives control of the CPU to the process selected by the short-term scheduler a) Scheduler b) Dispatcher c) Compiler d) Interpreter 22. The functions of a dispatcher are a) Switching context b) Switching to user mode c) Jumping to the proper location in the user program to restart that program, dispatch latency time it takes for the dispatcher to stop one process and start another running. d) All of the above 23. ________ Selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them. a) Dispatcher b) Pager c) Scheduler d) None of the above 24. Switching the CPU to another process requires saving the state of the old process and loading the saved state for the new process. This task is known as a

-3-

a) Context-switch b) Scheduler c) Translator d) None of the above 25. The memory that a computer microprocessor can access more quickly than it can access regular RAM is called a) DRAM b) SRAM c) Cache memory d) Registers 26. When a process requests an available resource, system must decide if immediate allocation leaves the system in a _________ state. a) Ready b) Running c) Deadlock d) Safe 27. A process may be defined as: a) A set of instructions to be executed by a computer. b) b. A program in execution. c) A piece of hardware that executes a set of instructions. d) The main procedure of a program. 28. A processor in the context of computing is: a) A set of instructions to be executed on a computer. b) A program in execution. c) A piece of hardware that executes a set of instructions. d) The main procedure of a program. 29. A multiprogramming system may be defined as one in which: a) Programs are divided into pages. b) Input is accepted in batches of many jobs. c) Several programs can reside in memory at the same time. d) Many processes may share the same program residing in main memory. 30. The main distinction between a multiprocessor system and a multiprogrammed system is that in a multiprocessor system: a) Several programs share the main storage. b) The input is accepted in batches of many jobs. c) Processor time is shared among several processes. d) Many processors may be active simultaneously. PROCESS MANAGEMENT 31 A user process can become blocked only if it is: a) In the ready state b) In the running state. c) In the blocked (or waiting) state. d) Both a & b 32. A counting semaphore was initialized to 9. Then 27 P (wait) operations

-4-

and 23 V (signal) operations were completed on this semaphore. The resulting value of the semaphore is: a) 5 b) 0 c) 7 d) 13 33. The main difference between binary semaphores and counting semaphores is that: a) Binary semaphores can only take the values 0 and 1, while counting semaphores can take any non-negative integer values. b) Binary semaphores can only be used to solve problems involving up to two processes sharing the same resource, while counting semaphores can be used to solve problems involving more than two processes sharing the same resource. c) Binary semaphores cannot solve all the problems that can be solved by counting semaphores. d) Counting semaphores must be controlled by a monitor, while binary semaphores are called directly by user processes. 34. A wait operation on a semaphore should not occur within a critical section controlled by that semaphore because: a) A deadlock will occur. b) A semaphore is not a shared variable. c) Another process may then enter the critical section violating the mutual exclusion constraint. d) A signal on a semaphore is always given from outside the critical section. 35. Which of the following statements is false? a) Disjoint processes need not use critical sections. b) Programs with critical sections can never be used simultaneously by more than one process. c) A process wanting to enter a critical section currently in use must wait for the process utilizing the critical section to terminate. d) Two different critical sections may be executed concurrently if they do not use the same shared variables. 36. The basic principle of a monitor is that: a) Several resources can only be controlled by a monitor. b) Several processes may concurrently execute a procedure of a given monitor. c) Only one process may execute a procedure of a given monitor at any given time. d) It schedules the execution of processes in a multiprocessor operating System. 37. Which of the following actions may result in a process becoming blocked? a) A process executes a P (wait) operation on a semaphore. b) A process executes a V (signal) operation on a semaphore.

-5-

c) A process exits from a critical section. d) A process within a critical section changes the value of a shared variable. 38. Non-preemptive-process-scheduling policies: a) Are indispensable for interactive systems. b) Allocate the processor to a process for a fixed time period. c) Always use a ready queue sorted in order of decreasing priority. d) Make short jobs wait for long jobs. 39. The pure-round-robin-scheduling policy: a) Responds poorly to short processes if the time slice is small. b) Does not use any a priori information about the service times of processes. c) Becomes equivalent to the Shortest-Job-First Policy when the time slice is made infinitely large. d) Ensures that the ready queue is always the same size. 40. Which of the following statements is true? a) A multiprogrammed system gives better average turnaround than a non-multiprogrammed system. b) When a job-scheduling policy is changed, it is possible for the average Turnaround time to decrease while the average priority-weighted turnaround Time increases. c) There is no job scheduler in a time-sharing system. d) Indefinite postponement of a job is possible if the First-Come-First-Serve-job-scheduling policy is used. 41. Which of the following statements is false? a) I/O-bound processes should be given priority in scheduling over CPU-bound processes to ensure good turnaround time. b) Users can exploit a multilevel feedback-scheduling policy by breaking a long job into several small jobs. c) The processor scheduler normally classifies a process as being a CPU-bound process if it uses most of the previous time slice allocated to it. d) The round-robin-scheduling policy allocates a time slice to a process depending on the number of time slices it has already used. 42. Which of the following is not a necessary condition for a deadlock? a) Mutually exclusive use of a resource by processes. b) Partial allocation of resources to a process. c) Preemptive scheduling of resources. d) Circular waiting by processes. 43. One solution to the Dining Philosophers problem, which avoids deadlock is:

-6-

a) Non-preemptive scheduling. b) Ensuring that all philosophers pick up their left fork before they pick up their right fork. c) Ensuring that all philosophers pick up their right fork before they pick up their left fork. d) Ensuring that odd philosophers pick up their left fork before they pick up their right fork and even philosophers pick up their right fork before they pick up their left fork. 44. Which of the following statements is true for the Banker's algorithm? a) It cannot be used for a system with many resources, each of which is unique with no multiple copies. b) It is used to detect deadlock. c) It is not applicable when many users share a resource simultaneously. d) An unsafe situation will always lead to a deadlock. 45. Consider a system in which the total available memory is 48K and in which memory once allocated to a process cannot be preempted from that process. Three processes A, B, and C have declared in advance that the maximum amount of memory that they will require is 25K, 15K, and 41K words respectively. When the three processes are all in execution and using 3K, 9K, and 24K words of memory respectively, which one of the following requests for additional allocation can be granted with a guarantee that deadlock will not occur as a result of the allocation. a) A requests 9K words. b) C requests 7K words. c) B requests 6K words. d) A requests 6K words. MEMORY MANAGEMENT 46. Which of the following statements is true? a) When the best-fit method of allocating segments is used, it is preferable to order the list of free blocks according to increasing memory addresses. b) The best-fit method chooses the largest free block in which the given segment can fit. c) In general, the first-fit allocation algorithm will be faster than the best-fit algorithm. d) The tagged method of deallocating segments is fast when the list of free blocks is ordered according to increasing memory addresses. 47. In a variable partition-memory management scheme, internal fragmentation occurs when: a) Sufficient memory is available to run a program, but it is scattered between existing partitions. b) Insufficient memory is available to run a program.

-7-

c) The partition allocated to a program is larger than the memory required by the program. d) A program is larger than the size of memory on the computer. 48. The FIFO page-replacement policy: a) Is based on program locality. b) Sometimes can cause more page faults when memory size is increased. c) Is not easy to implement, and hence, most systems use an approximation of FIFO. 49. Which of the following statements is false? a. With the Least Recently Used (LRU) page-replacement policy, when the page size is halved, the number of page faults can be more than double the original number of page faults. b. The working set size is a monotonically nondecreasing function of the working set parameter. c. When the working set policy is used, main memory may contain some pages which do not belong to the working set of any program. 50. It is advantageous for the page size to be large because: a. Less unreferenced data will be loaded into memory. b. Virtual addresses will be smaller. c. Page tables will be smaller. d. Large programs can be run. 51. It is advantageous for the page size to be small because: a. Less unreferenced data will be loaded into memory. b. Virtual addresses will be smaller. c. Page tables will be smaller. d. Large programs can be run. 52. For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory is of 6 and 4 pages, respectively. When the same page trace is operated under the optimal policy, the number of page faults may be: a. 9 and 7. b. 7 and 9. c. 10 and 12. d. 6 and 7. 53. In a paged segmented scheme of memory management, the segment table points to a page table because: a. The segment table may occasionally be too large to fit in one page. b. each segment may be spread over a number of pages. c. Page size is usually larger than the segment size.

-8-

d. The page table may be too large to fit into a single segment. 54. Sharing in a paged memory system is done by: a. Giving a copy of the shared pages to each process. b. Dividing the program into procedures and data and allowing only the procedures to be shared. c. Several page table entries pointing to the same frame in the main memory. 55. One of the ways of sharing segments in a segmented system is by: a. Maintaining a common segment table containing the information about shared segments. b. Dividing the program into procedures and data and allowing only the procedures to be shared. c. Dividing the shared segment into a set of pages and allowing only certain pages to be shared. d. None of the above, as segments are larger than pages, and hence, cannot be shared. 56. With reference to Multics, which of the following statements is false? a. Every process must have a separate linkage segment for every shared segment. b. The linkage segment need not be used to resolve internal references of a segment. c. When control is transferred from one segment to another, the linkage pointer must be changed to point to the new linkage segment. d. The linkage segment is constructed at the time of linking. 57. An advantage of dynamic linking is that: a. The segments that are not used in a run need not be linked into the process address space. b. It reduces execution time overhead. c. Debugging is simplified because programs are modular. d. The linker need not construct the known segment table. CAPABILITY 58. In operating systems, a capability is: a. A facility, which provides global access to all data in the system. b. A unique and nonforgeable name identifying an object in the system together with access information. c. A user-maintained list of access privileges of the objects in the system. d. A table of the available operating system resources. 59. In capability-based systems, which of the following statements is true? a. The unique name of a capability is reused after every time slice. b. The unique name of a capability is never reused. c. The unique name of a capability can be reused if there are no references to it.

-9-

FILE SYSTEMS 60. Disk scheduling involves: a. Allocating disk space to users in a fair manner. b. Validating the file control information stored in the file. c. Examining pending disk requests to determine the most efficient way to service the requests. d. Reorganizing disk requests to maximize seek time. 61. Which of the following is not normally contained in the directory entry of a file? a. Creation date. b. Access control list. c. A count of the number of free blocks in the disk. d. Filename and extension. 62. Which of the following is an example of a spooled device? a. A line printer used to print the output of a number of jobs. b. The terminal used to enter the input data for a Fortran program being executed. c. The secondary memory device in a virtual memory system. d. The swapping area on a disk used by the swapper. 63. The free space list records all disks blocks that are a.) Used b.) Occupied c.) Deleted d.) Free 64. _________ Solves the external fragmentation and size-declaration problems of contiguous allocation. e.) Linked allocation f.) Indexed allocation g.) Index block h.) FAT 65. The method used to support direct access without suffering from external fragmentation is known as i.) Linked list j.) Grouping k.) Indexed allocation l.) All of the above 66. A cluster is a. Group of files b. Collection of addresses

- 10 -

c. List of directories d. Collection of blocks 67. Linked allocation is used effectively for only a. Serial files b. Sequential access files c. Index sequential files d. Linked list 68. The _________ allocation method requires each file to occupy a set of contiguous blocks on the disk. a. Non-contiguous b. Contiguous c. Linked d. Indexed 69. The difficulty with contiguous allocation is a. Space for pointers b. Garbage collection c. Finding space for a new file d. None of the above 70. The information about files like name, location, size and type is stored in a. Block b. List c. Counting d. Device directory 71. The effect of thrashing can be limited by using a a. Priority replacement algorithm b. Local algorithm c. Global algorithm d. All of the above. 72. The functions of operating system are a. Memory management b. Device management c. User interface d. All of the above 73. The time from which a user job is given to the time when its output is given back to the user is called a. Waiting time b. Turn around time c. Response time d. Throughput

- 11 -

74. The examples of multiprogramming operating system is a. Unix b. DOS c. Windows d. A & c 75. The use of distributed operating system is a. Resource sharing & load sharing b. Reliability & communication c. Both a & b d. None of the above 76. ____________ provide the interface between a process and the operating system. a. System calls b. CPU c. Programs d. Tools 77. A ___________ system guarantees that critical tasks complete on time a. Batch processing system b. Distributed system c. Multitasking system d. Real time system 78. In____________, the interfaces and levels of functionality are not well separated a. Windows b. Linux c. MS-DOS d. None of the above 79. The process of sequencing jobs so that they can be executed on the processor is known as a. Process management b. Ready queue c. Job scheduling d. All of the above 80. Real-time systems are time critical systems. a. True b. False c. Depends on task d. Depends on CPU. 81. A program object that allows multiple program threads to share the same resource a. Compiler

- 12 -

b. Linker c. Loader d. Mutex 82. A Locking Mechanism used inside resource manager and resource dispenser to avoid deadlock is known as a. Mutual exclusion b. Semaphore c. Mutex d. None of the above 83. The hardware technique where the system appears to have more memory that it actually does is called a. Paging b. Segmentation c. Virtual memory d. Fragmentation 84. Number of processes that complete their execution per time unit is known as a. Throughput b. Turn around time c. Waiting time d. None of the above 85. A ___________ is a data structure that contains information related to a running process. a. Process b. Process control block (PCB) c. Thread d. All of the above 86. A set of processes waiting for an I/O device is known as a. Job queue b. Ready queue c. Device queue d. None of the above 87. A scheduler that selects which process should be executed next and allocates CPU to it is known as a. Middle term scheduler b. Long term scheduler c. Process scheduler d. Short term scheduler 88. The process that spends more time doing computations is called a.) CPU-bound process

- 13 -

b.) I/O bound process c.) Device bound process d.) Time bound process 89. IPC facility provides operations like a.) Send (message) b.) Receive (message) c.) Both a & b d.) None of the above 90. When process selects a replacement frame from the set of all frames; one process can take a frame from another. This technique is known as a.) Local replacement b.) Global replacement c.) LFU algorithm d.) Algorithm The code stored in ROM that is able to locate the kernel, load it into memory, and start its execution is called a.) Loader b.) Linker c.) Compiler d.) Boot strap program
91. 92.

a.) b.) c.) d.)

93.

Multiprogramming is the technique Of running several programs at a time using timesharing. It allows a computer to do several things at the same time. It creates logical parallelism All of the above

____________ occurs in a dynamic memory allocation system when many of the free blocks are too small to satisfy any request a.) Fragmentation b.) Segmentation c.) Paging d.) Demand paging
94.

a.) b.) c.) d.)

95.

The space wasted inside of allocated memory blocks because of restriction on the allowed sizes of allocated blocks is known as External fragmentation Internal fragmentation Both a & b None of the above The task of a dispatcher is/are - 14 -

a.) b.) c.) d.)

96.

Switching context Switching to user mode Jumping to the proper location in the user program to restart that program All of the above The time taken by the dispatcher to stop one process and start another running is called Latency time Time delay Dispatch latency None of the above Switching the CPU to another process requires saving the state of the old process and loading the saved state for the new process. This task is known as Context switch Switching Dispatching Scheduling _________ is random access memory (RAM) that a computer microprocessor can access more quickly than it can access regular RAM. Registers Cache memory Virtual memory Buffer _________ allocation supports direct access, without suffering from external fragmentations Contiguous allocation List allocation Indexed allocation All of the above A process is __________ if it is ending more time paging than executing Threading Buffering Spooling Thrashing

a.) b.) c.) d.)

97.

a.) b.) c.) d.)

98.

a.) b.) c.) d.)

99.

a.) b.) c.) d.)

100.

a.) b.) c.) d.)

- 15 -

p.)

- 16 -