OS _II

Here’s a clear and structured answer to your list of

questions, grouped by sections. Duplicate questions have
been omitted.
a) Write features of mobile operating system:

Touchscreen interface
Power management and battery optimization
App management via app stores
Real-time notifications and background processing
Wireless connectivity (Wi-Fi, Bluetooth, GPS)
Security features like app sandboxing and permissions
Lightweight and efficient design for limited hardware
b) List the different types of Distributed Systems:

Client-Server Systems
Peer-to-Peer (P2P) Systems
Clustered Systems
Grid Computing Systems
Cloud Computing Systems
c) Explain any two Disk performance parameters:

1. Seek Time: Time taken by the disk arm to move to the

track where the data is stored.
2. Rotational Latency: Time waiting for the disk to rotate
to the correct sector under the read-write head.
d) Explain Resource Allocation Graph (RAG):
A RAG is a directed graph used to represent the state of
resource allocation in a system.

Processes are represented by circles.

Resources are represented by rectangles.
Request edge (P → R): A process is requesting a
resource.
Assignment edge (R → P): A resource is allocated to a
process.
If there's a cycle in RAG and each resource has only one
instance, a deadlock may exist.
e) What do you mean by Absolute path and Relative path?

Absolute Path: Complete path from the root directory

to the file or folder.
E.g., /home/user/docs/file.txt
Relative Path: Path relative to the current working
directory.
E.g., ../docs/file.txt
b) Write short note on Disk Management:

Disk management is the process of managing disk drives

and partitions in an OS. It includes:

Partition creation and deletion

Formatting file systems
Mounting/unmounting drives
Managing free space and bad sectors
Disk scheduling for I/O efficiency
c) Explain Design Goals of Distributed Systems:
 Transparency: Hides complexity from users (e.g.,
location, access, failure).
Scalability: Able to handle growing workload smoothly.
Fault Tolerance: Operate correctly even in the presence
of faults.
Resource Sharing: Share hardware/software resources
across the system.
Openness: Based on standard protocols and interfaces.
Security: Ensures data protection and access control.
a) Explain the necessary conditions for a Deadlock to occur:

1. Mutual Exclusion: At least one resource must be held

exclusively.
2. Hold and Wait: A process is holding one resource and
waiting for another.
3. No Preemption: Resources cannot be forcibly taken
from a process.
4. Circular Wait: A closed chain of processes exists where
each process waits for a resource held by the next.
b) Explain Linked Allocation of file in detail:

In linked allocation, each file is a linked list of disk blocks.

Each block contains data and a pointer to the next

block.
Only the starting block address is stored in the
directory.
Advantage: No external fragmentation.
Disadvantage: Slower access for random reads due to
pointer traversal.
c) Explain iPhone Architecture in detail:

iPhone (iOS) architecture is layered:

1. Cocoa Touch Layer: UI components, multitouch

support, accelerometer.
2. Media Layer: Graphics, video, audio APIs.
3. Core Services Layer: Core Foundation, location
services, iCloud, SQLite.
4. Core OS Layer: Kernel, file system, networking, security,
drivers.
a) What is C-Scan and C-Look? Compare them:

C-SCAN (Circular SCAN): Disk arm moves in one

direction and services requests; when end is reached,
returns to start without servicing.
C-LOOK: Similar, but only goes as far as the last request
in that direction before reversing.

Comparison:

Feature C-SCAN C-LOOK

Travel Range Full end-to-end Limited to last

of disk request

Efficiency Less efficient More efficient

b) What is mobile operating system? What are its responsibilities?

A mobile OS is software that runs on smartphones, tablets,

and other portable devices.
Responsibilities:

Managing device hardware and sensors

Handling user input (touch, gestures)
Power management
Running and managing apps
Providing secure environment
c) Explain deadlock prevention strategies:

Deadlock can be prevented by ensuring at least one of the

necessary conditions doesn't hold:

Eliminate Mutual Exclusion: Not always possible.

Eliminate Hold and Wait: Require a process to request
all resources at once.
Eliminate No Preemption: Allow preemption of
resources.
Eliminate Circular Wait: Impose ordering on resource
requests.
d) Explain different methods for handling free-space list in file system:

1. Bit Vector: Each block represented by a bit (0 = free, 1 =

used).
2. Linked List: Free blocks linked together.
3. Grouping: Store addresses of free blocks in blocks
themselves.
4. Counting: Store the start and count of contiguous free
blocks.
e) Explain cloud computing:
Cloud computing delivers computing services like storage,
servers, databases, networking, and software over the
internet.
Types: Public cloud, private cloud, hybrid cloud
Benefits: Scalability, flexibility, cost-efficiency, remote
accessibility.
a) Compare Desktop OS and Mobile OS:

