S.A.

ENGINEERING COLLEGE
(An Autonomous Institution, Affiliated to Anna University)
QUESTION BANK
ODD SEMESTER, 2024-2025
B.E. Computer Science and Engineering
(Common to B.Tech. IT)

SUBJECT CODE: CS1501A

SUBJECT TITLE: OPERATING SYSTEMS
COURSE CO-ORDINATOR: Mr. M BALASUBRAMANIAN
SEM/YEAR: V SEM/III YEAR

UNIT-I OPERATING SYSTEM OVERVIEW

Operating system overview-objectives and functions, Evolution of Operating System - Computer System
Organization-Virtualization-Operating System Structure and Operations- System Calls, OS Generations,
Process Concept, Threads- Overview, Multithreading Models, Threading issues

PART-A

COMPETENC
S.NO QUESTIONS CO BT
E

1. Define an operating system and list its functions. CO1 BTL-1 Remember

2. What is dual mode operation and what is the need of it? CO1 BTL-2 Understand

3. Distinguish between Multicore and Multiprocessor. CO1 BTL-2 Understand

4. Define a hypervisor and list its types. CO1 BTL-1 Remember

5. What is the purpose of system calls? CO1 BTL-1 Remember

List some system calls required to control the communication
6. CO1 BTL-2 Understand
system.
7. What is system boot in operating system? CO2 BTL-1 Remember
Write the difference between Batch systems and Time sharing
8. CO2 BTL-2 Understand
systems.
9. Does timesharing differ from multiprogramming? If so, How? CO2 BTL-2 Understand
10. What are the differences between user-level threads and
CO2 BTL-2 Understand
kernel-level threads?
 11. Define Para Virtualization CO2 BTL-1 Remember

PART-B

Explain different operating system structures with a neat

1. CO1 BTL-3 Apply
sketch.
Illustrate the key features and operations of Multiprocessor
2. CO1 BTL-3 Apply
Systems, Distributed Systems, and Time Sharing Systems.
Compare and contrast the historical progression of virtual
3. machines. Furthermore, analyze the methods and techniques CO1 BTL-4 Analyze
involved in integrating virtualization into operating systems.
Classify and illustrate the diverse categories of system calls
4. offered by a standard operating system, providing a specific CO1 BTL-3 Apply
example for each.
What is a process? Discuss about components of a process and
5. various states of a process with the help of a process state CO1 BTL-3 Apply
transition diagram.
Define the concept of a thread and elaborate on the distinctions
6. between user-level threads and kernel-level threads, providing CO1 BTL-3 Apply
comprehensive details.
Describe the dual-mode and multimode operations of operating
7. CO1 BTL-3 Apply
systems, providing a detailed examination of each mode.

UNIT-II PROCESS MANAGEMENT

Processes-Process Scheduling, Operations on Processes, Inter-process Communication; CPU Scheduling -

Scheduling criteria, CPU Scheduling Algorithms, Process Synchronization - Critical Section Problem, Mutex
Locks, Semaphores, Classic problems of synchronization, Critical regions, Monitors; Deadlock - Methods for
handling deadlocks, Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock.

PART-A

S.N COMPETE
QUESTIONS CO BT
O NCE
1. List out the data fields associated with Process Control Blocks. CO2 BTL-1 Remember
2. What is a semaphore? CO2 BTL-1 Remember
3. What is the difference between preemptive and non-preemptive CO2 BTL-2 Understand
scheduling?
4. What can the operating system do to recover from deadlock? CO2 BTL-2 Understand
 5. What are the four necessary conditions that are needed for a deadlock CO2 BTL-2 Understand
can occur?
6. What are the various scheduling criteria for CPU scheduling? CO2 BTL-1 Remember
7. Define Mutual Exclusion. CO2 BTL-1 Remember
8. What are Mutex locks? CO2 BTL-1 Remember
9. How will you calculate turn-around time? CO2 BTL-1 Understand
10 Name some classic problem of synchronization. CO2 BTL-1 Remember
.
PART-B
Discuss the concept of interacting processes and explore two distinct CO2 BTL-3 Apply
1. methodologies for implementing interaction between processes.

2. CO2 BTL-4 Analyze

Explain the following classical problems of synchronization with an

example code. CO2 BTL-3 Apply
3
(i) Readers-Writers Problem (7 Marks)
(ii) Dining-Philosophers Problem (6 Marks)
Define deadlock and explore strategies for deadlock recovery within
4 a system. Investigate the detailed methods employed for deadlock CO2 BTL-3 Apply
detection.
(i) What is meant by critical section problem? Propose a solution
5 based on bakery algorithm. (7) CO2 BTL-3 Apply
(ii) Describe the different ways of implementing semaphores. (6)
 The operating system contains 3 resources, the number of instances
of each resource type are 7, 7, 10. The current resource allocation
state is as shown below:

Allocation Maximum
R1 R2 R3 R1 R2 R3
6 P0 2 2 3 3 6 8 CO2 BTL-4 Analyze
P1 2 0 3 4 3 3
P2 1 2 4 3 4 4

(1) Is the system in a safe state?

(2) Can the request made by the process P1 (1, 1, 0) be granted.

UNIT 3 - MEMORY MANAGEMENT

Main Memory-Non Contiguous Memory Allocation - Contiguous Memory Allocation, Paging, Segmentation,
Examples; Virtual Memory- Demand Paging, Page Placement and Replacement policies - FIFO Page
Replacement, Optimal Page Replacement, LRU Page Replacement, Allocation, Thrashing

PART-A

