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
Loading...
Next Question

Overall Stats

Attempted 18
Correct 8
Incorrect 4
Viewed 6

Answers

Guest
Guest
Richa Dubey
Richa Dubey - 3 months ago

Richa Dubey is saying Aging is correct answer

Raghuveer Dhakad
Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying Aging is correct answer

Mushkin
Mushkin - 2 years ago

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

suresh 1547
suresh 1547 - 2 years ago

suresh 1547 from India is saying Compaction is correct answer

purushotham
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

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