5 years ago in UGC CS - December 2012

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using :

[A] Parity bit
[B] Aging
[C] Compaction
[D] Timer

Overall Stats

Attempted 18
Correct 8
Incorrect 4
Viewed 6

Richa Dubey - 3 months ago

Richa Dubey is saying Aging is correct answer

Raghuveer Dhakad - 2 years ago

Mushkin - 2 years ago

Mushkin from Anantapur, India is saying Parity bit is correct answer

suresh 1547 - 2 years ago

suresh 1547 from India is saying Compaction is correct answer

purushotham - 2 years ago

purushotham from India is saying Compaction is correct answer

Related Questions

The worst case time complexity of AVL tree is better in comparison to binary search tree for

• [A] Search and Insert Operations
• [B] Search and Delete Operations
• [C] Insert and Delete Operations
• [D] Search, Insert and Delete Operations

Consider the tree given below :Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree.

• [A] d & h
• [B] c & k
• [C] g, b, c, h, i, m
• [D] c & h

If a packet arrive with an M-bit value is '1' and a fragmentation offset value is '0', then it is ____________ fragment.

• [A] First
• [B] Middle
• [C] Last
• [D] All of the above

The GSM network is divided into the following three major systems:

• [A] SS, BSS, OSS
• [B] BSS, BSC, MSC
• [C] CELL, BSC, OSS
• [D] SS, CELL, MSC

• [A] 8-Bits
• [B] 16-Bits
• [C] 32-Bits
• [D] 64-Bits