Os Bank 2024
Os Bank 2024
OPERATING SYSTEM
Sr. No. Unit-I
1.a What is Operating System ?Why Operating System called as resource manager?
1.b Explain
i .process state diagram
ii. process control box
P1 0 8 2
P2 1 4 4
1
P3 2 2 3
P4 3 1 1
P5 4 3 5
P6 5 2 6
14. Explain Thread Scheduling.
15. Explain Multilevel feedback queue scheduling.
Unit-III
16. Explain Critical Section problem.
17. What is critical region? Explain Peterson‘s Solution for Critical Section problem.
18. Explain Semaphore and its type.
2
i.Working set
ii.Dirty page / Dirty bit
34. Let’s say the reference string is 0 4 1 4 2 4 3 4 2 4 0 4 1 4 2 4 3 4 and we
have 3 frames. Let’s see how the algorithm proceeds by tracking the second chance
algorithm does as well as the LRU method.
35. Let’s say the reference string is 0 4 1 4 2 4 3 4 2 4 0 4 1 4 2 4 3 4 and we
have 3 frames. Let’s see how the algorithm proceeds by tracking the Optimal page
algorithm does as well as the NRU method.
36. How process of page fault handling?
37. Explain algorithms used for allocating the partitions to the arriving processes with example.
Unit-V
38. Explain following:
1.Access methods, 2.File types, 3.File operation
39. Explain following directory structure with advantage and disadvantages
i.Tree-structured directory ii.Acyclic Graph directory
40. Explain file allocation methods with advantage and disadvantages.
i. indexed ii. linked
41. Explain free space management in operating system
i.Bitmap or Bit vector ii. Linked List
42. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14,
124, 65, 67. The SSTF, C-SCAN , C-LOOK scheduling algorithm is used. The head is
initially at cylinder number 53 moving towards larger cylinder numbers on its servicing
pass.
43. Explain mass storage as Solid-State Disks.
i. Network-Attached Storage