Home Latest Jobs Syllabus Projects Previous Question Papers Entrance Exam Notifications Multiple Choice Question

AP ECET COMPUTER SCIENCE AND ENGINEERING Multiple Choice Questions (MCQs)

MCQs - Operating Systems

Multiple Choice Questions - Operating Systems

  1. Which of the following is the primary function of an operating system?

    • a) Memory management
    • b) Process management
    • c) File management
    • d) All of the above

    Answer: d) All of the above

  2. Which of the following is an example of a process?

    • a) A running program
    • b) A stored file
    • c) A program that has not started execution
    • d) None of the above

    Answer: a) A running program

  3. In which state does a process reside after it has been executed for a while and is waiting for an event to occur?

    • a) New
    • b) Ready
    • c) Blocked
    • d) Terminated

    Answer: c) Blocked

  4. Which of the following is the primary goal of process synchronization?

    • a) To avoid deadlocks
    • b) To ensure efficient CPU utilization
    • c) To ensure that processes do not interfere with each other
    • d) To prioritize the execution of processes

    Answer: c) To ensure that processes do not interfere with each other

  5. Which synchronization mechanism is used to prevent multiple processes from accessing a critical section simultaneously?

    • a) Semaphore
    • b) Mutex
    • c) Monitor
    • d) All of the above

    Answer: d) All of the above

  6. What is a deadlock in an operating system?

    • a) When two or more processes are waiting indefinitely for each other to release resources
    • b) When the system terminates a process to avoid conflict
    • c) When a process becomes unresponsive due to resource overload
    • d) None of the above

    Answer: a) When two or more processes are waiting indefinitely for each other to release resources

  7. Which of the following is NOT a condition for a deadlock to occur?

    • a) Mutual exclusion
    • b) Hold and wait
    • c) No preemption
    • d) Process starvation

    Answer: d) Process starvation

  8. Which of the following disk scheduling algorithms gives the shortest seek time?

    • a) First-Come, First-Served (FCFS)
    • b) Shortest Seek Time First (SSTF)
    • c) SCAN
    • d) Circular SCAN

    Answer: b) Shortest Seek Time First (SSTF)

  9. In which of the following memory management schemes, the physical memory is divided into fixed-size partitions?

    • a) Paging
    • b) Segmentation
    • c) Fixed Partitioning
    • d) Dynamic Partitioning

    Answer: c) Fixed Partitioning

  10. Which of the following is a disadvantage of paging?

    • a) Internal fragmentation
    • b) External fragmentation
    • c) Increased CPU time
    • d) None of the above

    Answer: a) Internal fragmentation

  11. Which of the following algorithms is used for disk space allocation in file systems?

    • a) First-Come, First-Served (FCFS)
    • b) Best Fit
    • c) Contiguous Allocation
    • d) All of the above

    Answer: c) Contiguous Allocation

  12. Which of the following describes a "long-term scheduler" in an operating system?

    • a) It decides which process to admit into the ready queue
    • b) It allocates CPU time to processes in the ready queue
    • c) It handles deadlock detection and recovery
    • d) It manages memory allocation to processes

    Answer: a) It decides which process to admit into the ready queue

  13. Which of the following is the main purpose of memory management in an operating system?

    • a) To keep track of the status of each process
    • b) To allocate and deallocate memory space to processes
    • c) To manage file storage on disk
    • d) To manage input and output devices

    Answer: b) To allocate and deallocate memory space to processes

  14. In which type of file allocation method is a file's blocks stored in contiguous memory locations?

    • a) Linked allocation
    • b) Contiguous allocation
    • c) Indexed allocation
    • d) None of the above

    Answer: b) Contiguous allocation

  15. Which of the following strategies can be used to handle deadlock prevention?

    • a) Resource allocation graph
    • b) Circular wait prevention
    • c) Both a and b
    • d) None of the above

    Answer: c) Both a and b



    << Previous Page    l    Next Page >>

Note/Caution: studentsbizz.com does not promise a job or an interview in exchange for money. Fraudsters may ask you to pay under the pretext of a registration fee or refundable fee, but please be aware that legitimate employers will not require such payments.