Operating Systems (KCA-203) - AKTU Question Paper 2021-22
MCA · Semester 2 · Free PDF Download
This is the official AKTU Operating Systems Previous Year Question Paper for MCA Semester 2, academic session 2021-22. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Rate this paper
Questions Asked in 2021-22
Operating Systems (KCA-203) — complete question paper
- aDescribe all operating system services. 1
- bDefend timesharing differ from multiprogramming? If so, how ? 1
- cDiscuss the uses of mutex? 2
- dDescribe race condition f or cooperating processes. 2
- eCompare and contrast Single-threaded and multi-threaded pro cess. 3
- fDistinguish between CPU bounded, I/O bounded processes. 3
- gWhat are the conditions under which a deadlock situation ma y arise? 4
- hWhat is resource-allocation graph? 4 (i) Define Belady’s Anomaly. 5 (j) Explain logical address space and physical address space diagrammatically
- aDescribe operating system f unctions. Also, explain monolith ic, and microkernel systems
- bDefine critical section probl em. Write the Peterson’s solution to solve critical section problem
- cIllustrate process states and process transition diagram. 3
- dDiscuss the following storage placement strategies with suitable examples: (i) Best fit (ii) First fit (iii)Worst fit
- eWhat are the three methods f or allocating disk space? Explain. 5
- aExplain the following terms and their working with diagram i) Buffering ii) Spooling iii) Time sharing iv) Distributed system
- bDifferentiate between multiprocessor, multiuser, and Batch operating system
- aInterpret Dining ph ilosopher problem. 2
- bA shared variable x, initialized to zero, is operated on by fou r concurrent processes W, X, Y, Z as follows. Each of the process es W and X reads x from memory, increments by one, stores it to memo ry, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initializ ed to two. What is the maximum possible value of x after all process’ s complete execution?
- aIllustrate process states and process transition diagram. 3
- bConsider the set of 4 proce sses whose arrival time and burst time are given below- Process Arrival Time Burst Time Burst I/O Burst CPU Burst If the CPU scheduling policy is Shortest Remaining Time First, calculate the average waiting time and average turnaround time
- aConsidering a system with five processes P 0 through P 4 and three resources of type A, B, C. Resource type A has 10 instances, B has 5 instances and type C has 7 instances. Suppose at time t 0 following snapshot of the system has been taken. Then, I. What will be the content of the Need matrix? sequence? III. What will happen if process P 1 requests one additional instance of resource type A and two instances of resource type C?
- bApply banker’s algorithm for a system in which, there are three types of resources: E, F and G. Four processes P0, P1, P2 and P3 execute concurrently. At the outset, the processes have declared their maximum resource requirements using a ma trix named Max as given below. For example, Max [P2, F] is the maximum number of instances of F th at P2 would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix n amed Allocation. Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available. Find the safe sequence
- aA system uses 3-page frames for storing process pages in main memory. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processin g the Replacement algorithm? Also calculate the hit ratio and miss ratio
- bExplain the three methods available for allocating disk spa ce? 5
Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.
Repeated Questions — KCA-203
Questions that appeared in more than one session, found by comparing 4 years of Operating Systems papers (2021-22, 2022-23, 2023-24, 2024-25)
Compare and contrast Single-threaded and multi-threaded pro cess. 3
Appeared in: 2021-22 · 2022-23
Define critical section probl em. Write the Peterson’s solution to solve critical section problem
Appeared in: 2021-22 · 2022-23
Consider the set of 4 proce sses whose arrival time and burst time are given below- Process Arrival Time Burst Time Burst I/O Burst CPU Burst If the CPU scheduling policy is Shortest Remaining Time First, calculate the average waiting time and average turnaround time
Appeared in: 2021-22 · 2022-23
Operating Systems — Other Year Papers
AKTU Operating Systems PYQs from other sessions
More MCA Semester 2 (2021-22) Papers
Other subjects from same semester and session