Block-1

Unit –1 Operating System: An Overview

(Basics of OS, Generations, Types of OS, Function of OS)
Write and explain briefly, all the essential functions of an
operating system.

Define a Semaphore. List and explain the two standard atomic

operations of it. Also write the solution to producer-consumer
problem using semaphores and explain

Consider the set of processes (P1, P2, P3, P4, P5) in the given
table :

For the following scheduling algorithms

(i) FCFS

(ii) Shortest Remaining Time Next

(iii) Round Robin (quantum = 2)

find average turnaround time, average waiting time, processor

utilization and throughput of each scheduling.
Consider the set of processes (P1, P2, P3, P4, P5) in the given

table:

(i) FCFS

(ii) Shortest Remaining Time Next

(iii) Round Robin (quantum = 2)

find average turnaround time, average waiting time, processor

utilization and throughput of each scheduling.

What are the essential conditions for a deadlock to occur?

Explain with an example. Also write and discuss Banker's
deadlock avoidance algori

Write short notes on the following: Generation of Operating

Systems

Define a Process. Explain process states and the difference

between process and thread.

State Reader's/Writer's problem. Write and explain its

semaphore-based solution.

Write short notes on the following: (a) Generation of Operating

Systems

Draw the Gantt chart for the Round Robin scheduling policy and
calculate the turnaround time, average waiting time, throughput
and processor utilization for the following set of process
Unit –2 Processes
(Process, system call, Process Scheduling, scheduling algo,
performance evaluation of algo)

Types of Schedulers (Short-term, Longterm and Medium term)

Discuss briefly the following Scheduling algorithms: (I) FCFS

List the contents of a Process Control Block (PCB). Explain the

significance of each of its components.

Explain Lamport’s Bakery algorithm for ordering of events in a

distributed environment with an example.

Write short notes on any four of the following : Process States

Define Context Switch. Explain the step-by-step process for

process switching between two processes.

Define Real Time Operating System (RTOS). Give any two

example applications suitable for RTOS. Compare and contrast
RTOS and time-sharing system

Explain Ricart's and Agarwala's mutual exclusion algorithm for

distributed system

Explain page reference string. Consider the page reference string

: 1, 2, 3, 3, 3, 4, 2, 2, 1, 5, 6, 2, 1 How many page faults would
occur for the following algorithm, assuming 2 frames ?

Define Context Switch. Explain the step-by-step process for

process switching between two processes.

Unit –3 Interposes Communication and Synchronization

(SYNCHRONIZATION, semaphore, locks, Interposes Synchronization and
Communication, Classical Problems in Concurrent Programming )

Write and explain Bakery’s algorithm that handles critical section

problem for ‘n’ processes

Write short notes on the following : Locks (synchronization

mechanism)

Discuss the common failures in distributed systems.

List the contents of Process Control Block (PCB). Also explain the
steps involved in "Context switch" between two processes with
an ill

What is a Critical Section? Monitor solution to Dining Philosophers

Problem.

Explain Lamport’s Bakery algorithm for ordering of events in a

distributed environment with an example.

Mutual Exclusion in Distributed Systems

What is a Semaphore? Give solution to the Sleeping Barber

Problem using Semaphore.

Write short notes on the following: Locks (synchronization

mechanism)

Unit –4 Deadlocks
(DEADLOCKS, Characterization of a Deadlock, Deadlock Prevention )
Characterize a deadlock in a system. Using a resource allocation
graph, illustrate a deadlock.

Characterization of Deadlock

Discuss the characterization of a Deadlock.

List and explain any two disk scheduling algorithms with the help
of diagram

With the help of a diagram, explain the fundamental architecture

of LINUX operating system.
 Define a Deadlock. Explain the necessary and sufficient
conditions for a deadlock occurrence. Also explain how it can be
prevented.

Write and explain “Banker’s algorithm” for Deadlock Avoidance

proposed by Dijkstra

What is the purpose of kernel layer in Windows 2000 0/S

structure ? Briefly des

Discuss the characterization of a Deadlock

Block-2
Unit 1 - Memory Management
(Overlays and Swapping, Contiguous Allocation Methods, Paging,
Segmentation)

Demand Paging

For the reference string as shown below: 0, 1, 3, 4, 6, 4, 3, 9, 6, 4

and with 3 memory frames, calculate the number of page faults
using OPT and FCFS page replacement algorithms.

Explain Take-Grant model for security in an operating system.

Give an example to illustrate the model

What is Segmentation scheme in memory management with the

help of a diagram, explain the principles of operation, address
translation and sharing in segmentation scheme.

Discuss briefly the following Scheduling algorithms: Round Robin

Define Segmentation Scheme. With the help of a diagram,

explain the principles of its operation.

Concept of Thrashing and how to prevent it.

Overlays and Swapping

UNIT 2 Virtual Memory

(Virtual Memory, Page Replacement Policies, Thrashing, Demand
Segmentation, Combined Systems)

Define segmentation. Explain with the help of a diagram, the

address mapping scheme used in segmentation

Write short notes on any four of the following: Demand Paging

and Demand Segmentation

Write short notes on the following : Demand Paging in UNIX

Page replacement algorithms – LRU and FIFO with reference

string and frame size.

List and explain any two disk scheduling algorithms with the help
of diagrams.

Discuss the design goals and design issues in a distributed

system.

Explain Virtual Memory and its principle of operation, elaborating

the virtual to physical address mapping.

