![GATE 2024 CSE Daily Practice Questions for 29 September 2023](https://media.collegedekho.com/media/img/news/untitled_2_CBWQr8L.jpg?height=310&width=615)
GATE 2024 CSE Daily Practice Questions: Students appearing for GATE 2024 exam and aspiring to get admission to computer science engineering courses must regularly practice questions to get familiar with the type of questions asked, examination pattern, and syllabus. Start practising GATE 2024 CSE daily practice questions provided below and analyse for preparation level!
Also Read |
- GATE 2024 CSE Daily Practice Questions for 27 September 2023
- GATE Question Paper 2023
- GATE 2022 Question Paper
- GATE 2021 Question Paper
GATE 2024 CSE Daily Practice Questions for 29 September 2023
Test takers can find daily CSE practice questions for GATE 2024 here. Solve the given questions and analyse your exam preparation.
Question 1: The master theorem
A: assumes the subproblems are unequal sizes
B: can be used if the subproblems are of equal size
C: cannot be used for divide and conquer algorithms
D: cannot be used for asymptotic complexity analysis
Question 2: An array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places) is _________.
A: 0.08
B: 0.0016
C: 0.04
D: 0.0008
Question 3: Consider the following array.
23,32, 45, 69, 72, 73, 89, 97
Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort the above array in ascending order?
A: Selection sort
B: Mergesort
C: Insertion sort
D: Quicksort using the last element as pivot
Question 4: Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input?
A Mege Sort
B Insertion Sort
C Selection Sort
D Quick Sort
Question 5: Algorithm design technique used in the quicksort algorithm is?
A: Dynamic programming
B: Backtracking
C: Divide and conquer
D: Greedy method
Also Read |
For the latest Education News , keep visiting CollegeDekho. You can also ‘follow’ our WhatsApp Channel to stay updated with the latest happenings. You can also write to us at our E-Mail ID news@collegedekho.com.