Quiz on Operating system

Q.1 First Come First Serve Algorithm is

a. Preemptive

b. Non preemptive

c. Computative

d. None of the above

Ans - b

Q.2  FCFS scheme is not useful in scheduling interactive users because it cannot guarantee

a. Good response cycle

b. Schedule of Processes

c. Good response time

d. Good throughput

Ans � c

Q.3 The average waiting time under round robin scheduling is often.

a. quite short

b. quite long

c. medium

d. none of the above

Ans- b

Q.4  The _______ is a certain store that allows the operating systems to locate key information about a process.

a. Operating system

b. Memory

c. Process Control Block

d. Play store

Ans - c

Q.5 The PCB contains important information about the specific process which does not include

a. Register

b. Clock

c. processor

d. Pointer

Ans- b

Q.6 Which of the following statement/s is/are true about threads?

1. Like processes, threads within a processes execute sequentially.

2. Unlike processes, thread can create children.

3. like processes, threads are not independent of one another.

a. All

b. Only 1

c. Only 2 &3

d. Only 1&3

Ans - b

Q.7  Use of threads in designing  Operating system

a. to make a great server

b. for interprocess communication

c. to not to take advantage of multiprocessor

d. to not to switch context

Ans � a

Q.8 Each thread has its own

a. Queue

b. Stack

c. Tree

d. None of the above

Ans - b

Q.9 The process of actually determining that a deadlock exists and identifying the processes and resources involved in the deadlock is called as

a. Deadlock avoidance

b. Deadlock  prevention

c. Deadlock detection

d. All of the above

Ans � c

Q.10 The complexity of deadlock detection algorithm is 

a. O(N)

b. O(N^2)

c. O

d. O(N^3)

Ans- b