Scribd
Upload
25 views3 pages

MCA 103 Computer Arch and Operating System Question Bank

The document is an Operating System Question Bank divided into five units covering various topics such as micro operations, process management, memory management, synchronization, and file systems. Each unit contains detailed questions and problems related to scheduling algorithms, page replacement, deadlock avoidance, and disk scheduling. The content is designed to test knowledge and understanding of key operating system concepts and their practical applications.

Uploaded by

Pranjal Nale
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
25 views3 pages

MCA 103 Computer Arch and Operating System Question Bank

The document is an Operating System Question Bank divided into five units covering various topics such as micro operations, process management, memory management, synchronization, and file systems. Each unit contains detailed questions and problems related to scheduling algorithms, page replacement, deadlock avoidance, and disk scheduling. The content is designed to test knowledge and understanding of key operating system concepts and their practical applications.

Uploaded by

Pranjal Nale
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/ 3

Operating System Question Bank

Unit I
1. Describe the following types of micro operations in detail
a. Arithmetic micro-operations
b. Logic micro-operations
c. Shift micro-operations
2. Short notes on
a. register transfer operations
b. memory transfer operations
3. Describe the registers in a CPU with the help of a diagram
4. What are the different types of instructions. Describe the basic computer instruction format.
5. Explain Direct Memory Access in detail

Unit II
1. What are the main functions of operating systems? Differentiate between short term, medium term
and long germ scheduling
2. What is a process. What is the use of PCB? Discuss the various process states and
their transitions from one state to another.
3. What is multilevel feedback scheduling? What is the advantages of having different quantum sizes in
different levels of multilevel queuing system
4. Explain the different Scheduling algorithms?
5. Consider the following set of processes with length of CPU burst time given in milliseconds
Process Arrival time Run Time
P1 0.0 8
P2 0.4 4
P3 1.0 1
a. What is the average turnaround time for these processes wth FCFS scheduling algorithm?
b. What is the average turnaround time for these processes wth SJF scheduling algorithm?
6. Consider the following set of processes with their CPU burst time given in milliseconds
Process Arrival time Run Time
A 0.000 3
B 1.001 6
C 4.001 4
D 6.001 2
Calculate Turn around time, Waiting time, Average throughput
for these processes with the following scheduling
a) FCFS b) SJF c)RR (Q=2)
7. For the following job calculate average turn around time, waiting time and response time using i)
Round Robin ( Q=1) ii) FCFS iii) SRTN. Jobs have arrived at the same time. Priority is low for less no
and high for higher no
Job Burst time Priority
A 10 3
B 1 1
C 2 3
D 1 4
E 5 2

Unit III

1. What is memory management? Explain the concept of paging. Differentiate between


logical and physical address
2. Consider the following reference string
7 0 1 2 03 0 4 2 3 0 3 2 1 2 0 1 7 0 1
For a memory of three frames. How many page faults would occur for the following page
replacement algorithms i) FIFO ii) Optimal
3. Describe the following allocation algorithms:
a) First Fit b) Best Fit c)Worst Fit
4. What is paging? Under what circumstance do page faults occur? Describe the action
taken by OS when page fault occurs?
5. Explain the concept of Segmentation.
6. What is the concept of Virtual Memory? How it can be implemented. List the cost and
benefits of implementing virtual memory? Is it possible for cost to exceed the benefit.
Explain the measure you take to ensure that this imbalance does not occur.
7. Why should page replacement be performed? Compare FIFO and CRU page replacement
algorithm.
Unit IV
1. What conditions are to be satisfied for critical section problem? Explain any one algorithm for
critical section problem for two processes
2. Write short notes on
a. Semaphores
b. Monitors
3. Discuss any one classical problem of synchronization in detail.
4. Explain one algorithm for deadlocks avoidance?
5. Consider the snapshot of the system
Allocation Max Available
A B C A B C A B C
PO 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
Discuss using banker’s algorithm
i) What is the context of matrix need?
ii) Is the system in a safe state
iii) If process P1 requests one additional instance of resource type A and two
instance of resource type C Can the request be granted immediately
6. What is resource allocation graph? Consider the following systems of a particular instant.
Allocation Max Available
A B C D A B C D A B C D
PO 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
Using banker’s algorithm answer the following.
i) Is the system in a safe state
ii) If a request arrives from process P1 for (0 4 2 0) can it be immediately granted.
Unit 5
1. What is file system? Explain file system implementation in detail
2. What are device controllers? What is the primary function of device drivers and ports
3. What is direct memory access. Explain in detail?
4. Suppose a head of moving head disk with 200 tracks numbered 0 to 199 is currently
serving a request at track 143 and has just finished a request at track 125. If the queue
of requests is kept in FIFO order
86,147,91,177,94,150,102
A seek takes 6m sec per cylinder moved. How much seek time is needed for
i)FCFS ii)SCAN iii) SSTF
5. What are the essential goals of disk scheduling? Why does SCAN have a lower variance
of response times than SSTP?

You might also like