Previous Year Questions

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

Operating Systems → Disk scheduling

Which disk scheduling algorithm looks for the track closest to the current head position?

Choose One:

A) LOOK

B) SSTF

C) FCFS

D) SCAN

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

Programming & Data Structures → Graph basics

Consider finding the shortest path in an unweighted graph using BFS and DFS. Which statements are true? (A) BFS always finds the shortest path. (B) DFS always finds the shortest path. (C) DFS does not guarantee finding the shortest path. (D) BFS does not guarantee finding the shortest path.

Choose One:

A) (B) and (D) only

B) (A) and (C) only

C) (A) and (B) only

D) (C) and (D) only

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

Programming & Data Structures → Graph basics

Match List-I with List-II: (Algorithm) (A) BFS (B) DFS (C) Heap sort (D) Storage on secondary devices with (Data Structure) (I) Stack (II) B Trees (III) Priority Queue (IV) Queue.

Choose One:

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

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

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

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

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

Programming & Data Structures → Graph basics

Which of the following is not an application of DFS?

Choose One:

A) Topological Sort

B) Determining Strongly Connected Components in a graph

C) Finding minimum distance to a node in an unweighted graph optimally

D) Solving Maze Problem

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

Programming & Data Structures → Graph basics

Which of the following statements are TRUE, where |E| represents the number of edges. (A) In directed graph, sum of lengths of all adjacency list is |E| (B) For undirected graph, sum of lengths of all adjacency list is 2|E| (C) For dense graph, adjacency matrix representation is preferable (D) Memory requirement of adjacency matrix depends on number of edges

Choose One:

A) (A), (B) and (D) only

B) (A), (B) and (C) only

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

D) (B), (C) and (D) only

PYQBOOK

Filter Questions

Which disk scheduling algorithm looks for the track closest to the current head position?

Choose One:

Consider finding the shortest path in an unweighted graph using BFS and DFS. Which statements are true? (A) BFS always finds the shortest path. (B) DFS always finds the shortest path. (C) DFS does not guarantee finding the shortest path. (D) BFS does not guarantee finding the shortest path.

Choose One:

Match List-I with List-II: (Algorithm) (A) BFS (B) DFS (C) Heap sort (D) Storage on secondary devices with (Data Structure) (I) Stack (II) B Trees (III) Priority Queue (IV) Queue.

Choose One:

Which of the following is not an application of DFS?

Choose One:

Choose One: