Previous Year Questions

Q51 MCQ CUET-PG COMPUTER SCIENCE (MCA) Medium 4 Marks 2025

Operating Systems → CPU scheduling algorithms

Match List-I with List-II: (A) FCFS (B) Round Robin (C) Multi level queue scheduling (D) Multi-level Feedback Queue with (I) FCFS + preemption (II) Allows the processes to move between queues (III) Often long average waiting time (IV) Permanent assignment of processes to one specific queue.

Choose One:

A) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)

B) (A)-(III), (B)-(I), (C)-(IV), (D)-(II)

C) (A)-(I), (B)-(II), (C)-(IV), (D)-(III)

D) (A)-(III), (B)-(IV), (C)-(I), (D)-(II)

Q52 MCQ CUET-PG COMPUTER SCIENCE (MCA) Easy 4 Marks 2025

Operating Systems → Synchronization

Consider a typical process P, in the critical section. Arrange the following statements of code to make a valid general structure. (A) Critical section (B) Remainder section (C) Entry section (D) Exit section.

Choose One:

A) (C), (B), (A), (D)

B) (C), (A), (B), (D)

C) (C), (A), (D), (B)

D) (C), (B), (D), (A)

Q53 MCQ CUET-PG COMPUTER SCIENCE (MCA) Medium 4 Marks 2025

Operating Systems → Synchronization

'The Dining Philosopher' problem can be solved by:

Choose One:

A) Use of semaphores

B) Use of overlays

C) Mutual exclusion

D) Bounded waiting

Q54 MCQ CUET-PG COMPUTER SCIENCE (MCA) Medium 4 Marks 2025

Operating Systems → Deadlock

Which of the following is a way to recover from the deadlock which has already occurred?

Choose One:

A) Process termination

B) Non preemption of resources

C) Banker's algorithm

D) Circular wait

Q55 MCQ CUET-PG COMPUTER SCIENCE (MCA) Easy 4 Marks 2025

Operating Systems → Deadlock

A situation where two or more processes are blocked, waiting for resources held by each other is called:

Choose One:

A) Pooling

B) Deadlock

C) Thrashing

D) Paging

PYQBOOK

Filter Questions

Match List-I with List-II: (A) FCFS (B) Round Robin (C) Multi level queue scheduling (D) Multi-level Feedback Queue with (I) FCFS + preemption (II) Allows the processes to move between queues (III) Often long average waiting time (IV) Permanent assignment of processes to one specific queue.

Choose One:

Consider a typical process P, in the critical section. Arrange the following statements of code to make a valid general structure. (A) Critical section (B) Remainder section (C) Entry section (D) Exit section.

Choose One:

'The Dining Philosopher' problem can be solved by:

Choose One:

Which of the following is a way to recover from the deadlock which has already occurred?

Choose One:

A situation where two or more processes are blocked, waiting for resources held by each other is called:

Choose One: