Scribd
Upload
19 views

qUESTION bANK OS

This document outlines topics related to operating system concepts across 5 units. Unit 1 covers OS mechanisms, process models, and threading. Unit 2 discusses concurrency issues like mutual exclusion and semaphores. Unit 3 is about deadlocks including conditions, avoidance, and starvation. Unit 4 presents CPU scheduling algorithms and calculations. Unit 5 focuses on I/O systems including DMA, disks, files, and file systems.

Uploaded by

ashadesai592020
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

qUESTION bANK OS

This document outlines topics related to operating system concepts across 5 units. Unit 1 covers OS mechanisms, process models, and threading. Unit 2 discusses concurrency issues like mutual exclusion and semaphores. Unit 3 is about deadlocks including conditions, avoidance, and starvation. Unit 4 presents CPU scheduling algorithms and calculations. Unit 5 focuses on I/O systems including DMA, disks, files, and file systems.

Uploaded by

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

UNIT-1

1. Explain Operating System Mechanism.


2. Comparison between Traditional Unix Systems and modern Unix System.
3. Define single and multiprocessor systems. Write advantages of multiprocessor systems.
4. Explain Architecture of the Windows Operating System.
5. Describe five state process models.
6. Explain the Advantages and Disadvantages of the Five State Process Model.
7. Explain Process Control Modes of Execution.
8. What is mean by process in OS? Explain Two-State Process Model.
9. Describe Windows Thread Execution.
10. Explain User level and Kernel-Level Threads.
11. Explain the lifecycle of an activity in Android.
12. Explain the terms :-a)Multithreading b)Multicore.
UNIT-2
1. Explain Dekker’s algorithm.
2. Explain the principle’s of Concurrency.
3. Message Passing in OS?
4. explain Synchronization.
5. Describe the Producer/Consumer Problem.
6. Explain requirements for Mutual Exclusion.
7. Explain Reader And Writer Problems in OS.
8. Explain Semaphores in detail.

UNIT-3
1. Explain Principles of Deadlock.
2. Explain Preemptable and NonPreempatble Resources.
3. Explain the Conditions and Preventions for Deadlock.
4. Brief Explain Deadlock Avoidance.
5. Explain Unix Concurrency Mechanisms.
6. Explain Deadlock Starvation.
7. Explain Memory Management Requirements.
8. What is Memory Partitioning.Explain Fixed Partitioning With Advantages.
9. Explain paging in Brief.
10. Explain Segmentation in detail.
11. Explain Dynamic Partitioning With Advantages and Disadvantages.
12. Explain Linux Memory Management.

UNIT-4
1. Consider the following Set of Processes,With the arrival times and the CPU burst times
given in milliseconds.
Process ArrivalTime Burst Time
P1 0 15
P2 0 5
P3 0 13
Draw Gantt chart,calculate Turnaround Time,Waiting time,Average Turnaround Time and
Average Waiting Time for SJF.)
2. Consider the following Set of Processes,With the arrival times and the CPU burst times
given in milliseconds.
Process ArrivalTime Burst Time Priority
P1 0 15 3
P2 0 5 2
P3 0 13 1
Draw Gantt chart,calculate Turnaround Time,Waiting time,Average Turnaround Time and
Average Waiting Time for Priority Scheduling.)
3. Explain the types of Scheduler.
4. Briefly Explain FCFS Scheduling.
5. Briefly Explain Round Robin Scheduling.
6. Define the terms.
a) CPU Utilization
b) Throughput
c) Waiting time
d) Response Time
e) Turnaround Time
7. Explain Highest Response Ratio Next(HRRN)
8. Consider the following Set of Processes,With the arrival times and the CPU burst times
given in milliseconds.
Process ArrivalTime Burst Time Priority
P1 0 15 3
P2 0 5 2
P3 0 13 1
Draw Gantt chart,calculate Turnaround Time,Waiting time,Average Turnaround Time and
Average Waiting Time for Round Robin Scheduling.)(Time Quantum=4)
9. Explain Process Scheduling.
Unit 5
1. Explain Direct Memory Access in os.
2. Explain Single Buffer And Dubble buffer.
3. Explain The Following Term
A) Seek Time
B) Relational Latency
C) Transfer Time
D) Disc Access Time
E) Disc Response time
4. Explain Windows I/O.
5. What is File.Explain its Characteristics.
6. Explain the Indexed Sequential File and the Indexed File.
7. Explain types of Buffer Overflow Attacks With Example.
8. Describe key features of NTFS.

You might also like