Q1 · Lists
Data Structures and Algorithms (DSA) MCQs
Data Structures and Algorithms (DSA) Full Question Bank
Tap an option, see immediate feedback, retry the wrong ones, and review the final correct answers at the end.
Questions
60
Answered
0
Score
0%
Continue answering
Not answered
Q2 · Linked List
General collection of nodes is called
Q3 · Queue
What is the overflow condition in a queue?
Q4 · Recursion
What is the number of disk movement in TOH with 4 disks?
Q5 · Sorting
Which of the following sorting algorithm has a best time complexity of O(n log n)?
Q6 · Sorting
Which of the following sorting algorithm is based on divide and conquer algorithm?
Q7 · Hashing
Which of the following collision resolution technique can create secondary clustering?
Q8 · Algorithms
Which type of algorithm benefits from the reusability of code?
Q9 · Searching
Which of the following searching algorithms has a time complexity of O(log n)?
Q10 · Hashing
Which of the following techniques in hashing has the clustering problem?
Q11 · Sorting
What is the Big-Oh of best case complexity of insertion sort?
Q12 · Queue
How does the rear index incremented in circular queue?
Q13 · Stack
What is the value of the postfix expression 6 3 2 4 + - * ?
Q14 · Trees
In which of the following types of tree, the right most node of the right tree must contain the largest element of the tree?
Q15 · Algorithms
Which of the following types of algorithm can solve the problem faster than the classic methods?
Q16 · Graph Traversal
Which data structure is used for DFS on graph?
Q17 · Stack
What is the condition for stack underflow?
Q18 · Stack
The result of evaluating the postfix expression 5 4 6 + 493/+ is?
Q19 · Linked List
Which of the following application makes use of a circular linked list?
Q20 · Recursion
What is the Minimum number of moves required to solve a Tower of Hanoi puzzle?
Q21 · Heap
Which of the following heap trees contains nodes with values smaller or equal to the value in the parent node?
Q22 · Trees
If there are n nodes in a binary tree, what will be the minimum height of the binary tree?
Q23 · Sorting
What is the worst-case time complexity of quicksort?
Q24 · Linked List
A variation of linked list in which none of the nodes contain NULL pointer is
Q25 · Graph
Which of the following data structure is used in depth first search of graph?
Q26 · Sorting
A stable sorting algorithm—
Q27 · Sorting
The worst-case time complexity of bubble sort is
Q28 · Hashing
A technique for direct search is
Q29 · Graph Traversal
The methods of graph traversal are
Q30 · Stack
What is the prefix for the postfix expression 'ABC*+'?
Q31 · Trees
In which of the following type of the tree, all leaves lie at the same level of the tree?
Q32 · Sorting
Which of the following sorting algorithm is unstable?
Q33 · Trees
What is a complete binary tree?
Q34 · Linked List
In linked list implementation, a node carries information regarding ......
Q35 · Stack
Which data structure is required to convert the infix to prefix notation?
Q36 · Trees
B-tree of order n is a order-n multiway tree in which non-root node contains
Q37 · Hashing
Which of the following is not a hash function?
Q38 · Linked List
In circular linked list, insertion of node requires modification of
Q39 · Graph
The size of incidence matrix of a graph is represented as
Q40 · Sorting
What is the maximum number of swaps that can be performed in the Selection Sort algorithm?
Q41 · Stack
Which of the following is the result of evaluation of 5 7 4 - * 8 4 / +?
Q42 · Trees
What is the recursive formula for post order traversal of binary tree?
Q43 · Recursion
What is the space complexity of the recursion implementation to find the factorial of a number?
Q44 · Trees
In a full binary tree, if there are L leaves, then the total number of nodes N is
Q45 · Sorting
What do you call the selected keys in the quick sort method?
Q46 · Trees
Which of the following is true for B-Tree of order M?
Q47 · Data Structure
Which of the following is a dynamic data structure?
Q48 · Graph
In which category does Dijkstra's algorithm belong?
Q49 · Algorithms
What is the measurement for time complexity of an algorithm?
Q50 · Queue
Which one of the following is the overflow condition if a circular queue is implemented using array having size MAX?
Q51 · Sorting
What is an internal sorting algorithm?
Q52 · Sorting
Which of the following is the worst-case scenario for the quicksort algorithm?
Q53 · Linked List
Which of the following types of the linked list contains two pointers in a node?
Q54 · Stack
What is the postfix of the expression A + B * C / D?
Q55 · Trees
For a tree with n nodes, what will be the number of edges?
Q56 · Graph
What is the number of edges present in a complete graph having n vertices?
Q57 · Stack
The postfix form of A*B+C/D is?
Q58 · Data Structures
Which of the following data structures are indexed structures?
Q59 · Stack
Which of the following is an application of stack?
Q60 · Queue