DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

QUESTION BANK
YEAR/SEM : II / IV
NAME OF THE SUBJECT : AL3452– Operating Systems
NAME OF THE FACULTY : Mrs V. Kalaiselvi AP/AI&DS

UNIT I INTRODUCTION 7
Computer System - Elements and organization; Operating System Overview - Objectives and
Functions - Evolution of Operating System; Operating System Structures – Operating System
Services - User Operating System Interface - System Calls – System Programs - Design and
Implementation - Structuring methods.

PART A
1. Define Operating System?(K1)(CSE-May 2023)
2. What is meant by computer system?(K1)
3. What are the objectives of operating system?(K1)
4. “OS is a control program”, Justify the statement with an example scenario.(K5) (Nov2023)
5. Define system call. Give any two System Calls with their purpose.(K1)(CSE-Nov2023)
6. List the Services of OS.(K1) (CSE-May 2023)
7. What are the types of Booting? Define each.(K1)
8. List out the elements of computer systems.(K1)
9. Why API’s need to be used rather than system call? (K1)
10. What is an interrupt?(K1)
11. Distinguish between batch systems and time-sharing systems.(K4)
12. What is bootstrap program?(K1)
13. Illustrate the different interrupt clauses. (K3)
14. Illustrate the use of fork and exec system calls.(K3)
15. Define: Clustered systems.(K1)
16. List the various user and operating system interfaces.(K1)
17. What is the Kernel?(K1)
18. Define Cache memory?(K1)
19. What is meant by serial processing operating system? (K1)
20. What is Multiprocessor System? (K1)
21. What are the advantages of multiprocessors? (K1)
22. What is the use of Fork and Exec System Calls? (K1)
23. What are the six major categories of System Calls?
24. What are the Components of a Computer System? (K1)
25. How are ios and Android similar? How are they different? (K1)
26. Draw a neat diagram of storage-device hierarchy.(K5)
27. What are the two view points of operating system? Define each. (K1)
28. Distinguish between network operating systems and distributed operating systems. (K4)
29. Write about Real time operating system? (K3)
30. List out various operating system structuring methods? (K1)
31. What is meant by system programs? (K1)
32. Compare the Apple’s macos and ios operating systems.(K4)
33. Write about hybrid system structuring method in operating system?(K1)

PART B
 1. (i) List down the Objectives and Functions of Operating Systems. (K1)(CSE-Nov2023)
(ii)Detail the various types of user interfaces supported by Operating Systems. (K2)
2. (i) Explain various Structures of operating Systems. (K2)(CSE-Nov2023)
(ii)Explain the purpose and importance of System calls in detail with examples. (K2)
3. Explain different operating system structures with neat sketch. (K2)
4. Explain the various types of system calls with examples. (K2)
5. What is a system call? Elaborate on the types of System calls.(K1)(CSE-May2023)
6. Explain the Functions performed by an Operating System.(K2)(CSE May2023)
7. Explain in detail the Evolution of operating System.(K2)
8. Explain in detail about computer system elements and organization?(K2)
9. Write an Operating System Overview with a neat diagram?(K1)
10. List the various services provided by operating systems.(K1)
11. (i)Discuss the various types of user operating system interfaces.(K2)
(ii)List the various system programs in operating system.(K1)
12. Discuss about the evolution of operating Systems. Also explain Design and implementation 0f operating
systems.(K2)
13. With neat sketch, discuss about computer system overview.(K3)
14. Explain about Design and Implementation of operating System.(K2)
15. Explain in detail about various structuring methods of Operating system.(K2)

UNIT II PROCESS MANAGEMENT

