Scribd
Upload
6 views

OS questions

Uploaded by

rootsha
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
6 views

OS questions

Uploaded by

rootsha
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/ 2

Question bank for OS Viva

Operating System
1. Enlist Types of OS and explain any one type of OS
2. Enlist functions of OS
3. Explain objectives of OS
4. Enlist types of kernel of OS
5. Enlist services provided by OS
6. What is a difference between soft real time system and hard real time system?
7. Explain various states of process model
8. Enlist process scheduling strategies/algorithms for uniprocessor system
9. What is a difference between process and program?
10. What is a difference between thread and process?
11. What is user level thread and what is kernel level thread?
12. Give names of various files of PCB
13. Give names of Various fields of TCB
14. Give the name of algorithms we have used to schedule processes on real time
operation system
15. Give the name of Algorithms to schedule multiprocessor system
16. Enlist features of linux OS
17. Define following terms:
▪ Mutual Exclusion
▪ Turn Around Time
▪ Critical section
▪ Deadlock
▪ Starvation
▪ Seek time
▪ Response time
▪ Live lock
▪ Race condition
▪ Semaphore, strong and week semaphore, binary and counting semaphore
▪ Monitor
▪ Non pre-emption
▪ Hold and wait
▪ Circular wait
▪ fork()
▪ pipe
▪ Resource Allocation Graph
▪ Swapping
▪ Fragmentation and it’s type
▪ Paging
▪ Demand paging
▪ Belady’s Anomaly
▪ Context switching
▪ Compaction
▪ Frame

Prepared By : Prof. Shakuntla Ravani pg. 1


▪ Page
▪ Segment
▪ Zone
▪ Track
▪ Sector
▪ MBR
▪ System Bus
18. Enlist Necessary conditions for deadlock
19. Explain How can we prevent deadlock
20. Explains steps of banker’s algorithm for deadlock avoidance
21. Give names of solutions discussed to achieve mutual exclusion in IPC
22. Which are the necessary conditions of critical section solutions?
23. Using which methods we have seen solution of dining philosopher problem?
24. What is a difference between semaphore and monitor?
25. What are the limitations of semaphore? Why we need to use monitor?
26. Enlist name of page replacement policy
27. Enlist placement algorithms
28. Difference between paging and segmentation
29. Give names of disk scheduling algorithm and also give name of optimal algorithm
30. Explain various levels of RAID
31. What is memory mapped I/O and separate I/O?
32. Explain DMA
33. Draw basic architecture of UNIX
34. Give usage and syntax of following unix commands
▪ grep
▪ date
▪ wc
▪ who
▪ ls
▪ chmod
▪ tput
▪ ifcomfig
▪ wall
▪ cat
▪ find
▪ sort
▪ man

Prepared By : Prof. Shakuntla Ravani pg. 2

You might also like