QuizFree
GATE CS Practice: Algorithms and Data Structures
This includes
- 10 questions · 10 marks
- 20 minutes
- Language: English
About quiz
10 questions on recurrences, sorting, trees, graphs and hashing (GATE CS Sections 4–5).
Test details
10Questions
10Marks
20 minDuration
1Sections
10 questions · 1 mark each · no negative marking. Solutions are shown after you submit.
Practice questions
Pick an answer and check it instantly
Q1. What is the solution of T(n) = 2T(n/2) + n? (1 mark)
Q2. The worst-case running time of quicksort is: (1 mark)
Q3. What is the maximum number of nodes in a binary tree of height 4 (a single root has height 0)? (1 mark)
Q4. Which traversal of a binary search tree lists the keys in ascending order? (1 mark)
Q5. Dijkstra's shortest-path algorithm can give wrong answers when the graph has: (1 mark)
Q6. What is the minimum number of comparisons needed in the worst case to find both the minimum and the maximum of 100 numbers? (1 mark)
Q7. How many edges does a spanning tree of a connected graph with 20 vertices have? (1 mark)
Q8. With hashing by chaining and load factor α, the expected time of an unsuccessful search is: (1 mark)
Q9. What is the postfix form of (a + b) * c − d? (1 mark)
Q10. Which of these sorting algorithms is stable? (1 mark)
Comments (0)
Login to comment.
