Producer process produces an item that is ________by the consumer.

• A) send
• B) blocked
• C) hold
• D) consumed

The Solution of Dining Philosopher Problem is used to avoid __________.

• A) Separation condition
• B) Multitasking condition
• C) Deadlock condition
• D) Isolation condition

Dining Philosopher Problem is used in Operating System to solve the Process ________.

• A) Synchronization Problem
• B) Subtracting Problem
• C) Adding Problem
• D) Finding Problem

We need the following data structures in the Banker’s algorithm:

• A) Available, Max, Allocation and Need.
• B) Available, Min, Allocation and Find.
• C) Available, Max, Allocation and Next.
• D) Available, Min, Allocation and First.

In Banker’s algorithm the order of process termination is called__________________.

• A) priority check
• B) safe sequence
• C) random sequence
• D) bulk execution

In case producer process has not yet produced any item and consumer process want to consume an item from the buffer than there will be buffer _______ message.

• A) full
• B) busy
• C) empty
• D) lock

In Banker's Algorithm, the system must know the ________ resource demand of each process in advance.

• A) current
• B) maximum
• C) minimum
• D) average

What is the purpose of the Banker's Algorithm?

• A) Speeding up memory access
• B) Compressing resources
• C) Avoiding deadlock
• D) Managing user passwords

In Banker's algorithm we can say that a system is in a ______if all of the processes in the system can be executed to termination in some order.

• A) reverse state
• B) stop state
• C) halt state
• D) safe state

A system is said to be in a safe state if _____________________.

• A) no process is blocked
• B) resources are never allocated
• C) processes can finish in some order
• D) CPU is idle

In dining philosopher problem, a philosopher can start eating once he has ______chopsticks

• A) 5
• B) 4
• C) 2
• D) 3

In Banker algorithm Max data structure is used. If______, then process Pi can request maximum k instances of resource type Rj.

• A) Max[i,j] = k
• B) Max[ j,i ] = k
• C) Max[k,j] = i
• D) Max[i,k] = j

Which variable is used to check if the system is in a safe state in Banker’s algorithm?

• A) counter
• B) safe
• C) allocation
• D) exec

What is calculated by available[i] = maxres[i] - allocation[i] in Baker’s algorithm?

• A) Average memory usage
• B) Total resource usage
• C) Remaining resources
• D) Process priority

If Segment = 1000 and Offset = 0020, what will be the Physical Address?

• A) 10020h
• B) 10000
• C) 10020
• D) 10010h

In Logical to Physical Address Translation, how is the 20-bit Physical Address calculated?

• A) Segment * Offset
• B) (Segment * 16) + Offset
• C) (Segment / 16) + Offset
• D) Segment + Offset

Which function is used to pause the screen at the end of the program in c language?

• A) system("pause")
• B) pause()
• C) stop()
• D) end()

Suppose there are 16 number of pages so number of bits needed for p is:

• A) 4
• B) 1
• C) 3
• D) 2

Logical data refers to the instruction or data stored in the ____________.

• A) Hash table space
• B) Process address space
• C) Secondary memory location
• D) Physical memory location

Which header file is used to access the log2 function in C?

• A) <stdio.h>
• B) <math.h>
• C) <string.h>
• D) <stdlib.h>