5.

Mobile Operating System

2M.
1.Define Mobile os.
-> 1.A Mobile OS is software that controls mobile devices like smartphones and tablets.
2.It manages hardware, runs apps, and provides a user interface.

Examples: Android, iOS.

2. What is Kernel in ARM Architecture?

->1.Kernel is the core part of the Mobile OS that directly communicates with hardware.
2.In ARM-based systems, it handles memory, processes, and power.
3.Acts as a bridge between hardware and software.

3. What is Kernel?
1. Kernel is the heart of the Operating System.
2. It connects hardware and software.
3. It manages memory, processes, and devices.
4. Without kernel, your OS can’t work.
5. It runs in the background, always active.
🔸 Types of Kernels:
1. Monolithic Kernel.
2. Microkernel
3. Hybrid Kernel

4Marks.
1.Explain Feature of Mobile os.
->🔹 1. App Support
 You can install different apps on the phone.
  Apps help in gaming, social media, banking, etc.

🔹 2. Internet Access
 You can use Wi-Fi or mobile data.
 You can browse websites and watch videos.

🔹 3. Camera Use
 You can take photos and record videos.
 Both front and back cameras are supported.

🔹 4. Multitasking
 You can use two or more apps at the same time.
 Example: Listening to music while chatting.

🔹 5. Bluetooth & Sharing

 You can share files with other devices.
 You can connect wireless headphones or speakers.

2.List Feature of iOS mobile in os.

->1.Simple and Clean Interface
 Easy to use and looks nice.
2 Fast Performance
 Works smoothly and quickly.
3. App Store
 Safe and trusted apps are available.
4 Strong Security
 Protects your data from viruses and hackers.
5. Regular Updates
 Gets latest features and bug fixes often.’

3.Advantages and disadvantages of windows mobile os.

->✅ Advantages of Windows Mobile OS:
1. Simple Interface
o Easy to use and clean look.
2. Microsoft Office Support
o Works well with Word, Excel, PowerPoint.
3. Good Security
o Keeps your data safe.
4. Fast Performance
o Runs smoothly on supported devices.
❌ Disadvantages of Windows Mobile OS:
1. Fewer Apps
o App Store has very limited apps.
2. No Updates Now
o Microsoft stopped support and updates.
3. Low Developer Support
 o Most app makers focus on Android & iOS.

4.Differentiate mobile os and Dekstop os.

->
Point Mobile OS Desktop OS
1. Used In Smartphones, tablets Laptops, desktops
2. Touch Fully touch-based Mostly keyboard and mouse
Support
3. Apps Uses mobile apps Uses software programs
4. Battery Works on battery Mostly works on electricity
5. Calls & Can make calls and send Cannot make calls or send SMS
SMS SMS directly
6. Size Smaller and lighter Bigger and more powerful
7. Less powerful than More powerful and faster
Performance desktop OS
8. Examples Android, iOS Windows, macOS, Linux

4.Give a Comparitive study of any four points of android mobile operating

system and aple i05 mobile operating system(2M).
Point Android OS Apple iOS
1. Company Made by Google Made by Apple
2. Devices Used in many brands (Samsung, Only used in iPhones
Vivo, etc.)
3. More freedom to change look Less customization
Customization and settings allowed
4. App Store Google Play Store Apple App Store
4.Explain Constrainets and requirements of mobile os(3M)
📌 Constraints (Limitations) of Mobile OS:
1. Less Power
o Not as powerful as desktop OS.
2. Battery Dependent
o Works only till battery lasts.
3. Limited Storage
o Less space for apps and files.
✅ Requirements of Mobile OS:
1. Touch Screen Support
o Must work with fingers or gestures.
2. App Management
o Should support app install, update, and delete.
3. Battery Management
o Should save battery and work longer.

5.Write a short note on kernel Architecture in os.

-Kernel is the core part of the operating system.
- It connects hardware and software.
- Manages CPU, memory, devices, and processes.
-Helps apps talk to hardware safely.
Types of Kernel Architecture:
 Monolithic Kernel
 Microkernel
 Hybrid Kernel

4.Distributed Operating System.

2M.
1.Define Distributed system.(What is?)(1M/2M)
1. A distributed system is a group of computers.
2. These computers work together like one single system.
3. They are connected through a network (like the internet).
4. Each computer can do its own job, but they also share work.
5. Users feel like they are using just one system.

2. What is size scalability?(1M)

->1. Size scalability means the system can grow in size.
2. You can add more computers or devices without problems.
3. The system still works well even after growing.
4. It helps the system handle more users or more work.

3.What is access transparency?

->1. Access transparency means users can access data or resources without knowing where
they are stored.
2. It hides how data is accessed, whether it's local or on a remote computer.
3. The system looks same to the user even if things are in different places.

4. Write any two design goals of distributed system(1M)

->1.Resource Sharing
2.Distribution Transperency.
3.Openess.
4.Scalability.

5.What is cluster computer?(1M)

->- A cluster computer is a group of computers connected together to work like one
powerful system

6. What is grid computing?

-> Grid computing is using many computers in different locations to work together and
solve one big task.

