Banker’s algorithm is used to avoid
Asked in TPSC Junior System Engineer 2026
Answer under review: our editors are checking this question. Try the other TPSC Prelims previous year questions questions meanwhile.
More TPSC Prelims previous year questions questions
- Which CPU scheduling algorithm can cause the ‘convoy effect’, where short processes wait behind a long process ?
- In virtual memory, the concept of ‘thrashing’ occurs when
- A semaphore S is initialized to 1. Process P1 executes wait(S) and then signal(S). Process P2 also executes wait(S) then signal(S). This semaphore implements:
- Which page replacement algorithm suffers from Belady’s anomaly (increasing frames can increase page faults) ?
- Copy-on-Write (CoW) in fork() is an optimization that
- Which file allocation method provides the best sequential and random access but suffers from external fragmentation ?
- In a multi-threaded process, which of the following is shared among all threads of the same process ?
- The Shortest Remaining Time First (SRTF) scheduling algorithm is the preemptive version of SJF. Its main drawback is: