Previous year questions, mock tests with negative marking, a daily quiz and instant explanations. Built for your phone, works on slow internet.
96 questions · 1 exams · 1 subjects
Answer: C. Hash table
Hash tables provide average O(1) time complexity for access operations.
Answer: B. 5
The root is 60. Values smaller than 60 are 25, 15, 30, 13, and 18 (5 nodes).
Answer: D. Merge sort
Merge sort operates in O(n log n) time on linked lists without requiring random access.
Solve real BCS, bank and NTRCA papers in the original time limit.
Timed tests with negative marking and a full result breakdown.
10 new questions every day. Keep your streak alive.
Revise your wrong answers and weakest topics automatically.