Processes - Process Concept - Process Scheduling - Operations on Processes - Inter- process
Communication; CPU Scheduling - Scheduling criteria - Scheduling algorithms: Threads -
Multithread Models – Threading issues; Process Synchronization - The Critical-Section problem -
Synchronization hardware – Semaphores – Mutex - Classical problems of synchronization -
Monitors; Deadlock - Methods for handling deadlocks, Deadlock prevention, Deadlock avoidance,
Deadlock detection, Recovery from deadlock.
PART A
1. Define Process. (K1)
2. List the different states of a Process and Define Each. (K1)
3. Draw the Life cycle of a process. (K1) (Nov 2023)
4. Distinguish between CPU bounded, I/O bounded processes. (K4)
5. What is meant by PCB? (K1)
6. Define CPU Scheduling. (K1)
7. Define Context Switch. (K1)
8. List the models of Inter Process Communication also define each. (K1)
9. Differentiate Between Co-operating process and independent process? (K4)
10. Compare the Direct Communication by Indirect Communication in IPC? (K4)
11. What is meant by CPU Scheduler? (K1)
12. Differentiate between pre-emptive and Non-Preemptive Scheduling (K4)
13. List down the functions of Dispatcher in CPU Scheduling. (K1)
14. Define the term ‘Dispatch Latency”. (K1)
15. List and Define the CPU Scheduling Criteria. (K1)
16. List out the different CPU Scheduling Algorithms. (K1)
17. Define Thread. (K1)
18. Compare Process creation and Thread creation in terms of Economy. (K4) (Nov 2023)
19. List the main difference and similarities between threads and process. (K1)
20. Compare and contrast Single-threaded and multi-threaded process. (K4)
21. What are the benefits of multithreaded programming? (K1)
22. Distinguish between user-level threads and kernel-level threads? (K4)
23. List out the relationship established in Multithreading Models also Define each. (K1)
24. What the issues in designing the Multithreaded Programs? (K1)
25. What are the different ways in which a thread can be cancelled? (K1)
26. What is meant by Process Synchronization? (K1)
27. State the Critical Section Problem. (K1) (MAY 2023)
28. What are the requirements that a solution to the critical section problem must satisfy? (K1)
29. Define Mutual exclusion. (K1)
30. Name the hardware instructions and their definitions which can be used for implementing mutual
exclusion. (K1)
31. Define MUTEX LOCK. (K1)
32. What is a semaphore? (K1)
33. Compare Counting Semaphore with Binary Semaphore? (K4)
34. What is a Monitor? (K1)
35. What is meant by Race Condition? (K1)
36. Name some classic problem of synchronization? (K1)
35. Define Deadlock. (K1)
37. Name the Four Conditions for deadlock. (K1) (May 2023)
38.Compare livelock and deadlock. (K4)
39. What is meant by Indefinite Blocking or Starvation? (K1)
40. What are the conditions that must hold for Deadlock Prevention? (K1)
41. What are the algorithms available for Deadlock avoidance? (K1)
42. What is resource-allocation graph? (K1)
43. What is the meaning of the term busy waiting? (K1)
44. What are the methods for handling deadlocks? (K1)
45. Define ‘Safe State”? (K1)
PART-B
1) Explain process states and process control block in details? (K2)
2)i) With a neat sketch. explain the different states of a process? (K2) (May 2023)
ii)How Process Synchronization is achieved using a Semaphore? Give an example. (K2)
3) Explain in detail about Process Concept with neat diagram? (K2)
4) Explain the following i) Operations on Process ii) IPC (K2)
5)List and Explain the various CPU Scheduling Algorithms with Example? (K2)
6) Consider following processes with length of CPU burst time in milliseconds (K6)
Process Burst time
P1 5
P2 10
P3 2
P4 1
All process arrived in order p1, p2, p3, p4 all time zero
a) Draw Gantt charts illustrating execution of these processes for SJF and round robin(quantum=1)
b) Calculate waiting time for each process for each scheduling algorithm
c) Calculate average waiting time for each scheduling algorithm
7) Consider following processes with length of CPU burst time in millisecond (K6)
Process Brust time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
All processes arrived in order p1, p2, p3, p4, p5 all at time zero.
1) Draw Gant charts illustrating execution of these processes for SJF, non-pre-emptive priority
(smaller priority number implies a higher priority) & round robin(quantum=1)
2) Calculate turnaround time for each process for scheduling algorithm in part (1)
3) Calculate waiting time for each scheduling algorithm in part (1)
8) i) Explain the various scheduling criteria in evaluating scheduling algorithms. (K2)
(ii) Explain the FCFS, pre-emptive and non-pre-emptive versions of Shortest-Job First and Round Robin
(time slice = 2) scheduling algorithms with Gantt charts for the four processes given. Compare their average
turnaround and waiting time. (K2)
Process Arrival Time BurstTime
P1 0 8
P2 1 4
P3 2 9
P4 3 5
9) Consider the following set of processes, with the length of the CPU – burst time given in milliseconds
(K6)
 Process Burst Time Priority

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

The processes are arrived in the order P1, P2, P3, P4, P5, all at time 0.
a) Draw 4 Gantt charts illustrating the execution of these processes using FCFS, SJF, Priority and RR (Time
Slice = 1) scheduling
b) What is the turnaround time of each process for each of the scheduling?
c) Calculate the waiting time for each of the process.
10) The following processes are being scheduled using a preemptive, roundrobin scheduling algorithm. (K6)
Process Priority Burst Arrival
P1 40 20 0
P2 30 25 25
P3 30 25 30
P4 35 15 60
P5 5 10 100
P6 10 10 105
Each process is assigned a numerical priority, with a higher number indicating a higher relative
priority. In addition to the processes listed below,the system also has an idle task (which consumes no
CPU resources and is identified as Pidle). This task has priority 0 and is scheduled whenever the
system has no other available processes to run. The length of a time quantum is 10 units. If a process is
preempted by a higher-priority process, the preempted process is placed at the end of the queue.
a. Show the scheduling order of the processes using a Gantt chart.
b. What is the turnaround time for each process?
c. What is the waiting time for each process?
d. What is the CPU utilization rate?
11) Consider the following Five processes that arrive at time 0, with the length of the
CPU burst time given in milliseconds. (K6)
Processes CPU Brust time
P1 10
P2 29
P3 3
P4 7
P5 12
Consider the First Come First Serve (FCFS),non-preemptive Shortest Job First(SJF),Round Robin(RR)
(quantum=10 milliseconds) scheduling algorithms. Illustrate the Scheduling using Gantt chart. Which
algorithm will give the minimum average waiting time? (May 2023)
12) Consider following Set of processes, with length of CPU burst time given in milliseconds (Nov 2023)
(K6)
Process Burst time
P1 10
P2 1
P3 2
P4 5
i)Draw Gantt’s Chart illustrating the execution of these Processes using FCFS, SJF and Round Robin
(with quantum=1) scheduling techniques.
ii)Find the Turnaround time and Waiting time of each process using above technique.
13) Consider Three Processes, all arriving at time zero, with total execution time of 10,20 and 30 units
respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of time doing
computation, and the last 10% of time doing I/O again. The operating system uses a shortest remaining
compute time first scheduling algorithm and schedules a new process either when the running process gets
blocked on I/O or when the running process finishes its compute burst. Assume that all I/O operations can be
overlapped as much as possible. (K6)
i) Calculate average wating time and average turn around time.
ii) Draw Gantt Chart of CPU burst.
iii) Calculate CPU idle time. (Nov 2023)
14) i) Define thread and explain in detail about Multithread models. (K1) (K2)
ii) Discuss the threading issues which are considered with multithreaded programs. (K2)
15) State critical section problem? Discuss three solutions to solve the critical section problem. (K1) (K2)
16) List and Explain about Hardware support for Synchronization. (K2)
17) What is semaphore? Discuss product-consumer problem with semaphore. (K2)
18) Explain Peterson’s solution for achieving mutual exclusion. (K2)
20) Write short note on: a) Dining philosopher problem (K2)
b) MUTEX Locks c) Monitors
d) Peterson’s solution for achieving mutual exclusion
e) Semaphores f) Readers & writers’ problem.
21) How monitors help in process synchronization. (K2)
22) List and explain classical Problems of Synchronization in detail. (K2)
23) Explain in detail how semaphores and monitors are used to solve producer consumer problem. (K2)
24) Describe in detail about readers and writers problem and dining philosopher problem. (K2)
25) Write in detail about deadlock handling. (K2)
26) Write in detail about deadlock avoidance. (K2)
27) Write in detail about deadlock prevention. (K2)
28) Write in detail about deadlock recovery. (K2)
29) Write Banker’s algorithm for Deadlock Avoidance. Explain with an Example (May2023) (K2)
 30) Explain the RAG representation in deadlock detection. (K2)
31)Consider the following questions based on the banker’s algorithm: (K6)
Allocation Max Available
P0 A B C D ABCD ABCD
P1 0012 0012 1520
P2 1000 1750
P3 1354 2356
P4 0632 0652
P5 0014 0656
i) Define safety algorithm. ii) What is the content of the matrix Need?
ii) Is the system in a safe state? iv) If a request from process P! arrives for (0,4,2,0), can the request be
granted immediately?
32. Consider the following snapshot of a system: (10) (CO2) (K6)
P0 – P4 are 5 processes present and A, B, C, D are the resources. The maximum need of a Process
and the allocated resources details are given in the table.Answer the following based on banker’s algorithm.
(1) What is the content of NEED matrix?
(2) Is the system in a safe state?
(3) If a request from process P0 arrives for (0, 2, 0) can the request be granted immediately.

