B.TechSemester 42022-23Operating SystemsKCS-401

Operating Systems (KCS-401) - AKTU Question Paper 2022-23

B.Tech · Semester 4 · Free PDF Download

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

Course:B.Tech
Semester:Semester 4
Session:2022-23
University:AKTU / UPTU

Rate this paper

Questions Asked in 2022-23

Operating Systems (KCS-401) — complete question paper

Section AAttempt all questions in brief. 2 x 10 = 20
  • a
    Define two main functions of an operating system
  • b
    Explain the principal advantages of multiprogramming
  • c
    Define the term busy waiting
  • d
    Define semaphore and its types
  • e
    Explain starvation problem and its solution
  • f
    Explain internal and external fragmentation
  • g
    Explain thrashing and locality of reference
  • h
    Distinguish between physical and logical address space of a process. (i) Explain various operations associated with a file. (j) Explain tree level directory structure
Section BAttempt any three of the following: 10x3=30
  • a
    Explain the following terms in detail: (i) Multiprocessor operating system (ii) Real time system (iii) Time sharing system
  • b
    For the following processes, draw Gantt chart to illustrate the execution using, (i) Preemptive priority scheduling (ii) Non-Preemptive priority scheduling. Also, Calculate average waiting time and average turnaround time. (Assumption: A larger priority number has higher priority.) Process Arrival Time Burst Time Priority
  • c
    Consider the given snapshot of a system with five p rocesses (P0,P1,P2,P3,P4) and three resources (A,B,C). Allocation MAX Available Process/Resource A B C A B C A B C (i) Calculate the content of Need Matrix. (ii) Apply safety algorithm and check the current system is in safe state or not. (iii) If the request from process P1 arrives for (1,1,0), can the request be granted immediately?
  • d
    Define process and process control block. Also, describe process state transition diagram in detail
  • e
    Explain the concept of paging. Also, explain paging hardware support using TLB with suitable diagram
Section CAttempt any one part of the following: 10x1=10
  • a
    Explain the term RAID and its characteristics. Also , explain various RAID levels with their advantages and disadvantages
  • b
    Explain the concept of file system management. Also , explain various file allocation and file access mechanisms in details
  • b
    Explain dinning philosopher problem and its solution using semaphore
  • b
    Explain the terms hit ratio and miss ratio. On a simple paged system, associative registers hold the most active page entries and the full-page table is stored in main memory. If references satisfied by associative registers take 100ns, and references through main memory page table takes 180 ns, what must the hit r atio be to achieve an effective access time of 125 ns?
  • b
    Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assum e that the initial position of the R/W head is on track 49. Calculate the net head movement using: (i) SSTF (ii) SCAN (iii) CSCAN (iv) LOOK
  • b
    Explain the followings: (i) Buffering (ii) Polling (iii) Direct Memory Access (DMA)

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.