Advanced Database Management System - Tutorials and Notes: Operating systems MCQ questions set 2

Search Engine

Please visit, subscribe and share 10 Minutes Lectures in Computer Science

Thursday, 26 March 2020

Operating systems MCQ questions set 2

Operating systems MCQ questions set 1 for competitive exams

Operating systems multiple choice questions

1. The master boot record (MBR):
a. loads the operating system from a boot partition.
b. loads a boot loader from a boot partition.
c. identifies disk partitions so the BIOS can load a boot loader from the proper partition.
d. contains code that is run as soon as the system is powered on or reset.

2. Which of these is not a component of the operating system?
a. Boot loader.
b. Process scheduler.
c. System memory manager.
d. File system driver.

3. Which component of a process is not shared across threads?
a. Register values.
b. Heap memory.
c. Global variables.
d. Program memory.

4. Which are all goals of various CPU scheduling algorithms?
a. Fairness, Throughput, and I/O Bandwidth
b. Responsiveness, Utilization, and Timeliness
c. Turnaround time, No Starvation, and First-Come-First-Serve

5. Which of the following are advantages of paging?
a. Efficient use of memory and higher degree of multiprogramming
b. No overhead and doesn’t require any hardware support
c. Higher degree of multprogramming and no overhead

6. Which among the following is an alternative to programmed I/O?
a. memory-mapped I/O.
b. interrupt-driven I/O.
c. independent I/O.
d. direct memory access (DMA).

7. What for Translation Lookaside Buffers (TLB) are used?
a. Are used to cache frequently used data
b. Are used to cache process register information
c. Are used to cache page translation information

8. Which among the following is not valid state transition for a process?
a. running → blocked.
b. running → ready.
c. ready → running.
d. blocked → running.

9. A process control block (PCB) exists only for processes in
a. the ready state.
b. ready and running states.
c. ready and blocked states.
d. ready, running, and blocked states

10. Suppose you have a memory access stream that references pages 0, 1, and 2 over and over again, in that order and you have only 2 pages of physical memory for the process, which page replacement algorithm will generate the fewest page faults?
a. Least Recently Used (LRU)
b. First In First Out (FIFO)
c. Most Recently Used (MRU)
d. Last In First Out (LIFO)


Related links:

OS Interview questions with answers

solved Interview questions in operating systems

GATE questions in operating systems

MCQ Interview questions in OS

Operating systems interview questions for competitive exams

OS questions for IIT JEE entrance exam

No comments:

Post a comment

Featured Content

Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

All time most popular contents