0% found this document useful (0 votes)
32 views3 pages

Os Bank 2024

question bank OS

Uploaded by

hago sohani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views3 pages

Os Bank 2024

question bank OS

Uploaded by

hago sohani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

CLASS: - S. Y. B. Tech.

SEM: - IV SESSION: - 2021 – 2022

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

2.a Explain Operating System services.


2.b What are the differences between:

(1) Long-term scheduler and short-term scheduler?


(2) Preemptive and non-preemptive scheduling?
(3) CPU-bound process and I/O-bound process?
(4) Time sharing system and batch system?
3. Explain monolithic operating structure.
4. Explain microkernel operating system structure.
5. Explain Multiprogramming operating system.
6. Explain Real time operating system with its types.
7. Explain system call and its procedure.
8. Explain Operating system components.
9. Explain Virtual Machine with its example.
10. Explain Multiprocessor operating system.
Unit-II
8. Explain CPU Scheduling criteria.
9. Explain different types of Scheduler.
10. Explain queuing diagram.
11. Explain CPU and I/O burst cycle.
12.a Explain Multithreading and types of thread.
12.b Explain Kernel level thread and user level thread.

13. Calculate TAT,WT,RT,Throughtput of following system using CPU Scheduling algorithm


a. SJF b. Prempeetive Priority c. FCFS

Process Arrival Burst Priority


ID Time Time

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.

19. Explain hardware synchronization using :


a. Lock and Unlock b. Test and Set
20. Explain Monitor to solve the problem of process synchronization.
21. Explain Dining Philosopher problem of process synchronization.
22. Explain readers and writers problem of process synchronization.
23. Explain Deadlock and its characterization.
24. Explain Resources allocation graph and wait for graph.
25. Explain deadlock prevention and handling.
26. Considering a system with five processes P0 through P4 and three resources of type A, B, C.
Resource type A has 10 instances, B has 5 instances and type C has 7 instances. Suppose at
time t0 following snapshot of the system has been taken:

Question1. What will be the content of the Need matrix?


Question2. Is the system in a safe state? If Yes, then what is the safe sequence?
Question3. What will happen if process P1 requests one additional instance of resource type A
and two instances of resource type C?
Unit-IV
27. Explain logical address and physical address and its mapping.
28. Explain contiguous and non-contiguous memory management allocation.
29. What is fragmentation? Explain internal and external fragmentation with example.
30. Explain Paging with
i.Principle of operation ii. Page allocation
31. Explain demand paging and page fault.
32. Explain Protection and sharing in paging.
33. Explain

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.

44. Explain Disk attachment as

i. Network-Attached Storage

ii.Storage Attached Network

You might also like