Model Question Paper Subject Code: MIT201/ MC2010/ IMC2010/BCA2010 Subject Name: Operating System Credits: 4 Marks: 140

Part A (1 x 50 = 50 Marks)
1. Which of the followings are the Basic architectures for multiprocessor interconnections? a. Bus-Oriented systems b. Crossbar-connected systems c. both a and b d. Uniform memory access (UMA) 2. Spooling creates a number of __________on the disk which are ready to be executed / processed. a. tables b. sectors c. jobs d. addresses 3. Multiprogramming increases_____________________by organizing jobs a. memory utilization b. CPU utilization c. H/W utilization d. both a and b 4. CPU scheduling and multi-programming provide each user_____________ in a time-shared system. a. multiple time slice

b. multiple jobs c. multiple opening d. one time slice (slot) 5. The PCB contains information that makes the process_______________ entity a. dynamic b. passive c.an active d. static 6. The ready queue is nothing but a list of ______________ implemented as a linked list. a. processor b. Processes c. PCBs d. Both a and b 7. The operating system scheduler schedules processes from the______________ for execution by the CPU a. ready queue b. Waiting queue c. running queue d. Both a and b 8. CPU switching from one process to another requires saving the state of the current process and loading the latest state of the next process, is known as__________________. a. Context Switch b. packet switch c. process switch d. processor switch 9. The short-term scheduler (or CPU scheduler) carries out the _________________.

a. selection process b. termination process c. starter process d. execution process 10. Module that gives control of the CPU to the process selected by the short-term scheduler is known as ____________________. a. dispatcher b. scheduler C. manager d. Connector 11. Number of processes completed per time unit is called____________________. a. throughput. b. CPU utilization c. Turnaround time d. Response time 12. The FCFS algorithm is implemented by using a _________________queue structure for the ready queue. a. first-in-first-out (FIFO) b. LILO c. LIFO d. FILO 13. If process pi is executing in its critical-section, then no other processes can be executing in their critical-sections. Technique is called_____________________. a. Mutual Exclusion b. Bounded Waiting c. Progress

d. both a and b 14. An algorithm developed for solving the critical-section problem for n processes is also called ________________________. a. Scheduling algorithm b. Bakery algorithm, C. queuing algorithm d. Both a and b 15. Semaphores are the classic method for _________________to shared resources (e.g. storage) in a multi-processing environment a. restricting access b. Allowing access c. check d. both b and c 16. A _____________________is a collection of procedures, variables and data structures grouped together a. monitor b. Semaphores c. detector d. both a and b 17. The situation where we have a set of processes each holding some resources, each requesting some resources, and none of them is able to obtain what it needs. Such situation is called__________________. a. Deadlock b. reusable c. Mutual exclusion D. both b and c

18. Dead-lock avoidance scheme requires the operating system to know ____________, the resources needed by a process for its entire lifetime. a. in advance b. Everything c. processor requirements d. a and b both 19. Prevention of deadlock is possible by ensuring that at least one of the four conditions_________________ hold. a. Must b. Cannot c. may or may not d. reverse to 20. A system is said to be in a safe state if it can allocate resources up to the ________________ and is not in a state of deadlock a. maximum available b. lowest level c. moderate level d. both b and c 21. An address generated by the CPU is referred to as a __________________. a. logical address b. physical address c. variable address d. both a and b 22. If binding is done at load time then swap in has to be at the ________________ as before a. variable address b. different location

c. same location d. both b and c 23. A situation where the total size of hole is divided into a set of smaller holes is large enough to hold another process for execution but the process cannot be loaded, as the hole is not contiguous. This is known as ____________________. a. external fragmentation b. Internal fragmentation C. both a and b d. reallocation 24. Physical memory is divided into fixed sized blocks called __________________. a. frames b. blocks c .box d. both a and c 25. Demand paging is similar to paging with ____________________. a. swapping b. debugger c. secondary memory d. both a and b 26. In first-in-first-out page replacement algorithm when a page replacement is required the ____________________in memory is the victim. a. dead page b. Recent page c. oldest page d. Both a and b 27. An optimal page replacement algorithm produces the __________________rate of all algorithms

a. lowest page fault b. Highest page fault c. both a and b d. fragmentation 28. Which of the following storage media user can use for storage? a. magnetic disks b. tapes c. optical disks D .all above 29. The extension which is separated by dot, is the part of a file name that identifies the _______________of the file. a. storage b. Size c. type d. Both b and c 30. Which of the following extension we have for C source code file? a. .c b. .cob c. .txt d. both a and b 31. Distributed applications mean different programs on ______________________. a. different computers. b .same computers c. single computer d. both a and b

