Question Bank - OS

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 5

Question Bank

Unit-1
Q1: Operating system structure and various services provided by OS?
Q2: Difference between Desktop and Mobile OS.
Q3: Three popular Desktop and Mobile OS available in market?
Q4: Distinguish between the client-server and peer-to-peer models of distributed systems.
Q5: Identify several advantages and several disadvantages of open-source operating systems.
Include the types of people who would find each aspect to be an advantage or a disadvantage.
Q6: Identify which of the functionalities listed below need to be supported by the operating
system for (a) handheld devices and (b) real-time systems. a. Batch programming b. Virtual
memory c. Time sharing
Q7: What system calls have to be executed by a command interpreter or shell in order to start
a new process?
Unit-2
Q1: Describe the differences among short-term, medium-term, and long term scheduling.
Q2: Diagram of process states.
Q3: Difference between CPU bound and I/O bound processes.
Q4: Describe the actions taken by the kernel to context-switch between two processes.
Q5: What are two differences between user-level threads and kernel-level threads? Under
what circumstances is one type better than the other?
Q5: Difference between Preemptive and Non-Preemptive scheduling
Q6: State and explain the various scheduling criteria’s used to evaluation the performance of
a CPU scheduling algorithm (CPU Utilization, Throughput, Waiting Time, turnaround time)
Numerical Questions: Numerical on CPU scheduling algorithms (FCFS, SRTF, SJF, Priority
and Round robins scheduling)
Unit-3:
Q1: What is critical section problem in process synchronization. State and explain the three
requirements to be met by a valid solution to critical section problem (Mutual Exclusion,
Progress and Bounded wait)
Q2: State and explain Peterson’s solution for process synchronization.
Q3: What is called a semaphore. What is the difference between counting and binary
semaphore.
Q4: What is Reader-writer problem in process synchronization.
Q5: What are the four necessary and sufficient conditions (Mutual exclusion, Hold and wait,
No Preemption, circular wait) for deadlock to happen in the system.
Q6: How Wait () and Signal () functions in semaphores help in process synchronization?
Explain with the help of an example.
Numerical Questions: Banker’s algorithm for deadlock detection/avoidance.
Unit-4:
Q1: What is fragmentation in the context of memory management? Explain internal
fragmentation and external fragmentation, and discuss techniques to minimize them.
Q2 : What is Paging technique. Explain Paging hardware with a diagram.
Q3: What is the role of TLB in Paging mechanism. How it help in improving effective
memory access time?
Q4: Consider a paging hardware with a TLB. Assume that the entire page table and all the
pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80
milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory
access time (in milliseconds) is _________.
Q5: Discuss the various memory allocation techniques used in operating systems, such as
contiguous memory allocation, paging, and segmentation. Compare and contrast their
advantages and disadvantages.
Q6: What benefit do we get from virtual memory? What is pure demand paging.
Numerical Question:
Q1: Consider a swapping system in which memory consists of the following hole sizes in
memory order: 10K, 4K, 20K, 18K, 7K, 9K, 12K and 15K. Which hole is taken for
successive segment requests of (a) 12K, (b) 10K, (c) 9K for first fit, best fit and worst fit.
Q2:
Q3: Given page reference string: ● 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 ● Compare the
number of page faults for LRU, FIFO and Optimal page replacement algorithms.
Q4: Consider the following segment table:
Segment
Base Length
No.
0 1219 600
1 300 14
2 902 100
3 327 580
4 952 96

What are the physical addresses for the following logical addresses?
a. 1,130
b. 2,10
c. 0,15
Unit-5:
Numerical Question:

You might also like