Assignment Questions before MID-1
SET-I
PART-A
S. No. Question BTL
1 Define the types of Operating Systems. L1
2 Define a Process. What is the difference between a process and a thread? L1
3 What is a Process and Name different states of a process? L1
4 State the differences between preemptive and non-preemptive scheduling. L1
5 Define the terms waiting time and turnaround time. L1
6 What are the necessary and sufficient conditions to occur deadlock? L1
PART-B
7 Explain I/O Structure. List the steps performed by I/O operation. L2
8 Differences between multiprogramming and multi-processing? L2
9 What are the scheduling queues implemented in the operating system? L1
PART-C
10 How hold and wait condition be prevented? Write the ways to deal with deadlock program. L2
11 Process burst time Arrival Time
P1 75 0
P2 40 10
P3 25 10
P4 20 80
P5 45 85
What is Shortest Remaining Time (SRT) Scheduling?
L3
Draw the Gantt chart and calculate the turnaround time and waiting time of the jobs for RR (tq=15)
Scheduling algorithms.
12 Describe Long Term, Short Term and Medium term Scheduling. L2
SET-II
PART-A
S. Question BTL
No.
1 What are the steps involved in process control block? L1
2 What are the two real time systems? L1
3 Define Operating Systems. What are the goals of Operating System? L1
4 Define Scheduler. List various types of Schedulers. L1
5 What is process scheduling? L1
6 Define Deadlock prevention and avoidance. L1
PART-B
7 Classify various types of system calls and give one example for each type. L2
8 Explain briefly operating system services. L2
9 With the help of a state transition diagram, explain various states of a process. L2
PART-C
10 How is Deadlock Prevented? Discuss with an example. L2
11 Explain about context switching with a neat diagram. L2
12 What is Deadlock Avoidance? Explain Bankers algorithm and state its advantages. L3
SET-III
PART-A
S. No. Question BTL
1 What is a system call? List various types of System calls L1
2 List out components of Operating System. L1
3 Define Asymmetric multiprocessing. L1
4 Define Safe and Unsafe state. L1
What is Mutual Exclusion?
5 L1
6 State the Purpose of fork ( ) System call L1
PART-B
7 Evaluate the role of Process Control Block (PCB) in process management and context switching. L4
8 Analyze the differences between user-level and kernel-level-threads. Which model provides better
L3
efficiency? Justify the answer.
9 Discuss how the major components of an operating system work together to manage a system. L2
PART-C
10 Illustrate the following System calls -fork( ), exit( ), wait( ), waitpid( ) and exec( ) with suitable
L2
examples
11 Consider the following snapshot of a system:
Process Allocation Max Available
ABCD ABCD ABCD
P0 0 0 1 2 0 0 1 2 2 1 0 0
P1 2 0 0 0 2 7 5 0 2 1 0 0
P2 0 0 3 4 6 6 56
P3 2 3 4 5 4 3 56 L3
P4 0 3 3 2 0 6 5 2
Answer the following questions using the banker’s algorithm:
a. Is the system in a safe state? Why
b. Is the system currently deadlocked? Which process, if any, or may become deadlocked if the
whole request is granted immediately?
12 What are the basic Requirements for the execution of concurrent process? L2
SET-IV
PART-A
S. No. Question BTL
1 List advantages of multiprogramming systems. L1
2 A System is having 10 user processes each requires 4 units of a resource R. What is the minimum
L3
number of R such that no deadlock will occur?
3 What is a critical section problem & Race condition? L1
4 What is Inter Process Communication? L1
5 What is the importance of process synchronization? L1
6 Define Semaphore. L1
PART-B
7 What is process scheduling? State the characteristics of a good process scheduler? L2
8 Briefly explain about SJF CPU Scheduling Algorithm. Consider the following set of processes with
the length of the CPU burst time given in milliseconds. Draw the gantt chart
Processes Burst Time Arrival
1 7 0
L3
2 4 2
3 1 4
4 5 5
Calculate the average turnaround time and average waiting time using SJF from the above table.
9 State and explain the methods involved in recovery from deadlock? L2
PART-C
10 Explain how the hardware instructions Test_and_Set () and Compare_and_Swap () work in
L2
achieving synchronization.
11 Demonstrate that monitors and semaphores are equivalent as they can be used to implement the
L3
same types of synchronization problems.
12 Describe Peterson’s Algorithm and explain how it ensures mutual exclusion between two processes. L3
Assignment Questions before MID-2
SET-I
PART-A
S. No. Question BTL
1 List various classical problems of synchronization. L1
2 A counting semaphore was initialized to 10, then 6 P (wait) operations and 4 V (signal) operations
L3
were completed on the semaphore. Determine the resulting value of the semaphore.
3 What is the use of Shared Memory? L1
4 Identify the difference between a Page and Frame. L1
5 Draw the diagram of Structure of page table. L1
6 What is meant by thrashing? L1
PART-B
7 List out different IPC methods. L1
8 Draw a Acyclic-graph directory structure. L1
9 Explain the different contiguous memory allocation techniques. What are the disadvantages of
L2
single contiguous memory allocation?
PART-C
10 Describe paging and explain about structure of page Table. L2
11 Using the page reference string 1,2,3,4,2,1,5,6,2,1,2,3,2,1,2,3,6, calculate the number of page faults
L3
for LRU with three and four frames.
12 Explain what demand paging is and describe how it is implemented in an operating system. L2
SET-II
PART-A
S. No. Question BTL
1 Define wait ( ) and signal ( ) op0erations L1
2 Discuss about Message Queues in IPC. L2
3 Define Pipes. L1
4 Define Swapping & Fragmentation. L1
5 Explain about indexed sequential access. L1
6 What is Free Space Management? L1
PART-B
7 Discuss the Least Recently Used (LRU) page replacement algorithm and illustrate it with an
L2
example.
For the page reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1, compute the page faults using
8 L3
FIFO and Optimal algorithms for three frames.
9 Consider a Swapping System in which memory consists of the following hole sizes in memory
order: 12KB,4 KB,24KB,15KB,9KB,7KB,10KB and 11KB. Which hole is taken for successive
L3
segment requests of: (i) 14 KB (ii) 8 KB (iii) 5 KB for the first fit, best fit, worst fit and next fit
approaches?
PART-C
10 Define a page fault and describe the page fault handling mechanism with a neat sketch. L2
11 What is fragment? Explain the differences between internal and external fragments. L2
12 Explain Segmentation? Draw the Segmentation Hardware Diagram. L3
SET-III
PART-A
S. No. Question BTL
1 State first fit and best fit memory allocation techniques. L1
2 What is Belady’s anomaly? L1
3 Define Virtual Memory and segmentation. L1
4 List various file attributes. L1
5 What is directory? L1
6 Define File Sharing. L1
PART-B
7 State and Explain various File Access Methods? L2
8 Explain the single-level and two-level directory structures with neat diagrams. L2
9 Discuss the various free space management techniques used in file systems. L2
PART-C
10 Describe contiguous and linked file allocation methods, and explain their advantages and
L3
drawbacks.
11 Write a short notes on Disk Structure. L3
12 Discuss the indexed file allocation method and illustrate it with an example. L2
SET-IV
PART-A
S. No. Question BTL
1 Define logical and physical address. L1
2 What is a Page fault? L1
3 Define Demand paging Technique. L1
4 Define File. Enlist the attributes of a file. L1
5 What is Layered file system? L1
6 List disadvantage of contiguous file allocation method. L1
PART-B
7 What is a directory? Write short notes on directory implementation? L2
8 Explain the system calls open (), read (), write (), lseek(), stat(), and ioctl() with brief descriptions. L2
9 Explain the Concept of File Protection and Security. L2
PART-C
10 Define an unnamed pipe, describe how it is created, and explain its limitations. L2
11 Explain read system call with its syntax. L2
12 Explain write() and close() system calls. L2