Welcome to Operating System Quiz, Intermediate Level !!

Question 1. In a multithreaded environment _______.

Each thread is allocated with new memory from main memory.

Main thread terminates after the termination of child threads.

Every process can have only one thread.

none of the above

Question 2. Replace the page that will not be used for the longest period of time. This principle is adopted by ?

FIFO Page replacement algorithm

Optimal Page replacement algorithm

Round robin scheduling algorithm

SCAN scheduling algorithm

Question 3. In a virtural memory environment

segmentation and page tables are stored in the cache and do not add any substantial overhead

slow down the computer system considerable

segmentation and page tables are stored in the RAM

none of the above

Question 4. Which of the following statements is false?

Virtual memory implements the translation of a program's address space into physical memory address space

Virtual memory allows each program to exceed the size of the primary memory

Virtual memory increases the degree of multiprogramming

Virtual memory reduces the context switching overhead

Question 5. A major problem with priority scheduling is ?

Definite blocking


low priority

none of the above

Question 6. In UNIX based systems,To build a modularized kernel, the kernel-headers and kernel-source packages must first be installed. Where will you find the kernel-headers and kernel-source





Question 7. A thread is usually defined as a "light weight process" because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the followings is TRUE?

On per-thread basis, the OS maintains only CPU register state

The OS does not maintain a separate stack for each thread

On per-thread basis, the OS does not maintain virtual memory state

On per thread basis, the OS maintains only scheduling and accounting information

Question 8. You just added a new user, pankaj to the system. What group is pankaj added to by default





Question 9. Consider a set of n tasks with known runtimes r1, r2, ? rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?





Question 10. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called

Static loading

Dynamic loading

Dynamic linking