Allocation Max Available

A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

UNIT III MEMORY MANAGEMENT 10

Main Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the
Page Table - Segmentation, Segmentation with paging; Virtual Memory - Demand
Paging – Copy on Write - Page Replacement - Allocation of Frames –Thrashing.

PART A
1. Define Main memory? (K1)
2. What is address binding? (K1)
3. What is the main function of the memory-management unit? (K1)
4. Define logical address space and physical address space. (K1)
5. Define dynamic loading. (K1)
6. Define dynamic linking. (K1)
7. Define Contiguous Memory Allocation. (K1)
8. What do you mean by First Fit? (K1)
9. What do you mean by Best Fit? (K1)
10. What do you mean by Worst Fit? (K1)
11. Given memory partitions of 100KB,500Kb,200Kb,300KB and 600 KB (in order), How would
each of the first fit, best fit, worst fit algorithms place process of 212 KB,417 KB,112KB and
426KB (in order). (K6)
12. Difference between internal and external fragmentation. (K4)
13. what is meant by External Fragmentation? How can that be overcome? (K1)
14. Why are page sizes always powers of 2? (K2)
15. Name two differences between logical and physical addresses with an example.
16. Consider a logical address space of eight pages of 1024 words each, mapped onto a physical
memory of 32 frames. (K6)
a. How many bits are there in the logical address?
b. How many bits are there in the physical address?
17. Consider a logical address space of 2,048 pages with a 4-KB page size, mapped onto a
physical memory of 512 frames. (K6)
a. How many bits are required in the logical address?
b. How many bits are required in the physical address?
18. What is the use of Valid-Invalid Bits in Paging? (K1)
19. What is the basic method of Segmentation? (K1)
20. What you mean by compaction? In which situation is it applied. (K1)
21. What is the purpose of paging the page tables?
22. Define Pages and Frames. (K1)
23. Define TLB. (K1)
24. Define swapping. (K1)
25. What are overlays? Compare swapping and overlays. (K1)
26. Define effective access time. (K1)
27. List and define the common Techniques for Structuring the page table. (K1)
28. Compare and Contrast Paging and Segmentation. (K6)
29. What is virtual memory? Mention its advantages. (K1)
30. Define Demand paging and write advantages. (K1)
31. What is thrashing? (K1) (Nov-2023)
32. How do you limit the effects of thrashing? (K2)
33. What do mean by page fault? (K1)
34. Define Pre paging. (K1)
35. Write the difference between demands paging and pure demand paging? (K4)
36. Define Copy-on-write. (K1)
37. Define lazy swapper. (K1)
38. What is the basic approach of page replacement? (K1)
39. What is the various page replacement algorithms used for page replacement? (K1)
40. Differentiate between Global and Local page replacement algorithms. (K4)
41. What are the major problems to implement demand paging? (K1)
42. What is a reference string? (K1)
43. How do you limit the effects of thrashing? (K2)
44. Define demand paging in memory management. (K1)
45. What are the steps required to handle a page fault in demand paging. (K1)
46. How does the system detect thrashing? (K2)
47. Will optimal page replacement algorithm suffer from Belady’s anomaly? Justify your answer.
(K6)
 48. Write about swapping. Let us assume the user process is of size 1MB and the backing store is a
standard hard disk with a transfer rate of 5MBPS. Calculate the transfer rate. (K1)(K4)
49. Consider the following page-reference string: (K6)
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12. How many page faults and page fault ratio would occur for the
FIFO page replacement algorithm?
50. What is the counting-based page replacement algorithm? (K1)
51. Define: Belady’s anomaly? (K1)
52. What are the common strategies to select a free hole from a set of available holes?(K1)
53. What is meant by NUMA? (K1)
54. Distinguish between page and segment. (K4)
55. List the need of inverted page table. (K1)
56. What do you mean by pure demand paging? (K1)
57. What is the Working-set Model? (K1)
58. Assuming a 1-KB page size, what are the page numbers and offsets for the following address
references (provided as decimal numbers)?(K4)
a. 21205
b. 164250
c. 121357
d. 16479315
e. 27253187
59. Assuming a 1-KB page size, what are the page numbers and offsets for the following address
references (provided as decimal numbers): (K4)
a. 3085
b. 42095
c. 215201
d. 650000
e. 2000001
60. Brief on the causes of Thrashing. (K1)

