Previous Year Questions

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

Programming & Data Structures → Searching algorithms

In _____, the search time is independent of the number of elements n.

Choose One:

A) Binary Search

B) Hashing

C) Linear Search

D) Jump search

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

Programming & Data Structures → Searching algorithms

All the elements that hash to the same slot are placed into the same linked list in:

Choose One:

A) Universal hashing

B) Linear Probing

C) Quadratic probing

D) Chaining

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

Programming & Data Structures → Sorting algorithms

The Quicksort and randomized Quicksort procedures differ in:

Choose One:

A) Selection of Pivot element

B) Worst case time complexity

C) Best case time Complexity

D) Final Output

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

Programming & Data Structures → Time & space complexity

Match Algorithm with Recurrence relation: (A) Binary Search (B) Merge Sort (C) Quick sort (worst case) (D) Linear Search with (I) T(n)=T(n/2)+c (II) T(n)=2T(n/2)+Theta(n) (III) T(n)=T(n-1)+Theta(n) (IV) T(n)=T(n-1)+c.

Choose One:

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

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)

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

Programming & Data Structures → Time & space complexity

Arrange the following time complexities in increasing order. (A) Bubble sort (worst case) (B) Deleting head node in singly linked list (C) Binary search (D) Worst case of merge sort

Choose One:

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

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

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

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

PYQBOOK

Filter Questions

In _____, the search time is independent of the number of elements n.

Choose One:

All the elements that hash to the same slot are placed into the same linked list in:

Choose One:

The Quicksort and randomized Quicksort procedures differ in:

Choose One:

Match Algorithm with Recurrence relation: (A) Binary Search (B) Merge Sort (C) Quick sort (worst case) (D) Linear Search with (I) T(n)=T(n/2)+c (II) T(n)=2T(n/2)+Theta(n) (III) T(n)=T(n-1)+Theta(n) (IV) T(n)=T(n-1)+c.

Choose One:

Arrange the following time complexities in increasing order. (A) Bubble sort (worst case) (B) Deleting head node in singly linked list (C) Binary search (D) Worst case of merge sort

Choose One: