MCASemester 22024-25Operating SystemsBMC203
View PDFDownload

Operating Systems (BMC203) - 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.

Course:MCA
Semester:Semester 2
Session:2024-25
University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

Operating Systems (BMC203) — complete question paper · 70 marks · 3 Hours

Section AAttempt all questions in brief. 02 x 7 = 14
  • a
    Define operating system and its goals
  • b
    Differentiate between monolit hic and micro kernel
  • c
    Discuss principle of concurrency
  • d
    Describe the solution to critical-section problem in brief
  • e
    Draw process state transaction diagram
  • f
    What are the characteristics of Deadlock?
  • g
    What is fragmentation and its types?
Section BAttempt any three of the following: 07 x 3 = 21
  • a
    Explain the layered structure of UNIX operating system with suitable diagram
  • b
    What is semaphore? Explain p roducer-consumer problem’s solution with semaphore
  • c
    What is thread? Explain the ac tions taken by a thread librar y to context- switch between user level threads
  • d
    What do you mean by thrashin g and its cause? Suggest solutio ns to overcome thrashing in virtual memory
  • e
    Discuss Contiguous memory allocation in details
Section CAttempt any one part of the following: 07 x 1 = 07
  • a
    What are the various security issues that arise in multiprog ramming and time-shared systems?
  • b
    Explain Interrupt driven operation for operating system and also draw neat and clean diagram for steps of interrupt processing
  • a
    What do you mean by algorithmi c approach to critical section implementation? How Two-way solution works? How it is different from Dekker’s solution and Peterson’s solution
  • b
    Write and explain the solution for Sleeping-Barber classical synchronization problem using monitors
  • a
    Consider the following scena rio of processes with time quant um = 2. D r a w t h e G a n t t c h a r t f o r t h e e x ecution of the processes, showin g their start time and end time, using improved round robin scheduling. Calculate turnaround time, norma lized turnaround time and waiti ng time for each process and average tu rnaround time, average normalize d turnaround time and average waiting time for the system. Compare all the metrics with round robin scheduling. Process P1 P2 P3 P4 Arrival Time 0 1 2 3 Execution Time 9 5 3 4
  • b
    Explain Banker’s Algorithm for Deadlock detection in details wi th Example?
  • a
    In paging system with TLB, it takes 30 ns to search the TLB and 90 ns to access the memory. If the TLB hit ratio is 70% find the effecti ve memory access time. What should be the hit ratio to achieve the effect ive memory access time of 130 ns
  • b
    Given page reference string: 1,2,3,2,1,5,2,1,6,2,5,6,3,1,3,6 ,1,2,4,3. Compare the number of page faults for LRU, FIFO and Optimal pag e replacement algorithm
  • a
    What is First-fit, Best-fit and Next-fit technique? Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and600 KB (in order), how would each of the first-fit, best-fit, and worst-fi t algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 K B (in order)?Which algorithm makes the most efficient use of memory?
  • b
    Consider a disk queue with I/O requests on the following cyl inders in their arriving order: 6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders . The disk consists of total 1 50 cylinders. Calculate and show w i t h d i a g r a m t h e d i s k h e a d m o v e m ent using LOOK and C-LOOK scheduling algorithm

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.

Operating Systems — Other Year Papers

AKTU Operating Systems PYQs from other sessions

Operating Systems2021-22Operating Systems2022-23Operating Systems2021-22Operating Systems2022-23Operating Systems2023-24Operating Systems2024-25

More MCA Semester 2 (2024-25) Papers

Other subjects from same semester and session

Database Management Systems2024-25Theory Of Automata Formal Languages2024-25Object Oriented Programming2024-25Data Structures Analysis Of Algorithms2024-25Web Technology2024-25Database Management Systems2024-25Data Structures Analysis Of Algorithms2024-25Object Oriented Programming2024-25
View all MCA Semester 2 2024-25 papers →