7.Define peer-to-peer architecture.

-> -Peer-to-Peer architecture is a network where each computer (peer) can act as both a
client and a server.
-They share resources directly with each other without a central server.

8. What is native level programming?

-> 1. It is fast and efficient.
2. Usually done in C or C++ languages.
3. Works only on specific platforms (like Windows, Android, etc.).

4Marks:
1.List down the architectural styles in distributed operating system & explain any one in
detail.
-> 1. Layered Architecture:-

-In this style, the system is divided into layers, where each layer performs a specific task and
communicates only with the layer above or below it.
- Makes system easy to manage and test.
- Each layer has a specific role .
-(e.g., hardware, OS, application)

2. Object-Based Architecture:-
- In this style, the system is designed using objects. Each object has data and functions and
interacts with other objects using messages.
- Follows Object-Oriented Programming (OOP)
-Objects are independent and reusable
-Good for building modular and scalable systems

3.Resource-Based Architecture:-
- In this architecture, the system is built around resources like files, printers, memory, CPU,
etc.
-Each resource is managed and shared across the distributed system.
2. Write a short note on centralized organization of system architecture.
->-All tasks and decisions are handled by a central computer (server).
-Other devices (clients) just request and wait for a response.
- The system is easy to manage and maintain.
-All data and services are stored in one place.
-It is cheaper to build compared to complex distributed systems.
-If the central server fails, the whole system can stop working.
It consists following types of architecture:
 Client-server
 Application Layering

3.Explain benefits of distributed systems.

-> ✅ Benefits of Distributed Systems
1. Faster Performance:
 o Work is shared across many computers, so tasks are done faster.
2. Scalability:
o You can add more computers to handle more users or data.
3. Reliability:
o If one computer fails, others can keep working (no full system crash).
4. Resource Sharing:
o Computers can share files, printers, databases, etc.
5. Flexibility:
o Different parts of the system can use different hardware or software.

3.Explain design goals of distributed systems.

-> ✅ Design Goals of Distributed Systems
1. Transparency:
o The system should look like one single system, even though it has many
computers.
o Users should not know where the files or services are.
2. Scalability:
o The system should work smoothly even if it grows (more users or machines).
o It should not slow down.
3. Reliability:
o The system should keep working even if some parts fail.
o It should have backup and recovery.
4. Resource Sharing:
o All users should be able to access shared resources like files, printers, and
databases.
5. Concurrency:
o Multiple users or programs should be able to work at the same time without
problems.
4.Differentiate between cluster, grid & cloud computing.-

Point Cluster Computing Grid Computing Cloud Computing

Computers are in the Computers are in Computers can be

1. Location
same place different places anywhere

2. Tightly connected (like a Loosely connected (like a

Internet-based
Connection team) network)

3. Third-party providers (like

Same organization Different organizations
Ownership AWS)

For high-s For big tasks across

4. Use For on-demand services
peed tasks locations

High (needs hardware Medium (uses existing

5. Setup Cost Low (pay as you use)
setup) systems)

Data centers, scientific Weather forecasting, Google Drive, Amazon

6. Examples
labs research Web Services

5.What is Cloud Computing?

-> Cloud computing means using computer services over the internet instead of your own
computer.
- can store files, run apps, or use services online.
- can access it anytime, from anywhere.
 3.Disk Sheduling
2Marks
1.Define Seek Time
-> It is the time your computer takes to find the location of data on the disk.
- Seek Time is the time taken by the hard disk’s read/write head to move to the track where
the required data is stored.

2. rotational latency.
-> Rotational Latency is the time it takes for the disk to spin and bring the correct data
under the read/write head.

3.Compare SCAN and LOOK disk scheduling algorithms.

->

🔹 Point 🚄 SCAN Algorithm 👀 LOOK Algorithm

1. Head Goes to the end of disk, then Goes only till the last request, then
Movement reverses reverses

Moves in one direction till end, then Moves in one direction, then reverses
2. Direction
reverses fully where needed

May travel extra distance with no

3. Extra Travel Avoids unnecessary travel to disk end
pending requests

Slower, due to longer head

4. Speed Faster, because it stops earlier
movement

More efficient due to reduced

5. Efficiency Less efficient than LOOK
movement

Like elevator going to top floor even Like elevator stopping at highest
6. Example
if no one’s there requested floor only

7. Best Use Case Good for heavy loads Better for medium or light loads

4.Explain disk formatting in disk management.

->- Disk formatting is the process of preparing a storage device (like a hard disk, SSD, or pen
drive) so it can store data properly.
- Erases all data on the disk.
- Creates a file system (like FAT32, NTFS) so it knows how to store files.
-Makes the disk ready to use for saving and reading data.
- Types of Formatting:

Quick Format

Full Format

5.Write a short note on disk scheduling algorithms.

-> When many read/write requests come to the disk, the system needs to decide the order
in which to serve them.
This is called Disk Scheduling.
Disk Scheduling Algorithms help in:
 Reducing seek time
 Improving performance
 Managing requests efficiently
Types of disk scheduling –
*Refer Notebook.