PART B & PART C

1. Explain the concept of main memory with neat diagram? (K1)
2. Explain about Swapping with an example? (K1)
3. Explain about processes involved in contiguous memory allocation with a neat diagram. (K1)
4. What is Paging? Elaborate Paging with an example and neat diagram. (K2)
5. Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order),
how would the first-fit, best-fit, and worst-fit algorithms place processes of size 200 MB, 15 MB, 185
MB, 75 MB, 175 MB, and 80 MB (in order)? Indicate which — if any — requests cannot be satisfied.
Comment on how efficiently each of the algorithms manages memory. (K6)
6. Given memory partitions of 100KB, 500KB, 200KB, 300KB and 600KB (in order), how would each
of the first-fit, best-fit and worst-fit algorithms place processes of212KB, 417KB, 12KB and 426KB (in
order)? Which algorithm makes the most efficient use of memory? (K6)
7. Given memory partitions of 300KB, 600KB, 350KB, 200KB,750KB and 125KB (in order), how would
each of the first-fit, best-fit and worst-fit algorithms place processes of 115KB, 500KB, 358KB,200KB
and 375KB (in order)? Which algorithm makes the most efficient use of memory? (K6)
8. Explain any 2 techniques used for structuring the page table. (K1)
9. Explain in detail the segmentation scheme of memory management with neat sketch. Discuss how it is
different from paging scheme? (K1)
10. i)Explain optimal, LRU, LRU approximation page replacement for the reference string
70120304230321201701
ii)Explain inverted page table. (K2)
 iii)Explain Thrashing. (K2)
11. Illustrate how pages are loaded into memory using Demand Paging. (K2)
12. What is copy-on write feature and under what circumstances it is beneficial? What hardware support is
needed to implement this feature? (K1)
13. Explain the need and concept of paging technique in memory management. (K1)
14. Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement algorithms, assuming one,
two, three, four, five, six, and seven frames? Remember that all frames are initially empty, so your
first unique pages will cost one fault each. (K4)
• LRU replacement
• FIFO replacement
• Optimal replacement
15. Consider the following page reference string:
7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 , 1.
Assuming demand paging with three frames, how many page faults would occur for the following
replacement algorithms? (K4)
• LRU replacement
• FIFO replacement
• Optimal replacement
16. Apply the (1) FIFO, (2) LRU, and (3) optimal (OPT) replacement algorithms for the following
page-reference strings:
• 2, 6, 9, 2, 4, 2, 1, 7, 3, 0, 5, 2, 1, 2, 9, 5, 7, 3, 8, 5
• 0, 6, 3, 0, 2, 6, 3, 5, 2, 4, 1, 3, 0, 6, 1, 4, 2, 3, 5, 7
• 3, 1, 4, 2, 5, 4, 1, 3, 5, 2, 0, 1, 1, 0, 2, 3, 4, 5, 0, 1
• 4, 2, 1, 7, 9, 8, 3, 5, 2, 6, 8, 1, 0, 7, 2, 4, 1, 3, 5, 8
• 0, 1, 2, 3, 4, 4, 3, 2, 1, 0, 0, 1, 2, 3, 4, 4, 3, 2, 1, 0
Indicate the number of page faults for each algorithm assuming demand paging
with three frames. (K4)
17. Consider the following page reference string:
2,3,4,5,3,2,6,7,3,2,3,4,1,7,1,4,3,2,3,4,7
Assuming demand paging with three frames, how many page faults would occur for the following
replacement algorithms? (K4)
• LRU replacement
• FIFO replacement
• Optimal replacement
17. How many page faults occur for all page replacement algorithms for the following reference string
with four-page frames? (K4)
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.
18. Consider the following page reference string:1 2 3 4 1 3 0 1 2 4 1 and 3 page frames. Find the page
faults, hit ratio and miss ratio using FIFO, optimal page replacement and LRU schemes. (Nov-2023)
(K4)
19. Explain first-in,first-out page replacement algorithm and optimal page replacement algorithm with an
example and diagrams. (K2)

