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.

    A computer has 16 GB of RAM. It typically needs to support 100 processes, each of which requires an average of 100 MB. Will this computer benefit from a virtual memory system? Choose the correct option and reasoning below.

    A. Yes, since virtual memory is faster than RAMB. No, since the total memory requirement is less than the total RAM availableC. Yes, since virtual memory provides protection across different processesD. No, since virtual memory makes the system vulnerable to security attacks
    mediumAsked in NIMCET 2026View solution ›
  2. Q2.

    ________ is a technique of improving the priority of process waiting in Queue for CPU.

    A. StarvationB. AgeingC. RevocationD. Relocation
    mediumAsked in MAH MCA CET 2025View solution ›
  3. Q3.

    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 ›
  4. Q4.

    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 ›
  5. Q5.

    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 ›
  6. Q6.

    A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is

    A. 20 bitsB. 11 bitsC. 13 bitsD. 15 bits
    hardAsked in NIMCET 2023 +1View solution ›
  7. Q7.

    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 ›
  8. Q8.

    Breaking physical memory into fixed-sized blocks is called:

    A. PacketsB. PageC. FramesD. Segments
    easyAsked in TCS ExamView solution ›
  9. Q9.

    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 ›
  10. Q10.

    Cancellation of thread occurs only when it reaches a :

    A. Cancellation pointB. Error pointC. Virtual pointD. Target point
    mediumAsked in TCS ExamView solution ›
  11. Q11.

    In IT terminology, a failure in the kernel is called a

    A. CrashB. Crash dumpC. DumpD. Kernel error
    mediumAsked in TCS ExamView solution ›
  12. Q12.

    In computer processing _______selects processes from the pool and loads them into memory for execution.

    A. Job SchedulerB. Resource SchedulerC. CPU SchedulerD. Process Scheduler
    mediumAsked in TCS ExamView solution ›
  13. Q13.

    ________ involves traversing the entire file system, marking everything that can be accessed.

    A. Index pointerB. Garbage collectionC. File systemD. Stack pointer
    mediumAsked in TCS ExamView solution ›
  14. Q14.

    Constantly running system program processes are known as

    A. DaemonsB. ProcessesC. Process BlockD. Process Control Block
    mediumAsked in TCS ExamView solution ›
  15. Q15.

    CPU Scheduler is also known as

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

    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 ›
  17. Q17.

    Direct access of file is also known as

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

    _________is having more memory addresses than are physically available.

    A. Virtual memoryB. System softwareC. Application softwareD. RAM
    mediumAsked in TCS ExamView solution ›
  19. Q19.

    In the virtual memory system, the address space specified by the address lines of the CPU must be ______ than the physical memory size and ______ than the secondary storage size.

    A. smaller, smallerB. smaller, largerC. larger, smallerD. larger, larger
    mediumAsked in NIMCET 2009View solution ›