Scribd
Upload
430 views3 pages

MCS-203 Important Repeated Questions

The document outlines key topics and frequently asked questions related to Operating Systems, specifically for the MCS-203 course. It covers essential concepts such as deadlock, semaphores, CPU scheduling, virtual memory, page replacement algorithms, disk scheduling, operating system architectures, file management, distributed systems, and mobile OS design issues. Each topic includes definitions, explanations, and problem-solving techniques, with references to their appearances in exams from 2021 to 2024.

Uploaded by

Muskan Rastogi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
430 views3 pages

MCS-203 Important Repeated Questions

The document outlines key topics and frequently asked questions related to Operating Systems, specifically for the MCS-203 course. It covers essential concepts such as deadlock, semaphores, CPU scheduling, virtual memory, page replacement algorithms, disk scheduling, operating system architectures, file management, distributed systems, and mobile OS design issues. Each topic includes definitions, explanations, and problem-solving techniques, with references to their appearances in exams from 2021 to 2024.

Uploaded by

Muskan Rastogi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Most Important & Repeated Questions - MCS-203 (Operating

Systems)

1. Deadlock
- Define Deadlock.
- Explain necessary and sufficient conditions for deadlock to occur.
- How can deadlock be prevented or avoided?
- Explain Banker's Algorithm.
- (Appeared: June 2022, Dec 2022, June 2023, June 2024, 2021)

2. Semaphores & Synchronization Problems


- What is a Semaphore? Explain wait() and signal() operations.
- Solve using Semaphores:
- - Producer-Consumer Problem
- - Reader-Writer Problem
- - Sleeping Barber Problem
- Bakery's Algorithm
- (Appeared: 2021, June 2022, June 2023, Dec 2023, June 2024)

3. CPU Scheduling (with Gantt Charts)


- Compare: FCFS, SJF, Round Robin (Quantum = 2)
- Calculate: Turnaround Time, Waiting Time, Throughput & Processor Utilization
- (Appeared: Dec 2022, Dec 2023, June 2022, June 2023)

4. Virtual Memory
- Define Virtual Memory.
- Explain its principles of operation.
- Explain address mapping, protection, and sharing.
- Define and explain Demand Paging.
- (Appeared: All papers - 2021 to 2024)

5. Page Replacement Algorithms


- Solve for page faults using:
- - LRU
- - FIFO/FCFS
- - Optimal Replacement
- (Appeared: Dec 2021, Dec 2022, Dec 2023)

6. Disk Scheduling Algorithms


- Explain and solve with Head Movement:
- - FCFS
- - SSTF
- - SCAN
- - C-SCAN
- (Appeared: 2021, 2022, 2023)

7. Operating System Architectures


- LINUX Architecture (with Kernel components)
- Windows 10 Memory Management
- Android Architecture
- iOS Architecture and iCloud container
- (Appeared: Every year for each OS)

8. File Management & Security


- File systems in Windows, Linux, iOS, Android
- File permissions, encryption, remote access in Linux
- (Appeared: 2021, 2022, 2023, 2024)

9. Distributed Systems
- Design Issues in distributed systems
- Client/Server, RPC, Distributed Shared Memory
- Lamport's Logical Clock
- Mutual Exclusion (Ricart & Agrawala, etc.)
- (Appeared: 2021-2024)
10. Mobile OS and Design Issues
- Features and evolution of iOS
- Design issues in Mobile Operating Systems
- Memory management in Android
- (Appeared: June 2024, Dec 2023, Dec 2022)

You might also like