List of top Computer Science Questions on Searching, Sorting and Hashing asked in CUET (PG)

Match List-I with List-II.

List-IList-II
A. Breadth First SearchI. Shortest paths
B. Sparse GraphII. Adjacency list representation
C. Collision ResolutionIII. Open addressing
D. Linked listIV. Self referential structures


Choose the correct answer from the options given below:

Match List-I with List-II.

List-IList-II
A. Breadth First SearchI. Shortest paths
B. Sparse GraphII. Adjacency list representation
C. Collision ResolutionIII. Open addressing
D. Linked listIV. Self referential structures


Choose the correct answer from the options given below: