CUET-UG SERIES
Programming-and-data-structures

Linked Lists

3 previous year questions.

Volume: 3 Ques
Yield: Medium

High-Yield Trend

3
2023

Chapter Questions
3 MCQs

01
PYQ 2023
medium
programming-and-data-structures ID: cuet-ug-
Consider a list of elements 8, 7, 3, 4, 1, 9 and perform the insertion sort in ascending order. Which of the following intermediate list occur during sorting.
(A) 7, 8, 3, 4, 1, 9
(B) 7, 3, 8, 4, 1, 9
(C) 3, 4, 7, 8, 1, 9
(D) 7, 3, 4, 8, 1, 9
(E) 1,7, 3, 4, 8, 9
Choose the correct answer from the options given below:
1
(A) only
2
(A), (D) and (E) only
3
(B), (C) and (D) only
4
(A), (B) and (C) only
02
PYQ 2023
medium
programming-and-data-structures ID: cuet-ug-
Consider a list [−2, 0, 3, 5, 9, 11, 13]. Apply binary search to find element -2. Determine the number of key comparison required?
1
2
2
3
3
4
4
1
03
PYQ 2023
medium
programming-and-data-structures ID: cuet-ug-
Which of the following technique of searching compares every element of list where the list can be in any order?
1
Binary search
2
Linear search
3
Heap search
4
Hashing search