Feature Desktop OS Mobile OS

User Interface Keyboard, mouse Touch-based

Power Usage Not optimized Highly power-

for battery efficient

Performance High- Optimized for

performance light tasks
tasks

Hardware Versatile Limited hardware

Support hardware (e.g. sensors)

App Installation From multiple Via app stores

sources

a) Define P2P architecture of distributed OS:

P2P (Peer-to-Peer) architecture is a decentralized model

where each node (peer) can act as both client and server.

No central coordinator
Resources and tasks shared equally
 Example: File sharing, blockchain
c) What is directory? What are its types? Explain two of them:

A directory is a structure used to organize and manage

files.

Types:

1. Single-Level Directory: All files in the same directory.

Easy but not scalable.
2. Two-Level Directory: Each user has their own directory.
Better organization.
3. Tree-Structured Directory: Hierarchical structure (like
folders in Windows).
4. Acyclic Graph Directory: Allows shared subdirectories
or files.
5. General Graph Directory: Supports full sharing and
links.

Explained:

Two-Level: Each user has a unique directory, avoids

name conflicts.
Tree-Structured: Supports file grouping, like
/home/user/docs.

Here’s a clear and structured answer to your list of

questions, grouped by sections. Duplicate questions have
been omitted.
a) Write features of mobile operating system:

Touchscreen interface
Power management and battery optimization
 App management via app stores
Real-time notifications and background processing
Wireless connectivity (Wi-Fi, Bluetooth, GPS)
Security features like app sandboxing and permissions
Lightweight and efficient design for limited hardware
b) List the different types of Distributed Systems:

Client-Server Systems
Peer-to-Peer (P2P) Systems
Clustered Systems
Grid Computing Systems
Cloud Computing Systems
c) Explain any two Disk performance parameters:

1. Seek Time: Time taken by the disk arm to move to the

track where the data is stored.
2. Rotational Latency: Time waiting for the disk to rotate
to the correct sector under the read-write head.
d) Explain Resource Allocation Graph (RAG):

A RAG is a directed graph used to represent the state of

resource allocation in a system.

Processes are represented by circles.

Resources are represented by rectangles.
Request edge (P → R): A process is requesting a
resource.
Assignment edge (R → P): A resource is allocated to a
process.
If there's a cycle in RAG and each resource has only one
instance, a deadlock may exist.
e) What do you mean by Absolute path and Relative path?

Absolute Path: Complete path from the root directory

to the file or folder.
E.g., /home/user/docs/file.txt
Relative Path: Path relative to the current working
directory.
E.g., ../docs/file.txt
b) Write short note on Disk Management:

Disk management is the process of managing disk drives

and partitions in an OS. It includes:

Partition creation and deletion

Formatting file systems
Mounting/unmounting drives
Managing free space and bad sectors
Disk scheduling for I/O efficiency
c) Explain Design Goals of Distributed Systems:

Transparency: Hides complexity from users (e.g.,

location, access, failure).
Scalability: Able to handle growing workload smoothly.
Fault Tolerance: Operate correctly even in the presence
of faults.
Resource Sharing: Share hardware/software resources
across the system.
Openness: Based on standard protocols and interfaces.
Security: Ensures data protection and access control.
a) Explain the necessary conditions for a Deadlock to occur:
1. Mutual Exclusion: At least one resource must be held
exclusively.
2. Hold and Wait: A process is holding one resource and
waiting for another.
3. No Preemption: Resources cannot be forcibly taken
from a process.
4. Circular Wait: A closed chain of processes exists where
each process waits for a resource held by the next.
b) Explain Linked Allocation of file in detail:

In linked allocation, each file is a linked list of disk blocks.

Each block contains data and a pointer to the next

block.
Only the starting block address is stored in the
directory.
Advantage: No external fragmentation.
Disadvantage: Slower access for random reads due to
pointer traversal.
c) Explain iPhone Architecture in detail:

iPhone (iOS) architecture is layered:

1. Cocoa Touch Layer: UI components, multitouch

support, accelerometer.
2. Media Layer: Graphics, video, audio APIs.
3. Core Services Layer: Core Foundation, location
services, iCloud, SQLite.
4. Core OS Layer: Kernel, file system, networking, security,
drivers.
a) What is C-Scan and C-Look? Compare them:
 C-SCAN (Circular SCAN): Disk arm moves in one
direction and services requests; when end is reached,
returns to start without servicing.
C-LOOK: Similar, but only goes as far as the last request
in that direction before reversing.

