Department of Computer Science and Engineering

Global Campus ,Jakkasandra Post, Kanakapura Taluk, Ramanagara District, Pin Code: 562 112

Q. No Questions
Module 1: Introduction to operating System
1 What is an Operating System? Describe the goals of an operating system.
2 With a neat diagram explain components of computer system. Discuss the different views of
OS.
3 Discuss the evolution of mainframe systems.
OR
Describe the features of:
i) Batch Systems
ii) Multi-programmed Systems
iii)Time sharing Systems
4 What are the advantages of multi-processor systems? Differentiate between symmetric and
asymmetric multiprocessor systems.
5 Discuss the various components of an Operating System in detail.
OR
Mention the activities connected with process management, memory management, device
management and file management.
6 Explain two sets of operating system services that are helpful to user as well as efficient
operation of the system.
7 What are system calls? Explain the different categories of system calls.
8 What are system programs? Describe the categories of system programs.
9 Discuss different Operating system structures along with their advantages and
disadvantages.
10 What is a virtual machine? With a neat diagram discuss the implementation of virtual
machine along with its benefits.
11 What is a process? With the help of a state-transition diagram, explain the various states of a
process.
12 What is PCB? List out the contents of PCB with a neat diagram.
13 List out the differences between process and thread.
OR
Define thread. Mention the benefits of Threads over Processes?
14 What is a scheduler? With a neat diagram discuss how process scheduling is done by
operating system.
15 Describe the functions of long term, medium term and short term schedulers with a block
diagram.
16 What are the benefits offered by cooperating processes? Explain direct and indirect
communications with respect to message passing system.
OR
What are the benefits offered by cooperating processes? Discuss two fundamental methods
of inter process communication.
17 Discuss how processes creation and termination is supported by an operating system?
18 Discuss the design characteristics of message passing systems.
OR
Explain direct and indirect communications with respect to message passing system.
Proces Arrival Burst time Priority
s Time
P1 0 7 3
Department of Computer Science and Engineering
P2 2 4 1
P3 4 1
Global Campus 4Kanakapura Taluk, Ramanagara District, Pin Code: 562 112
,Jakkasandra Post,

P4 5 4 2

19 List out the differences between user level threads and kernel level threads.
20 With a neat diagram discuss various multithreading models along with their advantages and
disadvantages.
Module 2: CPU Scheduling
1 What is scheduling? Differentiate between pre-emptive and non pre-emptive scheduling.
2 Define a dispatcher. What are the functions of a dispatcher?
3 Discuss the issues in multiple-processor scheduling.
4 Define all scheduling criteria’s.
5 With a neat diagram explain multilevel queue scheduling.
6 Differentiate between pre-emptive and non pre-emptive scheduling algorithms.
7 With a neat diagram explain multilevel feedback queue scheduling.
8 Define the following :
i) Dispatch Latency
ii) Throughput
iii) Turnaround time
iv) Dispatcher
v) Waiting time
10 For the following set of the process find the average waiting time and average turn around
turn using FCFS, SJF, SRTF, pre-emptive priority and Round - Robin (TQ =2ms)
scheduling algorithms.

NOTE: Data like time quantum (TQ), arrival time, burst time, priority and number of
process may vary. All or few scheduling algorithms may be asked according to marks.
Process Synchronization
11 Define Race Condition With an example discuss how Race Condition can be avoided?
OR
What is race condition? Discuss Race Condition with an example.
12 Describe critical section problem. List out the three requirements to be met by a solution to
the critical section problem.
13 Discuss Peterson’s solution for critical section problem.
14 Define the hardware instructions TestAndSet () and Swap (). Discuss solution for critical
section problem using these instructions.
15 What are semaphores? Illustrate the semaphore implementation with no busy waiting.
16 What are semaphores? Show its usage & implementation in detail.
 Department of Computer Science and Engineering
Global Campus ,Jakkasandra Post, Kanakapura Taluk, Ramanagara District, Pin Code: 562 112

17 What are monitors? Illustrate solution to the Dining Philosopher’s problem using monitors.
18 Discuss solution to the bounded buffer problem using semaphores.
19 Describe readers-writers problem and illustrate solution for it.
20 Describe how synchronization is provided in Solaris and windows operating system.

Q. No Questions
Module 3: Deadlocks
1 What are the necessary conditions for deadlock to occur?
OR
What is deadlock? Discuss the characteristics of deadlock.
2 What is the use of resource allocation graph? Give a resource allocation graph which has cycle, but
no deadlock.
3 Discuss the different methods for handling deadlocks.
4 Describe the methods for deadlock prevention.
5 Discuss deadlock avoidance using Banker’s Algorithm. Also discuss data structures for
implementing this algorithm.
6 What is wait - for graph? Explain how it is useful for detection of deadlock
7 Explain different methods to recover from deadlock?
8 Explain the Deadlock detection algorithms for both single and multiple instances of resources.
9 Give the Safety algorithm and resource request algorithm for Deadlock avoidance and explain it.
10 Draw a resource allocation graph for the following situation and check if the system is in a deadlock
state and explain.
Process P1 is holding/using resource R2 and waiting for resource R1.
P2 is using R1 and waiting for R3, R4 and R5.
P3 is using R4 and waiting for R5
P4 is using R5 and waiting for R2
P5 is using R3
11 Consider the following snap shot of a system
Allocation Request
Process
A B C A B C
P0 010 000
P1 200 202
P2 303 000
P3 211 100
P4 002 002
Total resources (A, B, C) = (7, 2, 6)
 Department of Computer Science and Engineering