S.N
QUESTIONS CO BT COMPETENCE
O
1. Mention any two differences between logical and physical BTL-2 Understand
CO3
addresses.
2. Differentiate internal fragmentation from external CO3 BTL-2 Understand
fragmentation.
3. What is the purpose of paging the page tables? CO3 BTL-1 Remember
4. How the problem of external fragmentation can be solved? CO3 BTL-2 Understand
5. What are the different methods of allocating frames to a CO3 BTL-1 Remember
process?
6. When does a page fault occur? Brief various page replacement CO3 BTL-2 Understand
algorithms.
7. Define demand paging in memory management. CO3 BTL-1 Remember
8. Compare and contrast paging and segmentation. CO3 BTL-2 Understand
8. What is thrashing? How to resolve this problem? CO3 BTL-2 Understand
9. Outline about TLB. CO3 BTL-1 Remember
10 What is pure demand paging? CO3 BTL-1 Remember
.
 PART-B
Consider the page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, CO3 BTL-4 Analyze
3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults would occur for
the following replacement algorithm, assuming one, two, three,
1. four page frames? Remember that all frames are initially empty,
so your first unique pages will all cost one fault each.
(i) FIFO (ii) LRU (iii) OPTIMAL
Discuss the following memory management techniques with CO3 BTL-3 Apply
diagrams.
2 (i) Partition Allocation Methods. (07)
(ii) Paging and Translation Look-aside Buffer. (06)

Examine segmentation thoroughly, focusing on the CO3 BTL-3 Apply

3
implementation aspects of segment tables in operating systems.
What is demand paging? Under what circumstances do page CO3 BTL-3 Apply
4 fault occur? Describe the actions taken by the operating system
when a page fault occurs.
Given memory partitions of 100K, 500K, 200K, 300K and CO3 BTL-4 Analyze
600K (in order). How would each of the First-fit, Best-fit and
5 Worst-fit algorithms place processes of 412K, 317K, 112K and
326K (in order)? Which algorithm makes the most efficient use
of memory?

UNIT IV – FILE SYSTEMS AND I/O SYSTEMS

Mass Storage system – Overview of Mass Storage Structure, Disk Structure, Disk Scheduling and
Management; swap space management; File concept, Access methods, Directory Structure, File Sharing
and Protection, File System Structure, Directory Implementation, Allocation Methods, Free-Space
Management, I/O Systems - I/O Hardware, Application I/O interface, Kernel I/O subsystem, Streams,
Performance.

PART-A

S.N COMPET
QUESTIONS CO BT
O ENCE
1. What is Directory? CO4 BTL-1 Remember
2. Identify the differences between UFD and MFD. CO4 BTL-2 Understand
3. Define C-SCAN scheduling. CO4 BTL-1 Remember
 4. What are the allocation methods of a disk space? CO4 BTL-1 Remember
5. What is the use of boot block? CO4 BTL-2 Understand
6. Define typical bad sector transaction. CO4 BTL-1 Remember
7. What are the operations performed in a Directory? CO4 BTL-1 Remember
8. What are the different methods for allocation in a File System? CO4 BTL-1 Remember
9. What are the most common schemes for defining the logical CO4 BTL-2 Understand
structure of a directory?
10 Define buffering. CO4 BTL-1 Remember
. 11 Define Free Space Management. CO4 BTL-1 Remember
.
PART-B

Analyze and compare different directory structures in detail. CO4 BTL-4 Analyze
1.
What are the different allocation methods in disk storage? CO4 BTL-3 Apply
2. Explain with a neat sketch.
Suppose that a disk drive has 5000 cylinders, numbered 0 CO4 BTL-4 Analyze
through 4999. The disk is serving a request at cylinder 143. The
queue of pending requests in, FIFO order is 86, 1470, 913, 1774,
948, 1509, 1022, 1750, 130.

3. (i) Starting from the head position what is the total distance (in
cylinders) that the disk arm moves to satisfy all the pending
requests for each of the following disk-scheduling algorithms?
FCFS, SSTF, SCAN, LOOK, C-SCAN, C-LOOK.
(ii) Explain the pros and cons of all disk scheduling algorithms.
Examine the Kernel I/O subsystem and elucidate the process of CO4 BTL-3 Apply
4. translating I/O operations into hardware-level actions.

Evaluate the methods employed by an operating system to CO4 BTL-3 Apply

5.
manage free space on storage devices.
 UNIT V

Linux System - Design Principles, Kernel Modules, Process Management, Scheduling, Memory
Management, Input-Output Management, File System, Inter-process Communication; Mobile OS - iOS
and Android - Architecture and SDK Framework, Media Layer, Services Layer, Core OS Layer, File
System.

PART-A

S.N COMPET
QUESTIONS CO BT
O ENCE
1. What are the features of Linux file system? CO5 BTL-1 Remember
2. What is the use of kernel modules in Linux? CO5 BTL-1 Remember
3. Define the components of LINUX system. CO5 BTL-1 Remember
4. List some of the Linux Network services. CO5 BTL-1 Remember
5. What is the responsibility of kernel in LINUX operating CO5 BTL-2 Understand
system?
6. What are the components of kernel module? CO5 BTL-1 Remember
7. Differentiate iOS from Android OS. CO5 BTL-2 Understand
8. CO5 BTL-1 Remember
Define LINUX Virtualization.
9. List the features of UIKit Framework. CO5 BTL-1 Remember
10 Define Core Video Framework. CO5 BTL-1 Remember
.
PART-B
Explain the design principles and components of Linux system CO5 BTL-3 Apply
1. in detail.
2. Examine the concepts of process and memory management CO5 BTL-3 Apply
within Linux.
Elaborate on the intricacies of the Linux file system. CO5 BTL-3 Apply
3
Examine the architecture and SDK Framework of the Android CO5 BTL-3 Apply
4 OS extensively.
Analyze the architecture of iOS, focusing on its media and CO5 BTL-4 Analyze
5 service layers.

COURSE COORDINATOR EVALUATOR HOD/CSE