Sunteți pe pagina 1din 10

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY OPERATING SYSTEMS

1.The technique by which only 1 process at a time can use a resource is called as a.Hold and wait b.Mutual exclusion c.No preemption d.Circular wait Ans.Mutual exclusion.

2.A monitor can have condition variables on which only 2 operations are possible such as a.Read and write b.Wait and signal c.Print and scan d.Busy and wait

Ans. b. Wait and signal

3.Which of the following scheduling algorithms could result in starvation? a. FCFS b.Shortest Job First c.Round Robin d.Priority

Ans. d

4.Both the first-fit and best-fit strategies for memory allocation suffer from a.Aging. b.Starvation. c.Internal fragmentation. d.External fragmentation. Ans.d

5.The number of entries in a Translation Lookaside Buffer is often between a.32 and 64 b.64 and 1024. c.1024 and 2048 d.1024 and 4096 Ans. b

6.If the disk head is loaded initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.

310 324 315 321 [Ans]

7.For 5 processes p1, p2, p3, p4, p5 with burst time as 10ms, 1ms, 2ms, 1ms and 5ms respectively, the turnaround time using FCFS is

13.4 [Ans]

11.7 12.4 12.7

8.For 5 processes p1, p2, p3, p4, p5 with burst time as 10ms, 1ms, 2ms, 1ms and 5ms respectively, the turnaround time using SJF is

6 5 7 [Ans] 8

9.For 5 processes p1, p2, p3, p4, p5 with burst time as 10ms, 1ms, 2ms, 1ms and 5ms respectively, the turnaround time using round robin is

10.2 9.2 [Ans] 8.2 11.2

10.For 4 processes p1, p2, p3, p4 with burst time as 8ms, 4ms, 9ms and 5ms respectively, the average waiting time using FCFS is

7.75 8.75 [Ans] 9.75 8.95

11. Consider the following process with the CPU burst time in milliseconds. Find the Average turn around time using Round Robin Scheduling algorithms(Time quantum = 1ms) Process Burst

P1 P2 P3 P4 P5 a) 13.4 b) 7 c) 12 d) 9.2 - Ans

10 1 2 1 5

12. Consider the following process with the CPU burst time in milliseconds. Find the average wait time using SJF Scheduling algorithms Process P1 P2 P3 P4 P5 a) 7 b) 4.6- Ans c) 8.3 d) 3 13. Consider a dynamic paging scheme, where the page numbers and request sequence is as follows 3134241231242313 Given that the main memory has 3 frames, calculate the number of page faults that would occur. Assume that initially none of the pages are in main memory and FIFO algorithm is used of page replacement. Burst 4 8 2 1 5

a) 10-Ans b) 8 c) 9 d) 11 14. Consider a dynamic paging scheme, where the page numbers and request sequence is as follows 3134241231242313 Given that the main memory has 3 frames, calculate the number of page faults that would occur. Assume that initially none of the pages are in main memory and LRU algorithm is used of page replacement. a) 10 b) 9-ans c) 8 d) 11 15. Given memory partitions of 100k, 500k, 200k, 300k and 600k (in order), how would each of the first fit, best fit and worst fit algorithms place processes of 212k,417k,112k and 426k(in order)? Which algorithm makes the most efficient use of memory? a) First fit b) Best fit-Ans c) Worst fit d) None 16. Consider the following processes P1, P2, P3, P4 are arrived in such a way (Shown below) and also given CPU burst time in the milliseconds. Calculate the Average turn around time using FCFS Scheduling algorithms Process P1 P2 P3 Arrival time 0 1 2 Burst 8 4 9

P4

a) 15.25-Ans b) 13 c) 19.25 d) 9.2

7. If Round Robin is used with a time quantum of 1 second, the turnaround time for Job 2 will be Job Number 1 2 3 a) 1 second b) 2 seconds - Ans c) 1 hour d) 1 hour, 1 seconds 8. Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order) and processes of 212K, 417K, 112K, and 426K (in order), using the first-fit algorithm in which partition would the process requiring 426K be placed? a. 100k b. 500k c. 200k d. 600k - Ans 9. A page fault means that we referenced a page a) outside the memory boundaries b) with an incorrect I/O request c) that was not in secondary storage d) that was not in main memory - Ans 10. Which environment considers memory, process, and device and file management from a global viewpoint? a) Distributed Operating System (DO/S) - Ans b) Network Operating System (NOS) c) Multiprogramming Operating System (MOS) d) None of the above CPU Time 1 hour 1 second 1 second

11.Which of the following scheduling algorithms could result in starvation? a. FCFS b.Shortest Job First c.Round Robin d.Priority

Ans. d

12.Both the first-fit and best-fit strategies for memory allocation suffer from a.Aging. b.Starvation. c.Internal fragmentation. d.External fragmentation. Ans.d

13.The number of entries in a Translation Lookaside Buffer is often between a.32 and 64 b.64 and 1024. c.1024 and 2048 d.1024 and 4096 Ans. b

14.The VAX machine has a page size of: a. 1024 bytes.

b. 256 bytes. c. 512 bytes. d. 2048 bytes. Ans. c

15.One solution to the problem of external fragmentation is: a. Using First-fit strategy. b. Using Best-fit strategy. c.Compaction d.Dynamic binding Ans. c

16.Which among the following are used in Bankers algorithm: a.Gantt chart b.Resource Allocation Graph c.Bar chart d.Pie chart Ans.b

17.A coomon representation for a discussion of process scheduling is a a.Flowchart b.Queueing diagram c.E-R diagram d.Data Flow Diagram. Ans. b

18.Which among the following is not a classic problem of synchronization: a.The Bounded-Buffer problem b.The Readers-Writers problem. c.Critical Analysis problem d.The Dining-Philosophers problem Ans. c

19.The interval from the time of submission of a process to the time of completion is: a.The turnaround time b.Response time c.Waiting time d.Minimum waiting time Ans. a

20.An example for a classic software-based solution to the critical-section problem is: a.Bankers algorithm. b.Petersons solution. c.Rumbaughs solution. d.Booch solution. Ans. b