Comparison:

Feature C-SCAN C-LOOK

Travel Range Full end-to-end Limited to last

of disk request

Efficiency Less efficient More efficient

b) What is mobile operating system? What are its responsibilities?

A mobile OS is software that runs on smartphones, tablets,

and other portable devices.
Responsibilities:

Managing device hardware and sensors

Handling user input (touch, gestures)
Power management
Running and managing apps
Providing secure environment
c) Explain deadlock prevention strategies:

Deadlock can be prevented by ensuring at least one of the

necessary conditions doesn't hold:
 Eliminate Mutual Exclusion: Not always possible.
Eliminate Hold and Wait: Require a process to request
all resources at once.
Eliminate No Preemption: Allow preemption of
resources.
Eliminate Circular Wait: Impose ordering on resource
requests.
d) Explain different methods for handling free-space list in file system:

1. Bit Vector: Each block represented by a bit (0 = free, 1 =

used).
2. Linked List: Free blocks linked together.
3. Grouping: Store addresses of free blocks in blocks
themselves.
4. Counting: Store the start and count of contiguous free
blocks.
e) Explain cloud computing:

Cloud computing delivers computing services like storage,

servers, databases, networking, and software over the
internet.
Types: Public cloud, private cloud, hybrid cloud
Benefits: Scalability, flexibility, cost-efficiency, remote
accessibility.
a) Compare Desktop OS and Mobile OS:
 Feature Desktop OS Mobile OS

User Interface Keyboard, mouse Touch-based

Power Usage Not optimized Highly power-

for battery efficient

Performance High- Optimized for

performance light tasks
tasks

Hardware Versatile Limited hardware

Support hardware (e.g. sensors)

App Installation From multiple Via app stores

sources

a) Define P2P architecture of distributed OS:

P2P (Peer-to-Peer) architecture is a decentralized model

where each node (peer) can act as both client and server.

No central coordinator
Resources and tasks shared equally
Example: File sharing, blockchain
c) What is directory? What are its types? Explain two of them:

A directory is a structure used to organize and manage

files.

Types:
1. Single-Level Directory: All files in the same directory.
Easy but not scalable.
2. Two-Level Directory: Each user has their own directory.
Better organization.
3. Tree-Structured Directory: Hierarchical structure (like
folders in Windows).
4. Acyclic Graph Directory: Allows shared subdirectories
or files.
5. General Graph Directory: Supports full sharing and
links.

Explained:

Two-Level: Each user has a unique directory, avoids

name conflicts.
Tree-Structured: Supports file grouping, like
/home/user/docs.

Here's a structured and detailed response to all the

questions you listed, grouped by category for easier study.
I'll include the theory explanations, comparisons,
definitions, and disk scheduling examples with total head
movement calculations.
✅ Operating Systems Theory and Concepts
a) Define Cluster Computing. State the Advantages & Disadvantages of Cluster
OS.

Cluster computing is a system in which multiple

computers work together as a single system to improve
performance, availability, and fault tolerance.
Advantages:

High availability and fault tolerance

Improved performance and scalability
Cost-effective using commodity hardware

Disadvantages:

Complex configuration and management

Requires high-speed interconnects
Software compatibility issues
b) Differentiate Mobile OS and Desktop OS

Feature Mobile OS Desktop OS

User Interface Touchscreen Keyboard and

mouse

Power Highly optimized Not a primary

Management concern

Connectivity GPS, Wi-Fi, LTE, LAN, Wi-Fi

Sensors

App Distribution App Store Download from

websites, etc.

c) Explain Disk Formatting in Disk Management

Disk formatting prepares a storage device for data storage

by:
 Creating a file system (e.g., FAT32, NTFS)
Erasing old data
Marking bad sectors
Creating sectors and tracks
Installing boot sector (if required)
e) What is Distributed Operating System? Purpose of Distributed OS

A Distributed Operating System manages a group of

independent computers and makes them appear as a
single system.

Purposes:

Resource sharing
Transparency (location, access, failure)
Scalability
Reliability
Communication and load balancing
List Advantages and Disadvantages of Windows Mobile OS

Advantages:

Seamless integration with Microsoft apps

Good security
Simple UI

Disadvantages:

Limited apps compared to Android/iOS

No longer actively supported by Microsoft
✅ Architectures & Scheduling Algorithms
Architectural Styles in Distributed Systems (any one explained):
1. Client-Server
2. Peer-to-Peer (P2P)
3. Three-tier Architecture
4. N-tier Architecture

