Questions for OS
---------- 10 marks ----------
Guaranteed: SPECIFICALLY FOR DEC
Page replacement algo theory + numerical
a.)* List page replacement algorithms? Explain anyone page replacement algorithms
with example
{paired with another 10M ques -- Explain objectives and characteristics of modern
operating system. Explain Network OS } -- DEC of every year
b.) Numerical - FIFO, LRU, Optimal -- MAY of every year
Deadlock + numerical(came just once)
a.)* Give the explanation of necessary conditions for deadlock. Explain how a
resource allocation graph determines a deadlock.
b.) What is a critical region? Explain necessary conditions for deadlock.
c.) What is a deadlock? Explain necessary conditions for deadlock.
d.) NUMERICAL: For the given processes, Using the deadlock detection algorithm
check deadlock is there or not? If deadlock is there, then identify the processes
that are deadlocked.
e.) 5M: Deadlock avoidance, Deadlock recovery
a.) CPU Scheduling Algos - FCFS, SJF, RR, Priority -- MAY of every year
b.)* What is process scheduling? List process scheduling algorithms and explain
anyone scheduling algorithm with example. -- DEC of every year
OPTIONAL -- Compare process scheduling and process switching. (5M)
SPECIFICALLY FOR DEC
a.) What is a process? Explain Process control block in detail. -- DEC of every
year
paired with RAID QUES (10M)
RAID -- observed in all exams but in DEC it's paired with PCB ques
a.) Explain RAID with its different levels.
b.) What is redundant array storage? Explain RAID levels.
SPECIFICALLY FOR DEC
a.) What is thread in OS? Compare user level and kernel level threads.
b.) Give detail comparison of user level and kernel level threads.
paired with
c.) What is an Operating System? Explain structure of Operating System.
---------- 5M -----------
Guaranteed: SPECIFICALLY FOR DEC
QUES 1 - COMPULSORY
Explain process state model.
2. Describe the implementation of file allocation techniques
3. Explain about IPC.
4. Explain memory fragmentation.
5. Compare process scheduling and process switching.
6. What is difference between physical address and virtual address?
QUES 6 - SHORT NOTES - CAN'T RELY ON THIS UNIT
Segmentation/Semaphores
2. File Allocation Methods
3. Memory Allocation
4. Memory fragmentation
5. Deadlock avoidance/Deadlock recovery
6. Network OS/Real Time OS/Android
7. Cache memory/Virtual Memory & IT'S ADVANTAGES
Can come: SPECIFICALLY FOR MAY BUT FEW MAY OCCUR IN DEC
---------- 10M -----------
Learn about the whole Memory fragmentation thing and not just this bc it's easy:
What is Internal fragmentation? Explain static partitioned allocation with
partition sizes 400,180, 100, 300, and 45. Assuming First fit and Best fit method
indicate the memory status after memory request for sizes 95, 180, 285, 380, 30. --
MAY OF EVERY YEAR
What is open-source operating system? What are the design issues of Mobile
operating system and Real time operating system?
Explain paging in detail. Describe how logical address is converted into physical
address.
What is a thread? How multithreading is beneficial? Compare and contrast different
multithreading models.
What is semaphore and its types? How the classic synchronization problem Dining
philosopher is solved using semaphores?
** ABOVE ARE 2022 MAFIA THAT ARE GETTING REPEATED IN MAY OF EVERY YEAR **
---------- 5M -----------
QUES 1 COMPULSORY
1*. Differentiate between process and threads.
2. What are various objectives and functions of Operating System?
SHORT NOTES:
Disk Scheduling