💻

GATE CS - Operating Systems

Practice process management, memory management, file systems, and disk scheduling

100 questions•10 pages•~150 min

Progress: 0 / 1000%

Page 1 of 10 • Questions 1-10 of 100

Q1easy

What is the state of a process when it is waiting for an I/O operation to complete?

A)Ready

B)Running

C)Waiting/Blocked

D)Terminated

Q2medium

Which scheduling algorithm can cause starvation?

A)FCFS

B)Round Robin

C)Shortest Job First

D)All of the above

Q3easy

What is the main disadvantage of the First-Come-First-Served (FCFS) scheduling algorithm?

A)High CPU utilization

B)Convoy effect

C)Complex implementation

D)High context switching overhead

Q4medium

In Round Robin scheduling, if the time quantum is too large, it behaves like:

A)SJF

B)FCFS

C)Priority scheduling

D)Multilevel queue

Q5easy

What is a semaphore?

A)A hardware device

B)An integer variable used for synchronization

C)A process state

D)A scheduling algorithm

Q6medium

Which of the following is NOT a necessary condition for deadlock?

A)Mutual Exclusion

B)Hold and Wait

C)No Preemption

D)All are necessary conditions

Q7medium

What is the purpose of the Banker's Algorithm?

A)Deadlock prevention

B)Deadlock avoidance

C)Deadlock detection

D)Deadlock recovery

Q8easy

In paging, what is stored in the page table?

A)Physical addresses

B)Logical addresses

C)Mapping from page number to frame number

D)File names

Q9easy

Which page replacement algorithm is optimal but not practical?

A)FIFO

B)LRU

C)Optimal

D)Second Chance

Q10medium

What is thrashing?

A)High CPU utilization

B)Excessive page swapping

C)Deadlock situation

D)Process starvation

...

Schoolabe

Learn, Practice, Ace Coding

Programs Companies Tutorials Practice Quiz Interview Prep

About Contact Careers Blog

Documentation API Reference Community Support