Scribd
Upload
31 views3 pages

Os Imp Qsns - 2022 Scheme

Uploaded by

Puneeth M
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
31 views3 pages

Os Imp Qsns - 2022 Scheme

Uploaded by

Puneeth M
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

2022 SCHEME OPERATING SYSTEMS MOST IMP QUESTIONS

OPERATING SYSTEM – MOST IMPORTANT QUESTIONS


1. What is an OS? Explain its role from user & system point of view.
2. What is operating system? Explain multiprogramming and time-sharing system.
3. Explain dual mode operating in operating system with a neat block diagram.
4. What are system calls? Briefly print out its types.
5. What is Inter process communication? Explain direct and indirect
communication with respect to message passing system.
Or
Discuss the methods to implement message passing IPC in detail.
6. Analyze modular kernel approach with layered approach with a neat sketch.
7. Illustrate with a neat sketch, the process states and process control block.
8. With a neat diagram, explain the concept of virtual machines.
9. What is a thread? Write a note on multithreading models
10. Explain The various Threading issues

11. Define the following:

12. CPU utilization 15. Waiting time

13. Throughput 16. Response time

14. Turnaround time

17. Process / CPU scheduling problems.

18. Explain multilevel and multilevel feedback queue.

19. What are semaphores? Explain two primitive semaphore operations. What are
its advantages? Explain solution to producer-consumer problem using
semaphores

20. What is critical section? Explain the various methods to implement process
synchronization. Explain three requirements that a solution to critical –section
problem must satisfy.
21. State Dining Philosopher’s problem and give a solution using semaphores.
Write structure o f philosopher. Describe term monitor. Explain solution to
dining philosophers.
22. What do you mean by binary semaphore and counting semaphore? With

Dept of CSE, SDIT Page 1


2022 SCHEME OPERATING SYSTEMS MOST IMP QUESTIONS

C struct, explain the implementation of wait () and signal(). Semaphore as


General Synchronization Tool.

23. Explain the various classical synchronization problems.


DEADLOCKS
24. What are deadlocks? What are its characteristics? Explain the necessary
conditions for its occurrence. Explain the process of recovery from deadlock.
25. What is Resource Allocation Graph (RAG)?
26. Describe RAG:

i) With deadlock
ii) With a cycle but no deadlock
27. Write safety algorithm and resource request algorithm. Banker’s algorithm
problems.
MEMORY MANAGEMENT
28. Explain the multistep processing of a user program with a neat
block diagram.
OR
What do you mean by address binding? Explain with the necessary steps,
the binding of instructions and data to memory addresses.
29. Distinguish between internal and external fragmentation.
30. Explain segmentation with an example.
31. Explain with a diagram, how TLB is used to solve the problem of simple paging
scheme.
32. What are the memory allocations? Explain each of them with suitable diagrams.
33. Distinguish between:
a. Logical address space and physical address space.
b. Internal fragmentation and external fragmentation.
c. Paging and segmentation.
34. Explain with the help of supporting hardware diagram how the TLB improves
the performance of a demand paging system.
35. What is fragmentation? Explain two types of memory fragmentation.
36. What is swapping? Explain in detail.

Dept of CSE, SDIT Page 2


2022 SCHEME OPERATING SYSTEMS MOST IMP QUESTIONS

37. What is a file? Distinguish between contiguous, indexed and linked allocation
methods with diagrams.
or
Explain file allocation methods by taking an example with the neat
diagram. Write the advantages and disadvantages.
38. Explain free space management. Explain typical file control block, with a neat
sketch.

39. Explain Demand paging in detail


40. Explain copy-on-write process in virtual memory.

41. What is a page fault? with the supporting diagram explain the steps
involved in handling page fault.

42. Explain the various types of directory structures.

43. Explain the various file attributes and file operations.

A. For the following page reference string 1,2,3,4,1,2,5,1,2,3,4,5. Calculate the


page fault using FIFO, Optimal and LRU using 3 and 4 frames.

B. For the following page reference string


7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. Calculate the page faults using
FIFO, Optimal and LRU using 3 and 4 frames.
44. What is an access matrix? Explain the different methods of implementing
access matrix. ‘OR’ Explain the access matrix model of implementing protection
in operating system. ‘OR’ Explain access matrix method of system protection.
45. List the different disk scheduling techniques, explain any two scheduling,
consider t h e following disk queue requests. 98,183,37,22,14,124,65,67.
OR
Explain the various Disk Scheduling algorithms with example.
OR
Explain the following disk scheduling algorithm in brief with examples.
I. FCFS III. SCAN
II. SSTF IV. LOOK
46. Explain bad-block recovery in disk?

Dept of CSE, SDIT Page 3

You might also like