Scribd
Upload
29 views

Important Questions 22516

Uploaded by

tanmaytati99
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
29 views

Important Questions 22516

Uploaded by

tanmaytati99
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/ 4

Important Questions for Subject Code 22516 (MSBTE)

1. Operating System Basics

- Define Real-Time Operating System (RTOS) and its applications.

- State the advantages of multiprocessor systems.

- Explain types of operating systems (e.g., multiprogramming, time-sharing).

- Differentiate between:

- Time-sharing and Real-Time systems.

- Preemptive and Non-preemptive scheduling.

- Paging and Segmentation.

2. Process Management

- Draw and explain the process state diagram.

- Describe:

- Interprocess communication models (shared memory, message passing).

- Schedulers (long-term, short-term, medium-term).

- Explain CPU scheduling algorithms:

- FCFS, SJF (preemptive and non-preemptive), Round Robin.

- Solve problems using Gantt charts to calculate average waiting time and turnaround time.

- Discuss Deadlock:

- Necessary conditions.

- Prevention methods (e.g., hold and wait).

- Differentiate between CPU-bound and I/O-bound programs.

3. Memory Management

- Define virtual memory and explain paging.


- Explain internal and external fragmentation.

- Discuss memory allocation strategies:

- First Fit, Best Fit, Worst Fit (with examples).

- Solve problems on:

- Page replacement algorithms (FIFO, LRU, Optimal).

- Free space management techniques (e.g., bitmaps, linked lists).

4. File Management

- Explain:

- File attributes.

- File operations (create, delete, open, close, etc.).

- File allocation methods (contiguous, linked, indexed).

- Draw and explain:

- Directory structures (single-level, two-level, tree-structured).

- Linked file allocation methods.

5. Commands and Tools

- Write Unix/Linux commands for tasks like:

- Creating directories and files.

- Displaying files and directories (ls).

- Managing processes (ps, kill, sleep).

- Clearing the screen.

- Discuss tools like:

- Task Scheduler, Security Policies, Performance Monitor.

- State responsibilities of:

- Memory management.

- File management.
6. Scheduling and Algorithms

- Describe the following with examples:

- Scheduling criteria (CPU utilization, throughput).

- Scheduling queues in process management.

- Solve scheduling problems using:

- FCFS.

- SJF.

- Round Robin (with time slice).

- Discuss multithreading models (one-to-one, many-to-one).

7. Deadlock and Security

- Define Deadlock and its necessary conditions.

- Explain Banker's Algorithm for deadlock avoidance.

- Describe free space management techniques.

8. Practical Problem Solving

- Solve examples on:

- Gantt charts for scheduling.

- Page faults using replacement algorithms.

- Directory structure-based queries.

Key Repeated Topics:

- Scheduling: FCFS, SJF, Round Robin.

- Memory Management: Paging, fragmentation.

- File Systems: Allocation methods, directory structures.

- Commands: Unix/Linux utilities.


- Diagrams: Process state, memory allocation.

You might also like