32. In vertical or hierarchical distribution, functionality is distributed among various ______________________. a. directions b. Levels c hierarchy d. Both a and b 33. In centralized data, data resides only at _________________that can be accessed or shared by all other computers in the network a. one central computer b. Distributed computers c. lower level d. both a and b 34. Network Operating System (NOSs) are available on __________________. a. MANs b. WANs c. LANs d. both a and b 35. Deliberately written program or part of it intended to create mischief is called as ___________________. a. Computer worm b. application program c. computer virus d. both c and b 36. Which of the followings are the types of virus? a. Memory resident infectors b. General purpose infectors c. both a and b

d. None of above 37. Worm is a complete program by itself and can execute __________________. a. Independently b. With other program c. Both a and b d. with help of boot program 38. SIMD stands for __________________________. a. Single Instruction Stream, Multiple Data Stream b. Single Instruction Stream, mutual Data Stream c. simple instruction Stream, Multiple Data Stream D .Single Instruction solution, mutual Data Stream 39. IPC stands for________________________________. a. intellectual process community b. Inter-personal communication c. Inter-processor communication d. Inter-personal community 40. The nature of multiprocessor interconnections has an affect on the _____________for communication a. bandwidth b. Frequency c. Range d. both a and b 41. A ______________real-time system guarantees that critical tasks complete at a specified time. a. soft b. critical

c. hard d. restrictive 42. In _______________ distribution all computers are at the same level implying that all the computers are capable of handling any functionality. (Pick the right option) a. Horizontal b. Vertical c. Parallel d. Hierarchical 43. MAR stands for _______________. a. Main Allocation Register b. Memory Allocation Register c. Main Address Register d. Memory Address Register 44. The time taken for the dispatcher to stop one process and start another running is known as the______________. a. dispatch latency b. dispatch time c. process latency d. running latency 45. A _______________ is a tree of height two with the master file directory at the root having user directories as descendants that in turn have the files themselves as descendants. (Pick the right option) a. Single level directory b. Directory c. Two level directory d. Tree structured directory 46. DMA Stands for __________________________________.

a. Direct Memory Activation b. Double Memory Access c. Direct Mean Arithmetic d. Direct Memory Access 47. Deadlocks can be described by a ________________graph. a. allocation b. dead c. resource allocation d. process 48. Virtual memory is implemented using____________________. a. Request paging b. Demand paging c. Swap paging d. Change paging 49. _______________ is verification of access to system resources. (Pick the right option) a. Authentication b. Line Trapping c. Browsing d. Fabrication 50. LPC stands for ___________________________________. a. Local Procedure Call b. Local Private Customer c. Local Private Call d. Locator Procedure Call

Part B (2 X 25 = 50 Marks)
51. BIOS (Basic Input Output system) which is stored in _______________where as DOS (Disk Operating System) is stored in a ___________________. a. EEPROM, EPROM b. ROM (Read Only Memory), floppy disk or a hard disk c. EEPROM, floppy disk d. ROM, EPROM 52. ________________operating systems are more complex than ______________operating systems. a. Time-sharing, multi-programmed b. Time-sharing, programmed c. Data sharing, programmed d. Multiple, single user 53. State true /false When a process creates a new process, two possibilities exit in terms of execution A. The parent continues to execute concurrently with its children B. The parent waits until some or all of its children have terminated a. A-T, B-T b. A-F, B-F c. A-T, B-F d. A-F, B-T 54. A process terminates when it finishes executing its ______________and asks the operating system to delete it by using the __________________. a. First statement, delete command b. First statement, exit system call

c. last statement , exit system call d. last statement, delete command 55. State true/ false Scheduling under one of the following condition is said to be non-preemptive: A. switches from running state to waiting (an I/O request). B. switches from waiting to ready state (completion of an I/O). a. A-T, B-F b. A-T, B-T c. A-F, B-F d. A-F, B-T 56. The round-robin CPU scheduling algorithm is basically a ___________scheduling algorithm designed for _________________ systems. a. non-preemptive, time-sharing b. non-preemptive, multi- processor c. preemptive, resource-sharing d. preemptive , time-sharing 57. In the direct-communication discipline, each process that wants to communicate must __________________name the________________of the communication a. explicitly , recipient or sender b. implicitly, recipient or sender c. explicitly , recipient and sender d. implicitly, recipient and sender 58. A mailbox can be viewed abstractly as an object into which messages can be placed by _________________ and from which messages can be _________________. a. Scheduler, attached b. processes, attached c. processes, removed.

d. Scheduler, removed. 59. State true/false In case a deadlock occurs the system mustA. Detect the deadlock B. back up for all storage a. A-T, B-T b. A-F, B-F c. A-T, B-F d. A-F, B-T 60. State true/false A. A safe state is not a deadlock state B. If a system is in a safe state it can stay away from an unsafe state and thus avoid deadlock. a. A-T, B-T b. A-F, B-T c. A-T, B-F d. A-F, B-F 61. State true/false For external fragmentation. A. Memory compaction is a solution to overcome external fragmentation. B. if segments even though variable are small, external fragmentation is also less. a. A-T, B-T b. A-F, B-T c. A-T, B-F d. A-F, B-F 62. A logical address generated by the CPU consists of two parts: ______________and _________________.