20. i)Consider the following segment table: (K4)

Segment 0 1 2 3 4
Base 219 2300 90 1327 1952
 Length 600 14 100 580 96
What are the Physical addresses for the following Logical addresses?
0,430 1,10 2,500 3,400 4,112
ii)Consider the following Segmentation table: (K4)
Segment Base Length
0 319 500
1 135 14
2 180 86
3 827 380
4 552 200
What are the Physical addresses for the following Logical addresses?
i. 0,241
ii. 1,18
iii. 2,71
iv. 3,210
v. 4,728
21. What is thrashing and explain the methods to avoid thrash.(K2)
22. Describe the hierarchical paging technique for structuring page tables.(K2)
23. What is the cause for thrashing? How does the system detect thrashing? Once it detects, what can the
system do to eliminate this problem?(K1)
24. Explain how paging supports virtual memory. With a neat diagram explain how logical address is
translated into physical address. (K2)
25. Explain any four page replacement algorithms in detail? Write short notes on LRU, FIFO and clock
replacement strategies? (K2)
26. Consider the following page reference string:
2, 1, 0, 3, 4, 0, 0, 0, 2, 4, 2, 1, 0, 3, 2.
How many page faults would occur if the working set policy were used with a window size of 4?
Show when each page fault would occur clearly. (K4)
27. Why are translation look-aside buffers important? Explain the details stored in a TLB table entry?
(K1) (K2)
28. Explain about Allocation of Frames in memory management? (K2)
29. Write short notes about virtual memory management and thrash ing.(K2)
27.Consider the following page reference string: 1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6.
How many page faults would occur for the LRU, FIFO, LFU and optimal page replacement algorithms,
assuming two and five frames? (K4)
30.Explain the concept of demand paging and the issue of demand paging? (K2)
31.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,1
Indicate page faults and calculate total number of page faults and successful ratio for FIFO, optimal
and LRU algorithms. Assume there are four frames and initially all the frames are empty. (K4)
32. Consider the following scenario. There are 4 segments in a program of sizes, A0=400B, A1=100B,
A2=21B and A3=365B. Assume that the main memory address ranges from 0 to 1999, among which the
following are the available free slots:50-350, 450-500,670-1060 and 1200-1850. Answer the followings:

i) Provide diagrammatic representation of logical memory to physical memory.

ii) Provide segment map table and draw a suitable memory management unit.
iii) Find out internal, external and total fragmentation.
 iv) List the segments of following physical addresses: 1050,560,78,2000. (K4)

UNIT IV STORAGE MANAGEMENT 10

Mass Storage system – Disk Structure - Disk Scheduling and Management; File-System Interface -
File concept - Access methods - Directory Structure - Directory organization - File system
mounting - File Sharing and Protection; File System Implementation - File System Structure -
Directory implementation - Allocation Methods - Free Space Management; I/O Systems – I/O
Hardware, Application I/O interface, Kernel I/O subsystem.

PART-A

1. Compare and Contrast HDDs and NVM devices. (K2)

