Operating Systems (KCA-203) - AKTU Question Paper 2022-23
MCA · Semester 2 · Free PDF Download
This is the official AKTU Operating Systems Previous Year Question Paper for MCA Semester 2, academic session 2022-23. 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 2022-23
Operating Systems (KCA-203) — complete question paper
- aDefine operating system and mention its major functions
- bDifferentiate between times sharing and real time system
- cDistinguish between multilevel queue sch eduling and multilevel feedback queue scheduling
- dHow the starvation is different from deadlock? Explain
- eSemaphore gives its implementation to avoid busy waiting. Justify
- fCompare and contrast Single-threaded and multi-threaded process
- gWhat are the Performance Criteria in CPU Scheduling? Explain
- hDifferentiate between paging and segmentation. (i) What do you mean by file directories? Explain. (j) Define link file allocation method
- aExpla in batch operating system with example
- bWhat is semaphore? Classify the semaphore with their synchronization code
- cDefine the following terms:- (i) Dispatcher (ii) Dispatch Latency (iii) Optimization of scheduling criteria (iv) Swapping (v) Context switching
- dFive memory partitions of 100, 500, 200, 300 & 600 (all in KB) are in order, how would the ‘first-fit, best-fit & worst-fit’ sha ll place processes of size 212, 417, 112, & 426 ((all in KB). Deduce the most effic ient memory management technique
- eDiscuss in detail the ‘Linked, Contiguous, Index & Multi-level Indexing’ file allocation schemes
- aDefine Process. Explain various steps involved in c hange of process state with neat transition diagram
- bWhat is the purpose of the System Calls or Applicat ion Programming Interface (APIs).Enumerate five system calls used in process management or file management?
- aDefine critical section problem. Write the Pe terson’s solution to solve critical section problem
- bWhat is Producer Consumer problem? How it can illus trate the classical problem of synchronization? Explain
- bConsider the set of 4 processes whose arrival time and burst time are given below- Process Arrival Time Priority Burst Time CPU Burst I/O Burst CPU Burst If the CPU scheduling policy is Priority Scheduling , calculate the average waiting time and average turnaround time. (Lower nu mber means higher priority)
- aIllustrate the following page -replacement algorithms. i) FIFO ii) LRU Use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1 for a memory with four frames
- bDiscuss Resource Allocation Graph (RAG)? Find how m any cycles’ deadlocks reside in given figure
- aA hard disk having 2000 cylinders, numbered from 0 to 1999. The drive is currently serving the request at cylinder 143,and the previou s request was at cylinder 125.The status of the queue is as follows 86, 1470, 913, 17 74, 948, 1509, 1022,1750,130. What is the total distance (in cylinders) that the disk arm moves to satisfy the entire pending request for each of the following disk scheduling algorithms? (i) SSTF (ii) FCFS
- bWrite short note on(any three): (i)I/O buffering (ii) Disk storage & scheduling (iii) File Directory (iv) RAID
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 process
Appeared in: 2021-22 · 2022-23
Define critical section problem. Write the Pe terson’s solution to solve critical section problem
Appeared in: 2021-22 · 2022-23
A hard disk having 2000 cylinders, numbered from 0 to 1999. The drive is currently serving the request at cylinder 143,and the previou s request was at cylinder 125.The status of the queue is as follows 86, 1470, 913, 17 74, 948, 1509, 1022,1750,130. What is the total distance (in cylinders) that the disk arm moves to satisfy the entire pending request for each of the following disk scheduling algorithms? (i) SSTF (ii) FCFS
Appeared in: 2022-23 · 2024-25
Operating Systems — Other Year Papers
AKTU Operating Systems PYQs from other sessions
More MCA Semester 2 (2022-23) Papers
Other subjects from same semester and session