a. page address, page offset b. page address, page value c. page offset, default page d. Page number, page offset 63. State true/false Demand paging uses two important algorithms A. Page replacement algorithm. B. Frame allocation algorithm a. A-T, B-T b. A-F, B-T c. A-T, B-F d. A-F, B-F 64. The main distinction between FIFO and optimal algorithm is that the FIFO algorithm uses the time when a page was brought into ___________ whereas the optimal algorithm uses the time when a page is to be used in ___________________. a. Memory, future b. secondary memory, future c. address space, past d. secondary memory, past 65. When a file is created or a file grows requests for blocks of disk space are checked in the_______________ list and then __________________. a. free-space, allocated b. first , allocated c. first , reallocated d. Free-space, allocated 66. Hash function is the main problem that is dependent on the ___________ and the solution to the problem is to allow for chained overflow with each hash entry being a _____________.

a. records, linked list b. hash table, linear list c. hash table size, linear list D .hash table size, linked list 67. The main functions of NOS are: (i) Redirection (ii) Communication management (iii) File / printer services (iv) Network management (v) Server management a. i, ii, iii and iv only. b. i and iv only. c. i, ii and v only. d. iii and v only. 68. State true/false Encryption in a distributed environment can be of two forms A. End-to-end encryption B. point-to-point encryption a. A-T, B-T b. A-F, B-T c. A-T, B-F d. A-F, B-F 69. Digital signature is like a _______________ on paper. If a signed letter is sent by A to B, A cannot deny having sent it to B and B _____________ having got it a .human signature, cannot refuse b. computer signature, can refuse

c. human signature, can refuse D. Computer signature, cannot refuse 70. The crossbar switch is the only cause of delay between _____________ and _____________. a. Primary memory, secondary memory b. Processor, memory. c. flash memory, cache memory d. Input, output 71. State whether the following statements are true (T) or false (F) for Kernel Based Approach. 1) A kernel is a fundamental set of primitives that allows the dynamic creation and control of processes, as well as communication among them. 2). An operating system is an orderly growth of software over the kernel. a. 1-T, 2-T b. 1-T, 2-F c. 1-F, 2-F d. 1-F, 2-T 72. Which of the following statement are true for Schedulers? 1). The long-term scheduler and short-term scheduler differ in the frequency of their execution. 2). A good selection of jobs by the long-term scheduler will give a good mix of both CPU bound and I/O bound processes. 3). A long-term scheduler executes very frequently since new processes are not created at the same pace at which processes need to be executed. a. Only 1 is True b. Only 1and 3 are True c. Only 3 is True d. Only 1and 2 are True 73. State true(T) or false(F) for Shortest-Job-First Scheduling.

1). The SJF algorithm produces the most optimal scheduling scheme. 2). The main disadvantage with the SJF algorithm lies in knowing the length of the next CPU burst. a. 1-T, 2-F b. 1-F, 2-T c. 1-T, 2-T d. 1-F, 2-F 74. In real systems CPU utilization ranges from _____ for a lightly loaded system to ________ for heavily loaded systems. a. 40%, 90% b. 50%, 50% c. 90%, 40% d. 25%, 75% 75. Process manager handles ____________and ___________creation and termination. a. process, memory b. process , thread c. power events, menus d. lines, curves

Part C (10 X 4 = 40 Marks)

76. a) Define operating system. b) Explain different functions of an operating system. 77. What are the advantages and disadvantages of User-level threads? 78. a) Explain program controlled I/O. b) Mention its advantages of program controlled I/O. 79. List and explain the three basic types of multiprocessor operating systems. ( 2 Marks) ( 8 Marks) (10 Marks) (06 Marks) (04 Marks) (10 Marks)

Answer Keys for Multiple Choice Questions

Part - A Q. No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Ans. Key A C B D C C A A A A A A A B A A A A B A Q. No. 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 Ans. Key A C A A A C A D C A A B A C C C A A C A Q. No.

Part - B Ans. Key C A D A D D C B A A B A A C A D A C C A Q. No.

Part - C Ans. Key D D A A A D A C A B A D C A B

41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60

61 62 63 64 65 66 67 68 69 70 71 72 73 74 75

Scheme of Evaluation for Part-C(Descriptive Type) 76) (a) Definition of an operating system- 2 Marks (b) Explanation of functions of an operating system-8 Marks

77) Advantages of User-level threads-05 Marks Disadvantages of User-level threads-05 Marks.

78) (a) Diagram of program controlled I/O- 2 Marks Explanation of program controlled I/O -04 Marks (b) Advantages program controlled I/O -04 Marks

79) List of the three basic types of multiprocessor operating systems-2 Marks Explanation of each type-(2+3+3)=8 Marks.