In dining philosopher problem all the five philosophers can do two things ______________.

• A) thinking and eating
• B) playing and eating
• C) laughing and eating
• D) sleeping and eating

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) lock
• B) empty
• C) busy
• D) full

In dining philosopher problem all the five philosophers sitting around the round circular table have _______ chopsticks.

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

What is the purpose of the Banker's Algorithm?

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

The address seen by memory unit i.e. the address loaded into the memory address register is commonly referred to as the ___________.

• A) Physical address
• B) Simple address
• C) Complex address
• D) Logical address

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

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

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

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

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

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

The address generated by CPU is commonly referred to as the ___________.

• A) Physical address
• B) Sample address
• C) Complex address
• D) Logical address

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

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

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

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

Logical Address generated by the CPU is divided into two parts: a page number (p) and a page offset (d) and is calculated by following formula:

• A) p * d
• B) p % d
• C) p / d
• D) p + d

In most computers memory access time is ranging from ______________.

• A) 300 to 600 microseconds
• B) 10 to 200 nanoseconds
• C) 200 to 300 microseconds
• D) 10 to 200 microseconds

Suppose there are 32 number of frames so number of bits needed for f is:

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

Paging allows physical address space to be_______________.

• A) sequential
• B) contiguous
• C) noncontiguous
• D) processed

For Logical to Physical Address Translation , which register is used to hold the physical address in memory?

• A) Memory Address Register (MAR)
• B) Instruction Register (IR)
• C) Program Counter (PC)
• D) Stack Pointer (SP)

Page Replacement Algorithm LRU is called:

• A) Low Reset Used
• B) Least Recently Used
• C) Low Resolution Used
• D) Low Reset UP

Least Recently Used (LRU) page replacement algorithm basically works on the concept that the pages that are heavily used in _______instructions are likely to be used heavily in next instructions.

• A) pop
• B) hash
• C) push
• D) previous

What is the formula for calculating physical address size, if the page number is p, frame number is f memory is mem and offset is d?

• A) pages + mem
• B) p + d
• C) p + f
• D) f + d

Two-dimensional array can be traversed in column major order if is traversed _______wise.

• A) row
• B) hash
• C) diagonal
• D) column