Define Thrashing and explain the reason of its occurrence, with

the help of an example. Describe briefly the techniques of
prevention of thrashing

Write short notes on the following: Demand Paging in UNIX

UNIT 3 I/O and File Management (I/O Buffering, Disk

Scheduling, RAID, Disk Cache, File Management, File system)

Using SSTF and C-SCAN disk scheduling algorithms, calculate the

total head [ 2] MCS-203 movement for the following block
sequence: 10 61, 141, 40, 160, 15, 63, 60, 125 Note: Initially the
head is at cylinder numbered 0.

Write and explain briefly, all the essential functions of an

operating system.

Define RAID technology. How is this implemented?

Write short notes on any four of the following : Redundant Array

of Inexpensive Disks (RAID)

Define RAID technology. How is this implemented ?

 Define a Distributed System. List its key features, advantages
and disadvantages.

List and explain the design goals of Distributed Systems.

linked and Indexed Allocation

SCAN and C-SCAN disk scheduling algorithms

Explain SCAN and FCFS scheduling algorithm with suitable head-

movement diagrams for the given example : Starting cylinder is
100 in the direction of increasing cylinder number. Cylinder
request : 150, 160, 194, 94, 56, 54, 38, 37, 18

UNIT 4 Security and Protection (Security Policies and

Mechanisms, Authentication, Security Models, Protection in Computer
Systems

Access Matrix and Mandatory Access Control Models

Explain Take-Grant model for security in an operating system.
Give an example to illustrate the model

Block-3
UNIT-1 Multiprocessor Systems
(Multiprocessor Interconnections, Types of Multiprocessor Operating
Systems, Multiprocessor Synchronization, Multiprocessor Operating
System - Functions and Requirements)

Multiprocessor Operating System

Fault Tolerance in Distributed Systems

UNIT-2 Distributed Operating Systems

(History of Distributed Computing, Distributed Systems, Design Goals
of Distributed Systems, Distributed System Structure, Remote
Procedure Calls, Other Middleware Technologies)

List and explain the various design issues involved in Distributed

systems
 Write and explain the Lamport’s Scheme of Ordering of Events in
Distributed Systems

Write short notes on any four of the following : Role Based

Access Control

Explain the cross-bar and hypercube interconnection networks

with diagrams. Give its relative merits and demerits

List and explain the design goals of Distributed Systems.

Define a Distributed System. List its key features, advantages

and disadvantages.

UNIT-3 Mobile Operating Systems

(Mobile Operating System, Evolution of Mobile, Need for the Mobile OS,
Characteristics of Smartphone OS, Design Issues in Mobile OS, Popular
Mobile OS)

Describe multiprocessor OS functions and requirements. With

respect to synchronization in multiprocessors, explain test-and-
set, compare-and-swapes and fetch-and-add techniques.

Design issues in Mobile OS

What is a Remote Procedure Call (RPC) ? How is it implemented?

Discuss briefly.

Explain Ricart's and Agarwala's mutual exclusion algorithm for

distributed syst

Block-4
UNIT-1 Case Study WIN 10
(Features of Windows, Evolution of Windows, Windows 10 Editions,
Windows OS Components, process management, memory
managements, File System Management)

Describe the NTFS file system management in WINDOWS 2000

 With reference to memory management in Windows-10
operating system, explain the following: (i) Virtual Memory
Organization (ii) Demand Paging

File system management in Windows 10

Describe briefly Virtual Memory Organization and Demand

Paging in WINDOWS-10.

What is the purpose of kernel layer in Windows 2000 0/S

structure? Briefly describe

Write short notes on the following : NTFS of Windows 2000

Discuss Interprocess Communication in Windows 2000 operating

system.

Discuss Interposes Communication in Windows 2000 operating

system.

Write short notes on the following: NTFS of Windows 2000

UNIT-2 Case Study Linux

(Linux OS, evolution of OS, Linux kernel, fundamental architecture of
Linux, process and memory management, windows vs Linux)

Security features in LINUX

With the help of a diagram, explain LINUX architecture with a

special focus on ‘Kernel’ and its components.

Explain the following commands/utilities of UNIX : 10

(I) Pipes and Filters (ii) Redirecting Input and Output

Describe the process management in LINUX which includes

process priorities, process hierarchy, process states and threads
management.

Explain the following commands/utilities of UNIX:

(i) Pipes and Filters (ii) Redirecting Input and Output

Discuss the working of Remote Procedure Call (RPC) with the

help of a flow

(activity) diagram.
UNIT-3 Case Study Android
(Salient Features of Android, Evolution of Android, Layered Architecture
of Android OS, Processes and Threads Management in Android,
Memory Management in Android, File Management in Android, Security
Features in Android)

Discus s the file management and security features in

Android operating system.

Elucidate the general design issues for a mobile operating

system in detail.

Libraries and Application Framework Layers of Android

Architecture

Memory management in Android

UNIT-4 Case IOS

(Features of iOS, Evolution of iOS, Architecture of iOS, iOS Kernel
Architecture Processes and Threads Management, Memory
Management, File System in iOS, iOS Directories, iCloud Container,
Identification of File Type, Security of File System)

With the help of a block diagram, explain the iOS-layered

architecture with a focus on essential functions of all the layers.

iOS directories and iCloud container of iOS

Explain the file management system in iOS and briefly mention

the security aspects of file system.

With the help of a simple block diagram, explain the XNU kernel
architecture which was initially used for Mac OS.