Operating System

5 Quiz: Each has 2 marks

(from 09 to 21st January)

• Quiz:1- Lecture-01 to Lecture-03

• Quiz:2- Lecture-04 to Lecture-07
• Quiz:3- Lecture-10 to Lecture-12
• Quiz:4- Lecture-13 to Lecture-17
• Quiz:5- Lecture-19 to Lecture-23
 Unit- I
Lecture-01
What is Operating System?
What are the four main purposes of an operating system?
How have Operating systems been evolving through the years?
What are the types of Operating System? What is NOS?
Describe the objective of multiprogramming. How is it different
from multitasking?
What is difference between Soft Real Time and Hard Real Time
Operating Systems?
Lecture-02
What are the main Operating System Components (Concepts)?
What are the Operating system services for process management?
How many types of Structures for developing an Operating System?
Lecture-03
Explain process, process control block and threads?
What resources are used when a thread is created? How do they
differ from those used when a process is created?
Explain the use of system call in Operating Systems.
Explain the use of fork() system call.
What is Kernel?
What is the meaning of Spooling?
What is Multithreading Model?
Lecture-04
What is Life Cycle of a Process?
What are the different process states?
What is a scheduler and its criteria?
Mention two disadvantages of SJF and FCFS scheduling
algorithms.
Write the important notes of Round-Robin (RR) scheduling
with increasing value of time quantum.
What is convoy effect?
Write down the differences between long term scheduler,
medium-term scheduler and short-term scheduler.
Lecture-05
Why and how do we predict burst time in SJF?
Why do we draw Gantt chart and find average waiting and
turnaround time?
Lecture-06
Explain Highest Response Ratio Next (HRRN) algorithm.
Why are we using Priority Scheduling algorithm?
Lecture-07
List the services provided by an operating system. Explain how
each provides convenience to the users.
 Unit- II
Lecture-10
What is a critical-section problem and what
are the requirements which satisfy the
solutions to the critical-section problem?
What is Inter-process Communication and
Process Synchronization?
What is the Race condition?
Lecture-11
Define how Peterson’s solution solves the
critical-problem?
Describe how the test_and_set () instruction
can be used to provide mutual exclusion that
satisfies the bounded waiting requirement.
Lecture-12
What is Semaphore? What operations can be
performed on a semaphore? What are the
differences between binary semaphore and
counting semaphore?
Write the advantages and disadvantages of
Semaphores.
Lecture-13
What is the bounded-buffer problem? Write the solution
for the producer and consumer process of process
synchronization using semaphore.
Using semaphore, write a solution to reader and writers
problem.
State and explain the Dining-Philosophers Problem
Algorithm
Lecture-14
What is Condition Variable in a monitor?
Explain actions on a Condition Variable in a monitor.
How is a monitor different from Semaphores?
Write the monitor solution to Dining-Philosophers
problem.
Lecture-16
What is deadlock? State the necessary conditions for
deadlock to occur.
Lecture-17
Mention the strategies adopted to avoid the deadlock
situation.
Explain Banker’s algorithm.
 Unit- III and Unit- IV
Lecture-19
What is Memory-Management Unit (MMU)?
Explain Swapping in memory management.
Differentiate between Internal and External fragmentations.
Lecture-20
Explain different Address Types in memory management.
Lecture-21
Explain different Allocation of MM to the processes.
What is page table. Write down the importance of TLB.
Lecture-22
Describe the challenges for replacement techniques.
Lecture-23
Explain the Belady’s Anomaly.
Explain thrashing and how it can be avoided using working set
model?
Lecture-24, 25, 26
Describe Directory Structure in File management.
Mention file allocation techniques.
Define Disk Access Time. What is DMA?
Numerical
Q1: FCFS, SJF, Multilevel queue scheduling.
Q2:A counting semaphore S is initialized to 100. Then, 150 P
operations and 70 V operations are performed on S. What is the
final value of S?
Q3: Calculate the predicted burst time using exponential
averaging for the fifth process if the predicted burst time for the
first process is 50 units and actual burst time of the first four
processes is 45, 85, 65 and 75 units respectively. Given α = 0.6.
Q4: First-fit, best-fit and worst-fit algorithms of memory
allocation.
Q5: Finding bits for logical address and physical address spaces.
Q6: Effective Access Time in a paging scheme useing a
Translation Lookaside buffer (TLB).
Q7: FIFO and LRU page replacement techniques.
Q8: FCFS and SCAN disk scheduling algorithms.