Guru Nanak Institutions Technical Campus(Autonomous)
Da
Question Bank with Blooms Taxonomy Level (BTL)
Name of the Subject : Operating Systems
Subject Code : 22PC0CS08
Class : II CSE II Sem
Academic Year : 2023-2024
BTL- Blooms Taxonomy Level:
Level 1 – Remembering
Level 2- Understanding
Level 3- Applying
Level 4- Analyzing
Level 5- Evaluating
Level 6- Creating
Sl. Questions BTL Course
No. level Outcome
UNIT – I
Very short Answer Questions (1Mark)
1 What is operating systems? L1 CO1
2 Define process . L1 CO1
3 What is Thread? L1 CO1
4 Define Process Control Block (PCB). L1 CO1
5 Give example for System calls. L3 CO1
6 What are the goals of Operating System. L1 CO1
7 What is a system call? L1 CO1
8 What is Kernel? L1 CO1
9 Expand RTOS. L1 CO1
10 Define Context Switching. L1 CO1
Short Answer Questions (5 Marks)
1 Discuss Multiprogramming and Parallel Operating System. L2 CO1
2 Classify different types of system calls with suitable examples.(MIDFP) L2 CO1
3 Describe various services provided by operating system.(PFICES) L2 CO1
4 Write about time-sharing and distributed operating systems in brief. )L3 CO1
5 List out any services of operating systems.(PFICES) )L1 CO1
6 Explain various states of process with neat diagram. L2 CO1
Long Answer Questions (10 Marks)
1 Paraphrase Process Control Block in detail. L2 CO1
2 Describe the Operating System Structures.(MELMS)
3 What is a Thread? List and Explain various types of Threads. L1 CO1
4 Explain briefly about various components of Operating System. (PMFSIN) L2 CO1
5 Discuss about Context Switching in detail. L2 CO1
UNIT – II
Very short Answer Questions (1Mark)
1 What is non-preemptive scheduling. L1 CO2
2 Define turnaround time. L1 CO2
3 What is deadlock? L1 CO2
4 Define Scheduler. L1 CO2
5 Expand RAG L1 CO2
6 What is time quantum L1 CO2
7 What is FCFS L1 CO2
8 What is Mutual Exclusion? L1 CO2
9 State the Purpose of fork ( ) System call L1 CO2
10 What is Gantt chart? L1 CO2
Short Answer Questions (5 Marks)
Consider the following set of processes, with the length of the CPU burst
given in milliseconds:
Process Burst Time
P1 27
P2 12
P3 37
1 P4 19 L3 CO2
P5 10
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5
all at time 0. Draw the Gantt charts that illustrate the execution of these
processes using the following scheduling algorithms: FCFS, SJF. Also
determine the average waiting time and average turnaround time for each
of the algorithms.
What is Deadlock Recovery? Describe various methods of Deadlock
2 L2 CO2
Recovery.
3 Discuss the criteria for evaluating the CPU scheduling algorithm. L2 CO2
Consider the following set of processes, with CPU burst time given in
milliseconds
Process burst time Priority
A 6 4
B 8 2
C 12 1
4 D 4 3 L3 CO2
All processes are assumed to have arrived in the order A, B, C, D all at
time 0 and lower value in priority have higher priority. What is
turnaround time and waiting time of each process for non pre-emptive
priority scheduling and Round Robin scheduling (time slice = 1ms). What
is the average turnaround time and the average waiting time?
5 What are the necessary and sufficient conditions to occur deadlock? L1 CO2
Long Answer Questions (10 Marks)
1 Describe Long Term, Short Term and Medium term Scheduling. L2 CO2
2 How is Deadlock Prevented? Discuss with an example. L2 CO2
3 Explain about context switching with a neat diagram. L2 CO2
What is Deadlock Avoidance? Explain Bankers algorithm and state its
4 L2 CO2
advantages.
Illustrate the following System calls -fork( ), exit( ), wait( ), waitpid( ) and
5 L2 CO2
exec( ) with suitable examples
Consider the following snapshot of a system:
Process Allocation Max Available
ABCD ABCD ABCD
P0 0 0 1 2 0 0 1 2 2 1 0 0
P1 2 0 0 0 2 7 5 0
P2 0 0 3 4 6 6 56
6 L3 CO2
P3 2 3 4 5 4 3 56
P4 0 3 3 2 0 6 5 2
Answer the following questions using the banker’s algorithm:
a. Is the system in a safe state? Why
b. Is the system currently deadlocked? Which process, if any, or may
become deadlocked if the whole request is granted immediately?
UNIT – III
Very short Answer Questions (1Mark)
1 What is a critical section? L1 CO3
2 Define IPC. L1 CO3
2 Define Race condition. L1 CO3
3 What is the importance of process synchronization? L1 CO3
4 Define Semaphore. L1 CO3
5 Define wait ( ) operation L1 CO3
6 What is monitor L1 CO3
7 What is the use of Shared Memory? L1 CO3
8 Define signal ( ) operation L1 CO3
9 What is Message Queues in IPC. L1 CO3
10 What is synchronization? L1 CO3
Short Answer Questions (5 Marks)
Explain the hardware instructions Test_and_set( ) and campare_and_swap(
1 )
L2 CO3
2 L3 CO3
3 Write about Peterson’s Solution to the Critical Section Problem. L3 CO3
4 Describe the solution to dining philosopher’s problem using monitors. L2 CO3
5 Demonstrate Readers-Writers problem with example. L3 CO3
Long Answer Questions (10 Marks)
1 Discuss the solution to producer–consumer problem by using semaphores. L2 CO3
2 Explain briefly about Critical Section Problem. L2 CO3
3 Give the implementation of Producer-Consumer Problem using monitors. L2 CO3
What is a pipe? How it is used for communication between different
4 L2 CO3
processes.
Explain Inter Process Communication using Message Queues.
5 L2 CO3
UNIT – IV
Very short Answer Questions (1Mark)
q1 State first fit and best fit memory allocation techniques. L1 CO4
2 What is Belady’s anomaly? L1 CO4
3 What is virtual memory? L1 CO4
4 Define logical address. L1 CO4
5 What is a Page fault? L1 CO4
6 What is Demand paging? L1 CO4
7 What is Frame? L1 CO4
8 Define physical address L1 CO4
9 What is meant by thrashing? L1 CO4
10 Expand LRU. L2 CO4
Short Answer Questions (5 Marks)
1 Describe various Contiguous memory allocation techniques with example L2 CO4
What is Paging? Explain how you calculate physical address from logical
2 address using page table with suitable example.
L2
Consider the following page reference strings:
1,2,3,4,2,1,5,6,2,1,2,3,2,1,2,3,6. How many page faults would occur for
3 the following replacement algorithm, assuming three, four frames using L3 CO4
LRU? Remember that all frames are initially empty, so your first unique
pages will cost one fault each.
4 What is demand paging and how it is implemented? L2 CO4
Discuss in detail about least recently used(LRU) page replacement
5 algorithm with example.
L2 CO4
Long Answer Questions (10 Marks)
Consider the following page reference strings:
7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 How many page faults would occur
for the following replacement algorithm, assuming three frames using
6 L3 CO4
FIFO, Optimal? Remember that all frames are initially empty, so your first
unique pages will cost one fault each.
Explain the terms in Memory Partitioning with examples
7 L2 CO4
a. Fixed partitioning b. Dynamic partitioning.
8 What is page fault? Describe page fault mechanism with neat sketch. L2 CO4
9 Compare internal and external fragmentation. L4 CO4
10 Differentiate between paging and segmentation. L4 CO4
UNIT – V
Very short Answer Questions (1Mark)
1 Give one file accessing method. L1 CO5
2 What is bit map? L1 CO5
3 What is file? L1 CO5
4 State about linked file allocation method. L1 CO5
What is Free Space Management?
5 L1 CO5
6 Define File. Enlist the attributes of a file. L1 CO5
7 What is file system structure? L1 CO5
8 What is contiguous file allocation method. L1 CO5
9 What is the purpose of system call L1 CO5
10 Give a system call example that is used in File operations. L1 CO5
Short Answer Questions (5 Marks)
1 State and explain various file access methods. L2 CO5
2 Explain briefly about file system structure. L2 CO5
Discuss various approaches for free space manageme = nt in
3 memory.
L2 CO5
4 Write contiguous and linked file allocation methods. L3 CO5
Explain the following with relevant diagrams:
5 a) Single level directory structure b) Two-level directory structure.
L2 CO5
Long Answer Questions (10 Marks)
6 Discuss the indexed file allocation method with an example. L2 CO5
7 What is a Directory? Write a short note on Directory implementation. L2 CO5
Explain about the following System calls
8 L2 CO5
open(),read(),write(),lseek(),stat() and ioctl()
9 Compare the IPC functionality provided by message queues with shared L4 CO5
memory.
Define unnamed pipe? How do we create unnamed pipe? Explain the
10 L2 CO5
limitations of unnamed pipe.
