List of top Programming and Data Structures Questions asked in 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?
Which of the following technique of searching compares every element of list where the list can be in any order?
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:
 
It is taken that enteries that are made in stack are considered "ordered". What does this imply?
which one of the following is not related with the stack ?
Which out of the following is not the application of stacks?