2. Define Transfer rate, Seek time and Rotational Latency in Disk scheduling. (K1)
3. What are the various disk-scheduling algorithms? (K1)
4. Enlist different types of file directory structures. (K1)
5. Is FAT file system advantageous? Justify. (K5)
6. Distinguish file from directory. (K4)
7. Define C-SCAN scheduling. (K1)
8. How does DMA increase system concurrency? (K1)
9. Why rotational latency is not considered in disk scheduling? (K1)
10. List the various file attributes. (K1)
11. What are the various file operations? (K1)
12. What are the information’s associated with an open file? (K1)
13. What are the different accessing methods of a file? (K1)
14. What are the information associated with an open file? (K1)
15. List the operations that can be performed on a directory. (K1)
16. Determine the most common schemes for defining the logical structure of a directory? (K5)
17. Define UFD and MFD. (K1)
18. Define path name and its types. (K1)
19. Examine how an index file is used to speed up the access in direct-access files? (K5)
20. List disadvantages of using a single directory. (K1)
21. List the advantages of two-level directory? (K1)
22. List the disadvantages of two-level directory? (K1)
23. Discover the ways to overcome the disadvantages of two- level directory? (K4)
24. Compare Acyclic Graph Directory and General Graph Directory. (K2)
25. What are the allocation methods of a disk space? (K1)
26. List various layers of a file system. (K1)
27. Define rotational latency and disk bandwidth. (K1)
28. How free-space is managed using bit vector implementation? List its advantages. (K1)
29. Define Spooling. (K1)
30. What is the use of boot block? (K1)
31. What is sector sparing? (K1)
32. List three ways of allocating storage, and give advantages of each. (K1)
33. Define typical bad sector transaction. (K1)
34. Write three basic functions which are provided by the hardware clocks and timers. (K1)
35. What is Sequential access file and give one use of sequential access. (K1) (April 2023)
36. Define immutable shared file. (K1) (April 2023)
37. Explain any 4 file Operations. (K2)
38. What are the advantages of Contiguous Allocation? (K1)
39. What are the drawbacks of Contiguous Allocation of Disk Space? (K1)
40. What are the advantages of Linked Allocation? (K1)
41. What are the disadvantages of Linked Allocation? (K1)
42. What are the techniques used for performing I/O. (K1)
43. What problems could occur if a system allowed a file system to be mounted simultaneously at more than
one location? (K1)
44. Why must the bit map for file allocation be kept on mass storage rather than in main memory? (K1)
45. What are the advantages of Indexed allocation? (K1)
46. How can the index blocks be implemented in the indexed allocation scheme? (K1)
47. What is garbage collection? (K1)
48. What is the content of a typical file control block? (K1)
49. What are the information contained in a boot control block and partition control block? (K1)
50. Define buffering, Caching and Spooling. (K1)
51. What is the need for disk scheduling? (K1)
52. What is low-level formatting and High-level formatting? (K1)
53. What is the use of boot block? (K1)
54. What is sector sparing? (K1)
55. Write three basic functions which are provided by the hardware clocks and timers. (K1)
56. What are the advantages of Linked allocation? (K1)
57. What is double buffering? (K1)
58. Consider a system that supports the strategies of contiguous, linked and Indexed allocation. What criteria
should be used in deciding which strategy is best for a particular file? (K1)
59. Draw the diagram for interrupt driven I/O cycle? (K1)
60. How does DMA increase system concurrency? (K1)
61. Define C-SCAN scheduling. (K1)
62. Suppose that the disk rotates at 7200 rpm. What is the average rotational latency of the disk drive? (K3)
63. What is the advantage of bit vector approach in free space management? (K1)
64. Write short notes on file system mounting. (K1)
65. What is SSD? (K1)
66. Give the role of Operating System in Free Space Management. (K1) (Nov 2023)
67. List the various file access methods. (K1) (Nov 2023)
68. What are the data structures that can be used to implement a directory? (K1)
69. What is file system mounting? (K1)
70. List out the different free space management facilities available. (K1)
71. List and define the four registers in I/O device control. (K1)
72. Differentiate Blocking and Non-Blocking I/O. (K4)
73. What is meant by Vectored I/O? (K1)

PART B & PART C

1. Explain about disk Structure in Mass Storage System. (K2)
2. Explain the various Disk Scheduling algorithms in terms of the disk request queue given below:
95,183,37,120,15,120,60,72. (K2)
3. Compare the functionalities of FCFS, SSTF, C-SCAN and C- LOOK with example. (K2)
4. On a disk with 200 cylinders, numbered 0 to 199, compute the number of tracks the disk arm must
move to satisfy the entire request in the disk queue. Assume the last request received was at truck
100. The queue in FIFO order contains requests for the following tracks. 55, 58, 39, 18, 90, 160,
150, 38, 184. Perform the computation to find the seek time for the following disk scheduling
algorithms. (K2)
o FCFS
o SSTF
o SCAN
o C-SCAN
o LOOK
5. On a disk with 1000 cylinders, numbers 0 to 999, Compute the number of tracks the disk arm
must move to satisfy the entire request in the disk queue. Assume the last received was at track
345 and the head is moving towards track 0. The queue in FIFO order contains requests for the
 following tracks. 123,874,692,475,105 and 376.Find the seek length for the following scheduling
