Operating System Advanced Questions with Solutions

19 questions9 easy9 medium1 hard

This topic covers the deeper operating system concepts tested in MCA entrance exams. It includes processes and threads, process states, CPU scheduling algorithms (FCFS, SJF, priority and round robin), and measures such as waiting time and turnaround time. It also covers process synchronisation, semaphores, deadlock (its four necessary conditions, prevention, avoidance with the banker's algorithm, and detection), and memory management techniques such as paging, segmentation, virtual memory and page replacement algorithms (FIFO, LRU and optimal). Numerical questions on scheduling and page replacement appear regularly. Drawing a Gantt chart for scheduling questions and a frame table for page replacement questions makes them straightforward. Remember that the four necessary conditions for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait. Practise the advanced operating system questions below, each with a step-by-step solution.

  1. Q1.

    Which of the following scheduling algorithms is non-preemptive?

    A. Round RobinB. First-Come-First-Serve (FCFS)C. Shortest Remaining Time First (SRTF)D. Priority Scheduling with Preemption
    easyAsked in MAH MCA CET 2025View solution ›
  2. Q2.

    What is paging in the operating system?

    A. Memory management schemeB. Network management schemeC. Internet management schemeD. User management scheme
    easyAsked in MAH MCA CET 2024View solution ›
  3. Q3.

    Copying a process from memory to disk to allow space for other processes is called __.

    A. DeadlockB. SwappingC. Page faultD. Demand paging
    easyAsked in MAH MCA CET 2024View solution ›
  4. Q4.

    The simplest CPU - Scheduling algorithms is ____

    A. SJF scheduling algorithmsB. Round robin scheduling algorithmsC. Multilevel scheduling algorithmsD. FCFS scheduling algorithms
    easyAsked in TCS ExamView solution ›
  5. Q5.

    Breaking physical memory into fixed-sized blocks is called:

    A. PacketsB. PageC. FramesD. Segments
    easyAsked in TCS ExamView solution ›
  6. Q6.

    In an operating system, Round Robin Scheduling means:

    A. A kind of schedulingB. Repetition policyC. A memory allocation policyD. A process allocation policy
    easyAsked in TCS ExamView solution ›
  7. Q7.

    CPU Scheduler is also known as

    A. Job SchedulerB. Resource SchedulerC. Short-term SchedulerD. Process Scheduler
    easyAsked in TCS ExamView solution ›
  8. Q8.

    When does a Page fault occur?

    A. There is an error in a specific pageB. A program accesses a page not currently in main memoryC. A program accesses a page of main memoryD. A program accesses a page belonging to another program
    easyAsked in TCS ExamView solution ›
  9. Q9.

    Direct access of file is also known as

    A. random accessB. relative accessC. file accessD. sequential access
    easyAsked in TCS ExamView solution ›