Client-Server:
Clients request services and servers provide them.
Centralized control, easier management.
Compare: SCAN vs LOOK Disk Scheduling

Feature SCAN LOOK

Movement Goes till end Goes till last

request

Efficiency Less efficient More efficient

Total Movement Higher Lower

Direction Change At disk end At last request

Seek Time & Rotational Latency

Seek Time: Time taken to move the disk arm to the

required track.
Rotational Latency: Time taken for the disk to rotate
and bring the required sector under the read-write
head.
Features of Mobile Operating System

Touch interface
 App store integration
Power management
Sensors (GPS, accelerometer)
Lightweight and efficient
Android vs iOS Comparison (4 Points)

Feature Android iOS

Source Code Open-source Closed-source

App Store Google Play Apple App Store

Store

UI Customizable Uniform and

smooth

Devices Multiple Only Apple

manufacturers devices

Deadlock Prevention Strategies (Any Two):

1. Avoid Hold and Wait – Request all resources at once.

2. Circular Wait Prevention – Impose a linear order for
resource requests.
Sequential vs Direct Access Methods

Sequential Access: Data is read in order (e.g., tape).

Direct Access: Data accessed at random (e.g., hard
disks).
File Operations (Any Four):
1. Create
2. Read
3. Write
4. Delete
Centralized Organization System Architecture:

All control lies in a central server; clients request services.

Simple but can lead to bottlenecks.
Resource Allocation Graph Example

Circle = Process, Square = Resource.

If a cycle exists and only one instance of each resource
exists, deadlock may occur.
Android OS Architecture

1. Linux Kernel
2. Hardware Abstraction Layer
3. Android Runtime (ART)
4. Application Framework
5. Applications
Access Methods of File System

Sequential
Direct (Random)
Indexed
Directory Structures (Tree-Structured Explained)

Tree structure has a root directory with subdirectories and

files. Easy hierarchy and file grouping.
Client-Server System and Its Advantages
Client-Server: Server provides services, clients consume
them.
Advantages:

Centralized control
Easy maintenance
Secure
Distributed System - Advantages & Disadvantages

Advantages:

Scalability
Reliability
Resource sharing

Disadvantages:

Complexity
Network dependency
Security issues

✅ Computing Models
Cluster vs Grid vs Cloud Computing
 Feature Cluster Grid Cloud

Tight Yes No No
Coupling

Ownership Single org Multiple Service

Providers

Access Internal Shared Internet-

based

Cost Moderate Low Pay-as-you-

go

Sensor Network:

A sensor network is a group of sensors deployed to collect

environmental or physical data (e.g., temperature, sound).
Used in healthcare, environment, military.
Kernel Architecture of Mobile OS:

Usually based on Monolithic or Microkernel:

Linux-based (Android)
Includes drivers, power management, memory
management
Facilitates fast and secure operations for mobile devices
ARM Architecture:

A family of RISC-based microprocessors optimized for low

power, high performance—used in mobile devices.
Native Code:
Compiled directly for the device's hardware (e.g., .exe for
Windows, .apk for Android). Runs faster than interpreted
code.
✅ Disk Scheduling Problems
Q: Request Queue: 23, 89, 132, 42, 187 — Head at 120

i) SSTF (Shortest Seek Time First):

Order: 132 → 89 → 42 → 23 → 187

Movements:
132-120 = 12
132-89 = 43
89-42 = 47
42-23 = 19
23-187 = 164
Total = 285 tracks
ii) SCAN (Head moves towards 0 then reverses)

Assuming head goes down first:

120 → 89 → 42 → 23 → 0 → 132 → 187
Movements:
120-89 = 31
89-42 = 47
42-23 = 19
23-0 = 23
132-0 = 132
187-132 = 55
Total = 307 tracks
iii) C-LOOK:
Sorted Queue: 23, 42, 89, 132, 187
Move from 120 to 132 → 187, then jump to 23 → 42 → 89
Movements:
132-120 = 12
187-132 = 55
187-23 (jump) = 164
42-23 = 19
89-42 = 47
Total = 297 tracks
Another Q: Request Queue = 30, 140, 20, 170, 60, 190 — Head at 120

i) FCFS

120 → 30 → 140 → 20 → 170 → 60 → 190

Movements:
120-30 = 90
30-140 = 110
140-20 = 120
20-170 = 150
170-60 = 110
60-190 = 130
Total = 710 tracks
ii) SSTF

From 120, closest is 140 → 170 → 190 → 60 → 30 → 20

120-140 = 20
140-170 = 30
170-190 = 20
190-60 = 130
60-30 = 30
30-20 = 10
Total = 240 tracks