SREE SAKTHI ENGINEERING COLLEGE
(AUTONOMOUS)
Course Code & Name: AL3452 - OPERATING SYSTEMS
Exam: B.E./B.Tech Degree Examinations - May/June 2025
PART A — (10×2=20 Marks)
Answer All Questions
1. Role of system programs in an OS: System programs provide an environment for
program development and execution. They act as a bridge between the user and the
hardware.
2. Four objectives of an OS:
o Efficient resource utilization
o Convenience for users
o Ability to evolve
o Support for concurrent execution
3. Critical section role in synchronization: It ensures that only one process accesses
shared data at a time, preventing data inconsistency.
4. Two multithread models:
o Many-to-One
o One-to-One Used to efficiently handle multiple threads by mapping them to
kernel or user threads.
5. Concept of Swapping: Moving processes between main memory and disk to improve
memory utilization.
6. Paging vs Segmentation:
o Paging divides memory into fixed-size pages.
o Segmentation divides memory into variable-size segments.
7. Access methods in file systems:
o Sequential
o Direct
o Indexed Affect the efficiency of file retrieval.
8. Role of Kernel I/O subsystem: Manages I/O operations including scheduling,
buffering, caching, and spooling.
9. System vs Process Virtual Machines:
o System VM provides a complete platform.
o Process VM supports a single process.
10. Role of virtualization: Enhances system flexibility, isolation, and resource
management.
PART B — (5×16=80 Marks)
Answer All Questions
11 a. OS Structures and Performance: Operating System structure defines how the
components of an OS are organized and how they interact. Types include:
• Monolithic Structure: All OS services run in kernel mode. E.g., UNIX.
• Layered Structure: OS divided into layers; each layer only interacts with the layer
below. E.g., THE OS.
• Microkernel Structure: Minimal kernel with services like device drivers in user
space. Enhances modularity. E.g., QNX.
• Modular Structure: Combines advantages of layered and monolithic.
Diagram: OS Structure Overview
Performance is impacted by context switching, communication overhead, modularity, and
size of kernel.
OR
11 b i. Services of OS:
• Program execution: Load and run programs, manage process execution.
• I/O operations: Interfaces to perform input/output with devices.
• File system manipulation: Creating, reading, writing, and deleting files.
• Communication: Between processes (message passing or shared memory).
• Error detection: OS monitors and responds to errors in hardware and software.
11 b ii. Concept of System Calls: System calls are the interface between user programs and
OS. Types include:
• Process Control: fork(), exec(), exit()
• File Management: open(), read(), write(), close()
• Device Management: ioctl(), read(), write()
Diagram: System Call Mechanism
12 a i. Inter-process Communication (IPC): IPC allows processes to communicate and
synchronize.
• Shared Memory: Common memory space.
• Message Passing: Messages exchanged via kernel.
Diagram: IPC via Shared Memory and Message Passing
12 a ii. Deadlock Handling Techniques:
• Deadlock Prevention: Eliminate one of Coffman’s conditions (e.g., hold and wait).
• Deadlock Avoidance: Use Banker’s algorithm to check safe state.
• Deadlock Detection and Recovery: Detect cycles in Resource Allocation Graph
(RAG), recover by preemption or rollback.
OR
12 b. FCFS and SJF Scheduling:
Process Arrival Time Burst Time
P1 0 ms 8 ms
P2 1 ms 4 ms
P3 2 ms 9 ms
P4 3 ms 5 ms
FCFS: Gantt Chart: P1 → P2 → P3 → P4
SJF: Gantt Chart: P2 → P4 → P1 → P3
Calculate: Completion Time, Turnaround Time (CT - AT), Waiting Time (TAT - BT)
13 a. Paging Concept: Logical memory is divided into pages, physical memory into frames.
Page table maps pages to frames.
Diagram: Paging Structure
Steps:
1. Divide logical address into page number and offset.
2. Use page number to index into page table.
3. Add offset to frame address.
OR
13 b i. Page Fault Steps:
1. Generate page fault trap.
2. OS checks validity and allocates frame.
3. Load page from disk.
4. Update page table and restart process.
13 b ii. LRU Page Replacement: Reference String: 7, 0, 1, 2, 0, 3... Compute faults for each
frame size (3, 4, 5).
14 a. Disk Scheduling Algorithms:
• FCFS: Services in the order of arrival.
• SSTF: Shortest seek time first.
• SCAN: Moves head towards one end then reverses.
Diagram: Disk Head Movement Comparison
Calculate seek sequence, total head movement.
OR
14 b. Directory Structures:
• Single-Level: All files in same directory.
• Two-Level: Separate user directories.
• Tree-Structured: Hierarchical.
Diagram: Tree Structure
15 a. Virtual Machine Architecture:
• Host OS, Virtual Machine Monitor (VMM), and Guest OS.
Diagram: VMM-based VM Architecture
Benefits: Isolation, testing, multiple OS on same hardware.
OR
15 b i. Android OS Architecture:
• Linux Kernel: Core functionalities.
• Libraries: C/C++ libraries for native services.
• Android Runtime: ART/Dalvik.
• Application Framework: APIs.
• Applications: Java/Kotlin apps.
Diagram: Android Architecture Stack
15 b ii. iOS vs Android App Development:
Feature iOS Android
Language Swift/Objective-C Java/Kotlin
IDE Xcode Android Studio
Store App Store (strict) Google Play (flexible)
UI Guidelines Human Interface Guidelines Material Design
Conclusion: iOS offers better security and optimization, Android provides flexibility and
wider device support.
Staff Incharge Dean/CSE
