Menu

Question Discussion & Solution

MCQ

Q.

The Banker's algorithm is _____________ than the resource allocation graph algorithm.

A

less efficient

B

more efficient

C

equal

D

none of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

In the write ahead logging a _____________ is maintained.

A

a memory

B

a system

C

a disk

D

a log record

Discussion

MCQ

2.

If the resources are always preempted from the same process __________ can occur.

A

deadlock

B

system crash

C

aging

D

starvation

Discussion

MCQ

3.

Which one of the following is the deadlock avoidance algorithm?

A

banker's algorithm

B

round-robin algorithm

C

elevator algorithm

D

karn's algorithm

Discussion

MCQ

4.

In the bounded buffer problem, there are the empty and full semaphores that ____________

A

count the number of empty and full buffers

B

count the number of empty and full memory spaces

C

count the number of empty and full queues

D

none of the mentioned

Discussion

MCQ

5.

The bounded buffer problem is also known as ____________

A

Readers-Writers Problem

B

Dining- Philosophers Problem

C

Producer- Consumer Problem

D

None of the mentioned

Discussion

More Operating System Topics

Introduction to Operating System

5 MCQs

Types

16 MCQs

Services

2 MCQs

Structures

3 MCQs

Processes

58 MCQs

Threads

47 MCQs

CPU Scheduling

79 MCQs

Process Synchronization

117 MCQs

Memory Management

179 MCQs

Storage Management

283 MCQs

Input Output Systems

55 MCQs

Networking

36 MCQs

Distributed Operating System

73 MCQs

Protection and Security

123 MCQs

Unix

145 MCQs

Linux

160 MCQs

MS Windows

1 MCQs

Mixed

10 MCQs