MCASemester 22023-24Operating SystemsKCA203

Operating Systems (KCA203) - AKTU Question Paper 2023-24

MCA · Semester 2 · Free PDF Download

This is the official AKTU Operating Systems Previous Year Question Paper for MCA Semester 2, academic session 2023-24. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:MCA
Semester:Semester 2
Session:2023-24
University:AKTU / UPTU

Rate this paper

Questions Asked in 2023-24

Operating Systems (KCA203) — complete question paper · 100 marks · 3 Hours

Section AAttempt all q u e s t i o n s i n b r i e f .
  • a
    What are the advantages of Multiprocessor systems? 2 1
  • b
    List the Services of operatin g system function
  • c
    Define the term trap or exception? 2 1
  • d
    What is Process control block? L ist out the data field associa ted with PCB
  • e
    What are the methods for handling deadlocks? 2 3
  • f
    Define request edge and assignment edge. 2 3
  • g
    What is the main function of t he memory-management unit? 2 4
  • h
    What do mean by page fault? 2 4 i. What are the various file operations? 2 5 j. What are the allocation me thods of a Disk Space? 2 5
Section BAttempt any three o f t h e f o l l o w i n g :
  • a
    Enumerate the different opera ting system structure and explain with neat sketch
  • b
    Consider the set of 6 processes whose arrival time and burst time are given below- If the CPU scheduling policy is shortest remaining time first, calculate the average waiting time and average turnaround time
  • c
    Explain the RAG representation in Deadlock Detection. 10 3
  • d
    Consider a swapping system in which main memory contains the following hole sizes in memory order: 10K, 4K, 20K, 18K, 7K, 9K , 12K, and 15K. Which hole is taken for successive segment reques ts of 12K, 10K, 9K for First Fit? Repeat this exercise for Best-Fit, Worst-Fit, and Next-Fit. Which algorithm makes the most efficient use of memory?
  • e
    Explain the Linked list and i ndexed file allocation methods with neat diagram. Mention their advantages and disadvantages
Section CAttempt any one p a r t o f t h e f o l l o w i n g :
  • a
    Describe the differences between symmetric and asymmetric multiprocessing. What are three advantages and one disadvantage o f multiprocessor systems?
  • b
    What do you understand by Time-s haring systems? Describe the advantage of time sharing system
  • a
    Discuss in detail the critical section problem and also writ e the solution for Readers-Writers Problem with semaphores
  • b
    Explain different process stat es and its transition with a neat diagram. 10 2
  • a
    Define Deadlock? State and explain four conditions that are nec essary for deadlocks to occur with neat example
  • b
    Consider the following snapshot of a system: Processes Allocation Available
  • 1
    Calculate the content of the need matrix?
  • 2
    Is the system in a safe state?
  • a
    Explain in briefly and compare, fixed and dynamic memory par titioning schemes
  • b
    Illustrate the page-replaceme n t a l g o r i t h m s u s e t h e r e f e r e n c e 1,2,3,4,2,1,5,6,2,1,3,7,6,3,2,1,3,6 with 3 page frame. Find number of replacement
  • a
    Describe the file system in detail. 10 5
  • b
    Suppose that a disk drive has 5000 cylinders, numbered 0 throug h 4999. The drive is serving a request at cylinder 143. The queue of pe nding requests, in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022 , 1750, 130 Starting from the head positi on what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending r equests for each of the following disk-scheduling algorithms ? SSTF, LOOK, C- SCAN

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)

2x

Consider the set of 6 processes whose arrival time and burst time are given below- If the CPU scheduling policy is shortest remaining time first, calculate the average waiting time and average turnaround time

Appeared in: 2021-22 · 2023-24