SOMAIYA

VIDYAVIHAR

K J Somaiya Institute of Technology

An Autonomous Institute permanently affiliated to University of Mumbai.
Accredited with A grade by NAAC, approved by AICTE, new Delhi.

Department of Artificial Intelligence and Data Science

Class: SY-AIDS Operating System Course Code:AIC403 Semester: IV

Academic Year 2024-25

Question Bank for Operating System

1 Define Operating System and also explain objectives of OS? R

2 What is OS? What is the need of an OS? Discuss major functions Un

of OS with examples?

3 Describe three general methods for passing parameters to the OS? Un

4 List functions of OS and explain one of them in detail Un

5 Write a short note on the evolution of OS? Un

6 With the help of a neat diagram explaining OS services? Un

7 Define System calls. Explain the process management system in detail. R

8 List and Explain file related system call in detail. Un

9 List types of OS structure and explain the advantages of R

microkernel approach.

10 Explain in detail Linux shell with its types? Un

11 What is the process? Explain multiple parts of the process in Un

memory.

12 What is a context switch? Describe the action taken by a kernel to context Un

switch between processes.

13 Describe the differences among short-term, medium term and long-term Un

scheduling.

14 Why is it important for the scheduler to distinguish I/O bound programs Un

from CPU bound programs?

15 Draw and Explain 5 state Process state transition diagrams. Un

16 Draw and Explain 7 state Process state transition diagrams. Un

17 Explain the use of the Process control Block (PCB). Discuss the content of Un
PCB.

18 What is meant by preemptive scheduling? How does it affect the system Un

performance vis-à-vis non-preemptive scheduling?

19 What are zombies and orphans in process management? Un

20 Discuss round robin scheduling policy with its merits and demerits. What is Un
the impact of the quantum of time slice on the system performance?

21 Briefly describe the three types of processor schedulers. Un

22 What is usually the critical performance requirement in an interactive Un

operating system?

23 For process scheduling, does a low-priority value Un

represent a low priority or a high priority?

24 What is the difference between preemptive and non-pre-emptive Un

scheduling?

25 List types of scheduling algorithms and briefly define anyone. R

26 What are the merits and demerits of SJF policy? Un

27 Which of the following scheduling algorithms could Un

result in starvation?
First Come first served
Shortest Job First
Round robin
Priority

28 Explain the differences in how much the following Un

scheduling algorithms discriminate in favour of short processes.
a) FCFS b) RR

29 Numerical on scheduling algorithm. Ap

1. FCFS
2. SJF (Non-preemptive and Preemptive)
3. SRTF
4. Priority (Non-preemptive and Preemptive)
5. Round Robin
Calculate Avg. WT and Avg.TAT.

30 Explain in detail the operation on process as process creation and Un

termination.

31 Explain in detail Multiprocessor scheduling. Un

32 Explain the term processor affinity, soft affinity and hard affinity and load Un
balancing.

33 List and explain types of latency in real time scheduling. Un

Also justify how latency affects the performance of real time scheduling.

34 Explain in detail real time scheduling. Un

35 List and explain real time scheduling algorithms. Un

36 Explain thread with help of suitable examples. Un

37 Explain multithreading and its models. Un

38 Which of the following components of program state are shared Un

across threads in a multithreaded process?
Register value
Heap memory
Global variables
Stack Memory

39 Explain Inter-Process Communication (IPC) mechanisms with suitable Un

examples.

40 What is race condition? Explain with suitable examples. Un

41 What is the bounded buffer problem? Un

42 What is the producer-consumer problem?Explain with suitable programs and Un

examples.

43 Show that, if the wait() and signal() semaphore operations are not An
executed automatically, then mutual exclusion may be violated.

44 Explain critical section problems in detail. Give the three requirements Un

that should be satisfied by a solution to the critical section problem.

45 Explain Peterson’s solution for the Critical section. Also Justify how the An
mutual exclusion, progress and bounded waiting are satisfied?

46 What is the critical-section problem? List software and hardware solutions Un

of the critical-section problem and describe any of it.

47 Show how to implement the wait() and signal() semaphore An

operations in a multiprocessor environment using the TestAndSet()
instruction.

48 Compare Semaphores and Mutex. Un

49 Differentiate between binary semaphores and counting semaphores. Un

50 What is semaphore? Show how to avoid race conditions in producer Un
and consumer problems.

51 Explain the working of Semaphores with an example of how they can be Un

used to solve synchronization problems.

52 How Reader and writer problems are solved using semaphore. An

53 Explain Dining Philosophers Problem. Un

54 What is the dining philosopher problem? Explain Dining Un

philosophers’ solution using any one method.

55 Give examples of reusable and consumable resources. Un

56 What are the three conditions that must be present for a deadlock to be Un
possible.