**Examples** Refer Notebook

FCFS/SSTF (Calculate)

2.File System Management

2M.
1.List any two file attributes.
->1.Name 2.Size 3.Type 4.Identifiers 5.Location
2.Give any two disk allocation method
->1.linked allocation
2.Indexed allocation
3.Continuos allocation
3.Give four implementation of free space list.
->1.Bit vector 2.Linked List
3.Counting 4.Grouping
4.Types of file
->1.Source file 2.Text File 3.Binary File.

4M
1• Explain any four file operations.
->1.Close-
When a file is no longer being actively used it is closed by the process
2.Append:
New information can be added at the end of an existing file.
3. Creating file
 Used to make a new file.
 Example: Making a file called notes.txt.
4. Write
 Used to add or change data in a file.
 Example: Typing notes into a file.
5. Read
 Used to view or access the data inside a file.
 Example: Opening a file to see what's written.
2. Explain sequential and direct access methods.
-> 1. Sequential Access Method:
 Data is accessed in order, one by one.
 You start from the beginning and go through each item until you find what you need.
- Used in: Magnetic tapes
-Slower if data is at the end

2. Direct Access Method:

 You can jump directly to the data you want.
 No need to go through everything in order.
 Example: Like a CD – you can play any song directly.
Used in: Hard disks, SSDs
Faster access time
3. Indexed Access Method
 An index is created, like a table of contents.
 It stores addresses of blocks in the file.
 You first check index, then go to the correct block.
- Extra space needed for index

3.List different file allocation methods and explain any one.

-> Different File Allocation Methods:
1. Contiguous Allocation
2. Linked Allocation
3. Indexed Allocation
1.Contiguous Allocation
 In this method, all file data is stored together in one block of memory.
 Blocks are stored one after another (contiguously).
  Easy to access the data because it’s all in one place.
- Very fast access
- Simple to use
2. Linked Allocation:
 Each file is stored in blocks, and each block points to the next block.
 The blocks don’t have to be next to each other.
- No need for large free spaces
3. Indexed Allocation:
 A special index block stores addresses of all file blocks.
 You can directly go to any part of the file using the index.
- Fast direct access to any block.
-Each file has its own index block.
-It overcomes the problem of external fragmentation.

4.Write a note on tree structured directories

-> - In this method, files and folders are arranged like a tree.
- There is one main (root) directory, and inside it, there can be sub-directories, and inside
them more folders or files.
- It helps in organizing files properly.
Example:
Root
├── Folder1
│ ├── File1
│ └── File2
└── Folder2
└── File3
✅ Advantages:
1. Organized Structure – Easy to group related files.
2. Allows Subdirectories – Can create folders inside folders.
 3. Easy Access – Helps in finding files easily.

❌ Disadvantages:
1. Can become complex if too many levels.
2. Needs more memory to manage.

5.Discuss the various techniques of free space management in file system.

->1. Bit Map (or Bit Vector)
 Each block is represented by 1 bit:
o 1 = block is used
o 0 = block is free
 A bit array is used.
-Simple to understand
- Slow to find a free block in large disks
Example:
Blocks: 1 2 3 4 5 6
BitMap: 1 0 1 0 0 1 → Block 2, 4, 5 are free

2. Linked List (Free List)

 All free blocks are linked together.
 Each free block has a pointer to the next free block.
Example:
Free block 5 → 10 → 12 → NULL
- Easy to add/remove
-Need to traverse the list to find multiple blocks

3. Grouping
 Stores addresses of free blocks in groups.
 The first block contains addresses of a few free blocks and a pointer to another block
with more free addresses.
- Reduces overhead
- Bit complex than linked list
4. Counting
 Stores the starting block and the number of free blocks in a row (count).
Example:
Block 10, Count 4 → blocks 10, 11, 12, 13 are free
- Saves space and time
-Only works well when free blocks are in sequence.

1.Process DeadLocks
1. What is Request Edge?
->A request edge is a line (arrow) from a process to a resource in a resource allocation
graph.
It shows that the process is asking for or wants to use the resource.
Example:
If Process P1 wants Resource R1, we draw an arrow from P1 → R1.

*What is Deadlock?
->
2. What is Claim Edge?
->A claim edge is a line from a process to a resource that the process might need in the
future.
It shows a possible future request, not a current one.

3.What is Safe State?

-> Safe state means no danger of deadlock. The system can handle all current and future
requests safely.

4.What is Starvation?
-> Starvation means a process is ignored and never gets a chance to run, even though it’s
waiting.
***
1.What are the contents of the Need matrix?
->Need [i, j] = Max [i, j] – Allocation [i, j]
So, the content of Need Matrix is:

2. Explain methods to recover from deadlock.

-> 1. Kill Processes (Process Termination)
Stop one or more processes that are in deadlock.
  Easy, but the process may lose its work.

2. Take Resources Back (Resource Preemption)

Take resources from some processes and give them to others.
 Can help free up the system, but risky.

3. Go Back (Rollback)
Go back to a safe point (previous state) before deadlock happened.
 Try again in a different way.