Data Structures and Algorithms MCQs. Multiple Choice Questions related to Data Structures and Algorithms. These data structures and algorithms MCQs are helpful for students for university exams and preparation. For Software Engineering MCQs check Software Engineering MCQs
Data Structures and Algorithms MCQs
1- Sorting is not possible using which method ??
2- Which of these algorithms uses the minimum number of swaps when it sorts ??
(A) Merge Sort
(B) Bubble Sort
(C) Selection Sort
(D) Quick Sort
3- a,b,c,d,e <– What will be the Huffman code for these letters ??
4- If we want to find all the pairs of shortest distances in a graph which Algorithm technique will we use ??
(B) Dynamic Programming
5- Which algorithm has the lowest worst-case complexity among these ??
(A) Merge Sort
(B) Selection Sort
(C) Quick Sort
(D) Bubble Sort
6- How many distinct primary keys can be created out of 4 distance keys ??
7- Consider a B-tree of order 4 and is built from scratch by 10 successive insertions. What would be the maximum number of node splitting operations that take place ??
8- A binary tree whose left subtree and right subtree differ in height by at most 1 unit is known as ??
(A) Lemma tree
(B) Red-Black tree
(C) AVL tree
(D) None of these
9- “Stack” is also known as ??
(A) First in first out
(B) Last in last out
(C) Last in first out
(D) First in last out
10- Which among these is not part of the ADT description ??
(C) Both (a) & (b)
(D) None of the above