57 What are the four conditions that create deadlock? Un

58 How can the hold-and-wait condition be prevented? An

59 List two ways in which the no preemption condition can be prevented. Un

60 How can the circular wait condition be prevented? An

61 What is the difference among deadlock avoidance, detection and Un

prevention?

62 Numerical on Resource allocation graph Ap

63 Numerical on banker’s algorithm Ap

64 What is thrashing? How is it handled? Un

65 What is demand paging? What are the advantages? Un

66 Explain the concept of virtual memory. Un

67 Consider a system consisting of m resources of the same type , being shared Ap

by n processes. Resources can be requested and released by processes only
one at a time. Show that the system is deadlock free if the following two
conditions are hold:
a. The maximum need of each process is between 1 and m resources.
b. The sum of all maximum needs is less than the m+n.
68 A variable partition memory system has at some point in time the following Ap
holes sizes in the given order: -
20K,15K,40K,60K,10K,25K. A new process is to be loaded. Which hole size
would be filled using best-fit, first-fit and worst fit respectively?

69 What is the need of page replacement? Consider following reference string Ap

7, 0 , 1 ,2 ,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1
Find the number of Page Faults with FIFO, optimal page replacement and
LRU with four frames which are empty initially. Which algorithm gives the
minimum number of page faults.

70 What is paging? How is it different from segmentation? Explain hardware Un

support for paging?

71 Compare the following main memory organization schemes: contiguous An

memory allocation, pure segmentation and pure paging with respect to the
following issues:
1) External fragmentation
2) Internal fragmentation

72 With the help of a neat diagram explaining the hardware support with TLB Un
paging.

73 Justify the statement: Demand paging can significantly affect Ap

performance of computer systems.
Consider the following page reference string:
. How many page faults would

74 occur for the following replacement algorithms, assuming one, two, three,
four, five, six and seven frames?
LRU replacement
FIFO replacement
Optimal replacement

75 Compare and contrast given allocation methods: contiguous An

allocation, Linked allocation, Indexed allocation.

76 Write short notes on: Memory segmentation Un

77 Given memory partitions of 100KB,500KB,200KB,300KB and 600KB (in Ap

order), how would each of the first fit and worst fit algorithms place processes
of 212KB,417KB,112KB and 426KB (in order)? Which algorithm makes the
most efficient use of memory?

78 Explain demand paging with suitable examples. Un

79 What is address translation? Consider a logical address space of 32 pages Ap
with 1,024 words per page, mapped onto a physical memory of 16 frames.
a. How many bits are required in the logical address? b. How
many bits are required in the physical address?

80 Write short notes on a) Translation Lookaside buffer Un

b) Page replacement algorithms

81 Consider a logical address space of 256 pages with a 4 KB page size, Ap

mapped onto a physical memory of 64 frames.
a. How many bits are required for a logical address? b. How many
bits are required for the physical address?

82 What is the difference between simple paging and virtual memory paging? An

83 What is paging and explain address translation in a paging system with Un

suitable diagrams.

84 What is the difference between internal and external fragmentation? An

85 Numerical on Effective Memory access time (TLB) Ap

Numerical Memory Segmentation physical address generation and trap
generation?

86 What is Page table and Inverted page table? Un

87 What are the distinctions among logical, relative and physical Un

addresses?

88 What is the difference between a page and a frame? Un

What is the difference between a page and a segment?

89 Explain with neat diagram hardware architecture of “Inverted Paging” Un

90 Explain with neat diagram hardware architecture of “Segmented Paging” Un

91 What is the difference between a field and a record? Un

92 What is the difference between a file and a database? Un

93 What is a file management system? Explain with neat diagram elements of file Un
management.

94 What criteria are important in choosing a file organization? Un

95 List and briefly define five file organizations? R

96 Why is the average search time to find a record in a file less for an indexed An
sequential file than for a sequential file.
97 What are typical operations that may be performed on a directory? Un

98 What is the relationship between a pathname and a working directory? Un

99 What are typical access rights that may be granted or denied to a particular Un
user for a particular file?

100 List and briefly define three techniques for performing I/O R

101 What is the difference between logical I/O and device I/O? Un

102 Write short note on DMA Un

103 What is the difference between block-oriented devices and stream oriented Un
devices? Give a few examples of each.

104 Why would you expect improved performance using a double buffer rather Un
than a single buffer for I/O?

105 What delay elements are involved in a disk read or write? Un

106 Perform the analysis FCFS, SSTF, SCAN, CSCAN, LOOK, C-LOOK for the Ap
following sequence of disk track requests:
27,129,110,186,147,41,10,64,120. Assume that the disk head is initially
positioned over track 100 and is moving in the direction of decreasing track
number.