- Data Structures & Algorithms
- DSA - Home
- DSA - Overview
- DSA - Environment Setup
- DSA - Algorithms Basics
- DSA - Asymptotic Analysis
- Data Structures
- DSA - Data Structure Basics
- DSA - Data Structures and Types
- DSA - Array Data Structure
- Linked Lists
- DSA - Linked List Data Structure
- DSA - Doubly Linked List Data Structure
- DSA - Circular Linked List Data Structure
- Stack & Queue
- DSA - Stack Data Structure
- DSA - Expression Parsing
- DSA - Queue Data Structure
- Searching Algorithms
- DSA - Searching Algorithms
- DSA - Linear Search Algorithm
- DSA - Binary Search Algorithm
- DSA - Interpolation Search
- DSA - Jump Search Algorithm
- DSA - Exponential Search
- DSA - Fibonacci Search
- DSA - Sublist Search
- DSA - Hash Table
- Sorting Algorithms
- DSA - Sorting Algorithms
- DSA - Bubble Sort Algorithm
- DSA - Insertion Sort Algorithm
- DSA - Selection Sort Algorithm
- DSA - Merge Sort Algorithm
- DSA - Shell Sort Algorithm
- DSA - Heap Sort
- DSA - Bucket Sort Algorithm
- DSA - Counting Sort Algorithm
- DSA - Radix Sort Algorithm
- DSA - Quick Sort Algorithm
- Graph Data Structure
- DSA - Graph Data Structure
- DSA - Depth First Traversal
- DSA - Breadth First Traversal
- DSA - Spanning Tree
- Tree Data Structure
- DSA - Tree Data Structure
- DSA - Tree Traversal
- DSA - Binary Search Tree
- DSA - AVL Tree
- DSA - Red Black Trees
- DSA - B Trees
- DSA - B+ Trees
- DSA - Splay Trees
- DSA - Tries
- DSA - Heap Data Structure
- Recursion
- DSA - Recursion Algorithms
- DSA - Tower of Hanoi Using Recursion
- DSA - Fibonacci Series Using Recursion
- Divide and Conquer
- DSA - Divide and Conquer
- DSA - Max-Min Problem
- DSA - Strassen's Matrix Multiplication
- DSA - Karatsuba Algorithm
- Greedy Algorithms
- DSA - Greedy Algorithms
- DSA - Travelling Salesman Problem (Greedy Approach)
- DSA - Prim's Minimal Spanning Tree
- DSA - Kruskal's Minimal Spanning Tree
- DSA - Dijkstra's Shortest Path Algorithm
- DSA - Map Colouring Algorithm
- DSA - Fractional Knapsack Problem
- DSA - Job Sequencing with Deadline
- DSA - Optimal Merge Pattern Algorithm
- Dynamic Programming
- DSA - Dynamic Programming
- DSA - Matrix Chain Multiplication
- DSA - Floyd Warshall Algorithm
- DSA - 0-1 Knapsack Problem
- DSA - Longest Common Subsequence Algorithm
- DSA - Travelling Salesman Problem (Dynamic Approach)
- Approximation Algorithms
- DSA - Approximation Algorithms
- DSA - Vertex Cover Algorithm
- DSA - Set Cover Problem
- DSA - Travelling Salesman Problem (Approximation Approach)
- Randomized Algorithms
- DSA - Randomized Algorithms
- DSA - Randomized Quick Sort Algorithm
- DSA - Karger’s Minimum Cut Algorithm
- DSA - Fisher-Yates Shuffle Algorithm
- DSA Useful Resources
- DSA - Questions and Answers
- DSA - Quick Guide
- DSA - Useful Resources
- DSA - Discussion
Data Structures Algorithms Mock Test
This section presents you various set of Mock Tests related to Data Structures Algorithms. You can download these sample mock tests at your local machine and solve offline at your convenience. Every mock test is supplied with a mock test key to let you verify the final score and grade yourself.
Data Structures Algorithms Mock Test I
Q 1 - What is the worst case time complexity of linear search algorithm?
Answer : D
Explanation
Linear search scans sequentially to find the target value. The best case is Ο(1) and average and worst case is Ο(n). Worst case is when data is not in the list, and it has to scan all n elements.
Q 2 - What is the worst case run-time complexity of binary search algorithm?
Answer : D
Explanation
In the worst case, binary search will be left or right intended, making it compare all the n values.
Q 3 - Which of the following usees FIFO method
Answer : A
Explanation
Queue maintains two pointers − front and rear. In queue data structure, the item inserted first will always be removed first, hence FIFO!
Q 4 - A complete graph can have
Answer : B
Explanation
At maximum, a complete graph can have nn - 1 spanning trees.
Q 5 - Which one of the below is not divide and conquer approach?
Answer : B
Explanation
Among the options, only Merge sort divides the list in sub-list, sorts and then merges them together
Q 6 - Prefix notation is alsow known as
Answer : D
Explanation
Polish Notation
Q 7 - In order traversal of binary search tree will produce −
Answer : C
Explanation
Binary search tree yields a sorted list when traversed in-order.
Q 8 - In a min-heap:
A - parent nodes have values greater than or equal to their childs
B - parent nodes have values less than or equal to their childs
Answer : A
Explanation
In a min heap, parents always have lesser or equal values than that of their childs.
Q 9 - A procedure that calls itself is called
Answer : C
Explanation
In recursion, a procedure calls itself, either directly or by calling a procedure which in turn calls it.
Q 10 - For a binary search algorithm to work, it is necessary that the array (list) must be
Answer : A
Explanation
As binary search divides the list and selects a the sub-list to extend search based on comparison of values, it becomes necessary that the array (list) must be in sorted form.
Answer : C
Explanation
Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.
Answer : B
Explanation
In queue, data item inserted first, will be available first and data item inserted last will be available in the last. FIFO stands for First In First Out and is a correct answer.
Q 13 - Maximum number of nodes in a binary tree with height k, where root is height 0, is
Answer : B
Explanation
If the root node is at height 0, then a binary tree can have at max 2k+1 − 1 nodes.
For example: a binary tree of height 1, can have maximum 21+1 − 1 = 3 nodes.
r --------- 0 / \ L R --------- 1
Q 14 - Which one of the below mentioned is linear data structure −
Answer : D
Explanation
All mentioned data structures are linear in nature.
Q 15 - What data structure is used for depth first traversal of a graph?
Answer : B
Explanation
Stack is used for depth first traversal whereas queue is used for breadth first traversal
Q 16 - What data structure is used for breadth first traversal of a graph?
Answer : A
Explanation
Queue is used for breadth first traversal whereas stack is used for depth first traversal.
Q 17 - What data structure can be used to check if a syntax has balanced paranthesis ?
Answer : D
Explanation
Stack uses LIFO method which is good for checking matching paranthesis.
Answer : B
Explanation
Expression notations are not reverse (or so) of each other, rather operators used in the expression have different arrangements.
Q 19 - Stack is used for
Answer : C
Explanation
Recursive procedures use stacks to execute the result of last executed procedural call.
Q 20 - A circular linked list can be used for
Answer : C
Explanation
Both stack and queue data structure can be represented by circular linked-list.
Answer : A
Explanation
A linked-list is dynamic structure, it can shrink and expand as required by the program.
Q 22 - Minimum number of moves required to solve a Tower of Hanoi puzzle is
Answer : C
Explanation
Minimum number of moves required to solve a Tower of Hanoi puzzle is 2n - 1. Where n is the number of disks. If the number of disks is 3, then minimum number of moves required are 23 - 1 = 7
Q 23 - Which of the following is an example of dynamic programming approach?
Answer : D
Explanation
All mentioned use dynamic programming approach. Before solving the in-hand sub-problem, dynamic algorithm will try to examine the results of previously solved sub-problems. The solutions of sub-problems are combined in order to achieve the best solution.
Q 24 - The following formula will produce
Fn = Fn-1 + Fn-2
Answer : B
Explanation
Fibonacci Series generates subsequent number by adding two previous numbers.
Answer : D
Explanation
Minimum number of queues required for priority queue implementation is two. One for storing actual data and one for storing priorities.
Answer Sheet
| Question Number | Answer Key |
|---|---|
| 1 | D |
| 2 | D |
| 3 | A |
| 4 | B |
| 5 | B |
| 6 | D |
| 7 | C |
| 8 | A |
| 9 | C |
| 10 | A |
| 11 | C |
| 12 | B |
| 13 | B |
| 14 | D |
| 15 | B |
| 16 | A |
| 17 | D |
| 18 | B |
| 19 | C |
| 20 | C |
| 21 | A |
| 22 | C |
| 23 | D |
| 24 | B |
| 25 | D |