Category: IT
Space Complexity MCQs For Gate Exam
💠 Space Complexity — GATE-Level MCQs (Algorithms) Q1. What is the auxiliary space used by merge sort for sorting an
Continue reading
Asymptotic Worst-Case Time Complexity MCQs
Asymptotic Worst-Case Time Complexity MCQs (GATE – Algorithms) Q1. If an algorithm’s running time is given by T(n) = 3n³
Continue reading
Hashing Algorithm MCQs for GATE
Hashing MCQs for GATE (with answers & solutions)
Continue reading
Sorting Algorithms MCQs for Gate Exam
Sorting Algorithms— GATE-Level MCQs Q1. Which of the following sorting algorithms has the best average-case time complexity?A) Insertion SortB) Bubble
Continue reading
Graphs MCQs in Data Structure
Graphs MCQs with Solutions 1. A graph with n vertices and n−1 edges, with all vertices connected, is called:A. TreeB.
Continue reading
Binary Heaps MCQs in Data Structure
Binary Heaps MCQs with Solutions 1. A max-heap is a complete binary tree in which:A. Parent is smaller than childrenB.
Continue reading
Trees MCQs in Data Structures for Exam
🌳 Trees – 100 Tricky GATE MCQs with Detailed Solutions 1. The maximum number of nodes in a binary tree
Continue reading
Linked Lists MCQs for Data Structures at GATE level
Linked Lists MCQs for Data Structures at GATE level
Continue reading