Operating Systems (KCA203) - AKTU Question Paper 2024-25
MCA · Semester 2 · Free PDF Download
This is the official AKTU Operating Systems Previous Year Question Paper for MCA Semester 2, academic session 2024-25. 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 2024-25
Operating Systems (KCA203) — complete question paper · 100 marks · 3 Hours
- aDefine the term "Operating System" and explain its role in a computer system. 1 K 2
- bWhat is the role of cache memory management in an operating system? 1 K 2
- cWhat is CPU scheduling? Why is it necessary in a multiprogramming environment? 3 K 2
- dDefine semaphores. How are they used to solve synchronization i ssues in operating systems? 2 K 3
- eDescribe the typical elements of the process control block 3 K 2
- fWhat is the use of inter process communication and context switching? 2 K 3
- gExplain the logical address space and physical address space diagrammatically. 4 K 5
- hWhat do you mean by the safe state and an unsafe state? 4 K 3 i. Define Seek time and Latency time. 5 K 5 j. What do you mean by the I/O Buffering? 5 K 5
- aIn what scenario would a microkernel be preferred over a monoli thic kernel, considering system reliability and security?
- bHow do semaphores handle synchronization differently compared t o busy- waiting techniques like Test-and-Set? Which is more CPU efficient?
- cWhy is context switching essential during CPU scheduling, and what information must be stored in the Process Control Block (PCB) d uring this operation?
- dExplain how paging solves the problem of external fragmentation but still suffers from internal fragmentation
- eA hard disk having 2000 cylinders, numbered from 0 to 1999. the d r i v e i s currently serving the request at cylinder 143,and the previous re q u e s t w as at cylinder 125.The status of the queue is as follows What is the total distance (in cy linders) that the disk arm mov es to satisfy the entire pending request for each of the following disk-scheduling algorithms? i) SSTF ii) FCFS
- aWhy are reentrant kernels crucial for systems with multiple concurrent processes? What problem do they solve?
- bHow would you differentiate be tween multithreadin g and multipro cessing in terms of resource usage and inter-process communication?
- aCompare Peterson’s and Dekker’s solutions to the Critical Secti on Problem. Under what condition might one be preferred over the other?
- bExplain how the Test-and-Set operation helps in solving the Cri tical Section Problem. What is its major drawback in modern systems? 5.Attempt any one part of the following: 10 x 1 = 10
- aConsider the following process: Process Arrival Burst Time Time What is the average waiting and turnaround time for these processes with i) FCFS Scheduling ii) Preemptive SJF Scheduling Consider the following snapshot of a system: Answer the following questions using the banker’s algorithm: i) What is the content of the matrix need? ii) Is the system in a safe state Allocated Maximum Available Process R1 R2 R3 R1 R2 R3 R1 R2 R3 6.Attempt any one part of the following: 10 x 1 = 10
- aWhy is demand paging considered more efficient in terms of memo ry usage, and what is the risk if the page fault rate becomes too high?
- bConsider a logical address space of 64 pages of 1,024 words eac h, mapped onto a physical memory of 32 frames. i) How many bits are there in the logical address? ii) How many bits are there in the physical address? 7.Attempt any one part of the following: 10 x 1 = 10
- aHow does a RAID system improve data reliability and performance ? What trade-offs are involved?
- bHow do hierarchical file directo ries help organize data more ef fectively than flat file systems? What are the benefits in terms of access and management?
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 — KCA203
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)
A hard disk having 2000 cylinders, numbered from 0 to 1999. the d r i v e i s currently serving the request at cylinder 143,and the previous re q u e s t w as at cylinder 125.The status of the queue is as follows What is the total distance (in cy linders) that the disk arm mov es 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 (2024-25) Papers
Other subjects from same semester and session