algorithm. (1) SSTF (2) LOOK (3) CSCAN. (K3)
6. Consider a disk queue with requests for I/O to blocks on cylinders 93,183, 37,122, 14, 124, 65, 67
If the disk head is start at 53, then find out the total head movement with respect to FCFS, SSTF,
SCAN, C-SCAN and LOOK scheduling. (K3)
7. State and explain the FCFS, SSTF and SCAN disk scheduling with examples. (K1) (K2)
8. 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
algorithms? FCFS, SSTF, SCAN, LOOK, C- SCAN C-LOOK. Explain the pros and cons of all disks
scheduling algorithms. (K3)
9. Suppose that a disk drive has 10000 cylinders, numbered 0 through 9999. The drive is serving a
request at cylinder 1142. The previous request was at cylinder 1125.The queue of pending requests,
in FIFO order is 185, 4169,3912, 2773, 4947, 5508, 8021, 4749, 9129 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 algorithms? FCFS, SSTF, SCAN, LOOK, C-
SCAN C-LOOK. (K3)
10. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The work queue is:
23,89,132,42,187. Determine the total distance for the following disk scheduling algorithms (K3)
(i) SCAN (ii) LOOK (iii) C-SCAN (iv) C-LOOK
11. Explain about storage disk Management. (K2)
12. Write short notes on
o File types
o File attributes
o File operations (K2)
13. What are the various disk space allocation methods. Explain in detail. (K1) (K2)
14. Write detailed notes on file system interface and file system structure. (K1) (Nov 2023)
15. Explain about file system mounting in detail. (K2)
16. Discuss in detail about file allocation methods. What are the possible structures for directory?
Discuss them in detail. (K2)
17. Explain in detail about File sharing and Protection. (K2)
18. Explain about free space management with example. (K2)
19. (i) Explain in detail the various allocation methods with their pros and cons. (K2)
(ii)Brief the various procedures need to be followed in disk management. (K2)
20. (i) Explain the different file access methods in detail. (K2)
(ii)Describe the two level and acyclic graph schemes for defining the logical structure of a directory.
(K2)
21. (i) What do you mean by directory structure? Also discuss Tree-Structure and Acyclic-Graph
Directories. (K1) (K2)
(ii) Describe in details about file system implementation and file allocation method. (K2)
22. Explain about I/O hardware in I/O systems. (K2)
23. Discuss in detail about Application I/O interface. (K2)
24. Explain the services provided by Kernel I/O subsystem. (K2)
 UNIT V VIRTUAL MACHINES AND MOBILE OS 7
Virtual Machines – History, Benefits and Features, Building Blocks, Types of Virtual
Machines and their Implementations, Virtualization and Operating-System Components;
Mobile OS - iOS and Android.
PART - A

1. What is a virtual Machine? (K1) May 2023

2. Write the benefits of using virtual Machines? (K1) Nov 2023
3. List the advantages and disadvantage of Virtual Machines? (K1)
4. Enlist the features of Virtual Machines? (K1)
5. Define VMM? (K1)
5. What are the building blocks for Virtual Machines? (K1)
7. List and define the types of Virtual Machines? (K1)
8. Define Hypervisor. (K1)
9.Compare the types of hypervisors. (K2)
10. List the types of Virtualization and define each. (K1)
11. Why is live migration possible in virtual environments but much less possible for a native operating
system? (K1)
12. What is meant by Emulation? (K1)
13. Write a note on Android. (K1) May 2023
14. Compare and Contrast Mobile OS Android and iOS. (K2)
15. List any two components that are unique for mobile OS. (K1) Nov 2023

PART-B & C

1. Explain in detail about history, benefits and features of Virtual Machines. (K2)
2. Explain in detail about Building blocks of Virtual Machines. (K2)
3. Present an outline of the types of Virtual Machines in detail. (K2) May 2023
4. Explain various types of Virtual Machines and their implementations in detail. (K2) Nov 2023
5. Explain in detail about virtualization and Operating System Components. (K2)
6. Outline the Operating system aspects of virtualization in the context of operating system functions
scheduling, I/O and memory management. (K1) May 2023
7. i) Explain the architecture of Android OS. (K2)
ii) Compare iOS with Android OS. (K2) Nov 2023
8. With frame work explain the working function of android operating system architecture. Compare
the feature of iOS and android. (K2)

*************

Prepared by Verified by Approved by

Mrs.V.Kalaiselvi , AP / AI&DS Dr.S.Priya Dr.U.V.Arivazhagu
HOD / AI&DS Principal