Global Campus ,Jakkasandra Post, Kanakapura Taluk, Ramanagara District, Pin Code: 562 112

Answer the following questions using deadlock detection algorithm

i) Is the system in a safe state?
ii) If P2 requests for additional resource of C, can the request be granted immediately?
12 Consider the following snap shot of a system.
Allocation MAX
Process
A B C D A B C D
P0 0 0 1 2 0 0 1 2
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Available (A, B, C, D) = (1, 5, 2, 0)
Answer the following questions using Banker’s algorithm
i) What is the content of the NEED matrix?
ii) Is the system in a safe state?
iii) If P1 requests for (0, 4, 2, 0) can the request be granted immediately?
MEMORY MANAGEMENT
13 Explain hardware for relocation and protection in memory management with a neat diagram.
14 Consider the following segment table:
Segment Base Limit
0 330 124
1 876 211
2 111 99
3 498 302
What are the physical addresses for the following logical addresses?
a)0, 99 b)2,78 c)1, 265 d)3, 222 e)0,111
15 Explain the contiguous memory allocation. What are the advantages and disadvantages of
contiguous memory allocation?
16 Let the user process size by 1MB and the data transfer rate from memory to disk be 5MB per
second. Determine the time required for the program data transfer to disk from memory. If the
average latency is 8msec, determine the total swapping time.
17 What is fragmentation? What are the different types of Fragmentation? Explain how compaction
helps in overcoming Fragmentation.
Or
Explain with neat diagram internal and external fragmentation.
18 Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, 600 KB (in order), how would each
of the first fit, best fit and worst fit algorithms place processes of 212 KB, 417KB, 112KB and
426KB (in order). Which algorithm makes the most efficient use of memory?
 Department of Computer Science and Engineering
Global Campus ,Jakkasandra Post, Kanakapura Taluk, Ramanagara District, Pin Code: 562 112

19 What do you mean by address binding? List out the steps by which binding of instructions and data
to memory can be done.
20 Differentiate between logical address and physical address. Consider a logical address space of 8
pages of 1024 words each mapped onto a physical memory 32 frame. How many bits are there in
logical and physical address?
21 With a neat diagram, explain how TLB improves the performance of paging system.
22 With a neat diagram explain inverted page tables, hierarchical Page Tables and hashed page tables.
23 Consider a paging system with page table stored in memory with 80% hit ratio, 50 nanoseconds to
search the associative registers and 750 nanoseconds to access memory. Find the effective memory
access time.
24 With a neat diagram explain paging with hardware.
25 Explain segmented memory management with a neat diagram. List out advantages and
disadvantages of segmentation.
OR
Explain segmented memory management with a neat diagram.
26 Differentiate between paging and segmentation.
Or
List out advantages and disadvantages of paging and segmentation
27 Write a short notes on
i) Shared pages
ii) Dynamic loading
iii) Dynamic linking
iv) Multiprogramming with fixed partition
MODULE 4: VIRTUAL MEMORY
1 With a neat diagram discuss the steps involved in handling the page fault.
2 Consider the following page reference stream
0,1,2,3,0,1,2,3, 0,1,2,3,4,5,6,7 How many page faults would occur for FIFO, LRU and Optimal
page replacement algorithms, assuming 3 frames?
3 What is demand paging? Given page fault service time 8msec, memory access time 100
nanoseconds page fault rate 0.0002, calculate effective access time.
4 Consider the following page reference stream : 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 Calculate the number
of page faults when number of frames is equal to 3 and 4 Using FIFO algorithm. Do you notice
Belady's anomaly?
5 What is the need for page replacement? Explain with an example.
6 Discuss second chance page replacement algorithm.
7 Compare local versus Global allocation policies in page design.
8 What is thrashing? Discuss how working set model can be used to solve the same.
9 Define:
i. Thrashing
 Department of Computer Science and Engineering
Global Campus ,Jakkasandra Post, Kanakapura Taluk, Ramanagara District, Pin Code: 562 112

ii. Belady's anomaly

iii. Effective access time in demand paging.
iv. Copy-on-write
10 Consider a system with 1KB frame size and 64 free frames. If there are 2 processes P1 and P2 of
sizes 10KB and 127KB, how many frames would be allocated to each process using equal allocation
and proportional allocation algorithms?
11 What is virtual memory? List out its advantages.
FILE SYSTEM INTERFACE
12 What is file? Discuss the different access methods for files.
13 Differentiate between Tree structured and Acyclic –graph directory structures with their advantages
and disadvantages.
14 Differentiate between single level directory structure and two level directory structures with their
advantages and disadvantages. .
15 What are the different file types? Give their functions with an example for each.
16 What are the operations that can be performed on a directory? Explain.
17 Describe types of access and access control mechanisms in protection.
18 Explain the following:
i) File types
ii) File operations
iii) File attributes
19 Describe general graph directory structure with an example.
20 What do you mean by a free space list? With suitable examples, discuss different methods of
implementation of a free space list.
21 List and explain the contents of file control block.
22 Discuss the directory implementation using
i)Linear list and ii ) Hash table
OR
Explain the two methods used for implementing a directory.
23 Discuss Virtual File systems with neat diagram.
24 What are the major methods used for allocating a disk space? Explain each, with suitable examples.
25 Describe types of access and access control mechanisms in protection and consistency semantics.
26 With a neat diagram discuss the function of each layer in layered file system.