Scribd
Upload
3 views3 pages

Operating System Qb1.Final

The document is a question bank for an Operating Systems course, divided into two parts: Part A consists of 28 short-answer questions covering fundamental concepts like process control, memory management, and scheduling algorithms, while Part B includes 14 detailed questions requiring explanations and examples related to OS evolution, system calls, process states, and specific algorithms like the Banker's Algorithm. It also includes practical problems involving Gantt charts and calculations for various scheduling algorithms. The document serves as a comprehensive guide for students to prepare for examinations in operating systems.

Uploaded by

Anitha E
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
3 views3 pages

Operating System Qb1.Final

The document is a question bank for an Operating Systems course, divided into two parts: Part A consists of 28 short-answer questions covering fundamental concepts like process control, memory management, and scheduling algorithms, while Part B includes 14 detailed questions requiring explanations and examples related to OS evolution, system calls, process states, and specific algorithms like the Banker's Algorithm. It also includes practical problems involving Gantt charts and calculations for various scheduling algorithms. The document serves as a comprehensive guide for students to prepare for examinations in operating systems.

Uploaded by

Anitha E
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

AL3452-OPERATING SYSTEMS

Question Bank
PART-A

1. List any two objectives of the operating system.


2. Name the System Call used to create Processes on the Unix System.
3. Define Process Control Block.
4. State any two differentiate between User thread and Kernel thread.
5. What is Demand Paging?
6. Define Thrashing.
7. State Rotational Latency.
8. List and define the various file access methods
9. Define Para Virtualization.
10. What is the significance of Virtual machines
11. What are the three objectives of an OS Design
12. What is a memory stall?
13. What are the Objectives of a scheduling algorithm?
14. Define deadlock and list its conditions.
15. Define logical addresses and Physical Addresses.
16. What are the various page replacement algorithms used for page replacement.
17. What is a file, and list some file attributes and operations?
18. What is the need for disk scheduling?
19. Define Virtualization and list its types.
20. What is Android, and why is it used?
PART B
1. Explain the evolution of operating systems in detail.
2. . What is system call ? Explain the types of system call.
3. .Discuss various services provided by the operating system
4. Discuss the structure of an operating system and its operation
5. Explain the User Operating System Interface

6.Consider the following set of processes with length of the CPU burst time given in
milliseconds
Process Burst Time Priority
P1 2 2
P2 1 1
P3 8 4
P4 4 2
P5 5 3
The processes are assumed to have arrived in the order P1,P2,P3,P4,P5 all at time 0
 Sketch the diagram of Gantt chart that illustrate the execution of these processes using
the following scheduling algorithms: SJF, non- preemptive Priority scheduling(a larger
priority implies a higher priority)
 Compute the turnaround time of each process for each of the scheduling algorithms.
 Compute the Waiting time of each process for each of the scheduling algorithms.
 Which of these algorithms results in the minimum average waiting time(over all
process).
7.What is deadlock? Explain necessary condition for deadlock
8. Define process and Explain process states in details with diagram
9.Consider the following process, with the CPU burst time given in milliseconds

Process Burst Time Priority


P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

Process have arrived in P1,P2,P3,P4, P5 order at time 0.


i)Draw four Gantt charts to show execution using FIFO, SJF,non-preemptive priority and Round
Robin(Quantum =1) scheduling.
ii) Also calculate waiting time and turnaround time for each scheduling algorithm.
10.Explain Banker’s Algorithm in details
11. Consider the following snapshot of a system. Using the banker’s algorithm
Process Allocation Request Available
R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
If a request from P1 arrives for (0,4,2,0), can the request be granted immediately?
12. Explain the Swapping with a neat diagram.
13.Explain the Paging with a neat diagram
14 Explain the segmentation with a neat diagram.
15. Explain the Address binding with a neat diagram
16.Consider the following page reference string.
1,2,3,2,5,6,3,4,6,3.7,3,1,5,3,6,3,4,2,4,3,4,5,5,1.
Indicate page fault and calculate total number of page faults and successful ration for FIFO,
Optimal and LRU algorithms. Assume there are four frames and initially all the frames are
empty
17.What is paging? Explain paging with TLB and hashed page table in them
18.Suppose that a disk drive has 5000 cylinders numbered 0 through 4999 . The drive is serving
a request at cylinder 143. The queue of pending requests , in FIFO order is
86,1470,913,1774,948,1509,1022,1750,130 Starting from the head position what is the total
distance(in cylinders) that the disk arm moves to satisfy all the pending requests for each of the
following disk- scheduling algorithm ? FCFS,SSTF,SCAN,LOOK,C-SCAN C-LOOK
19. Explain various file allocation method with suitable illustration. Also discuss in detail
various file organization methods
20.Explain disk Structure
21.Explain disk Scheduling and its Algorithms with an Example.
22.Explain the services provided by Kernel I/O subsystem.
23.Explain the feature of virtual machines and discuss the types of virtual machine in detail
24.Discuss in detail the system components of mobile OS. Also analyse the feature of iOs and Android
OS
25.Explain the Architecture of the iOS Operating System with a neat diagram
26.What is iOS operating System and give its Applications,merites and demerits?
27. Explain Android Architecture in detail with a neat diagram
28.Explain the Categories of Android Architecture with a neat diagram

You might also like