Data Structures and algorithms

C++ Programming Test

Data Structures and Algorithms

Free Data Structures and Algorithms Mock Test: Placement

Practice the free Online Data Structures and Algorithms Test- DSA to get success in future placement. This online mock test will help you in the time of final placements.

General Instructions:

1. Each DSA test contains 15 questions.
2. Total allotted time is 20 minutes for each test.
3. No negative marking.
4. Try to finish it on time.
5. The Test will be submitted automatically if the time expired.
6. Don’t refresh the page.

Time is Over

DSA Test 1

1 / 15

Which of the following algorithms is used to find the strongly connected components in a directed graph?

A) Depth-First Search

B) Breadth-First Search

C) Dijkstra's Algorithm

D) Bellman-Ford Algorithm

2 / 15

Which data structure is used to implement recursion?

A) Stack

B) Queue

C) Deque

D) Binary Tree Answer:

3 / 15

Which of the following is an example of a non-linear data structure?

A) Stack

B) Queue

C) Array

D) Tree

4 / 15

Which of the following data structures is used to implement a min-heap?

A) Array

B) Linked List

C) Binary Search Tree

D) Hash Table

5 / 15

Which of the following algorithms is used to find the maximum subarray sum in an array?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Kadane's Algorithm

6 / 15

Which of the following data structures is used to implement a binary heap?

A) Array

B) Linked List

C) Hash Table

D) All of the above

7 / 15

Which of the following data structures is used to implement a Trie?

A) Array

B) Linked List

C) Tree

D) Heap

8 / 15

Which of the following is not a type of hash function collision resolution technique?

A) Linear Probing

B) Chaining

C) Double Hashing

D) Breadth-First Search

9 / 15

Which of the following algorithms is used to find the shortest path in a graph with non-negative edge weights?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Prim's Algorithm

10 / 15

Which of the following sorting algorithms has the best-case time complexity of O(n)?

A) Bubble Sort

B) Quick Sort

C) Merge Sort

D) Insertion Sort

11 / 15

Which of the following data structures is used to implement a hash table?

A) Array

B) Linked List

C) Binary Search Tree

D) All of the above

12 / 15

Which of the following sorting algorithms has the worst-case time complexity of O(n^2)?

A) Bubble Sort

B) Quick Sort

C) Merge Sort

D) Insertion Sort

13 / 15

Which data structure is used to implement a hash table?

A) Stack

B) Queue

C) Linked List

D) Array Solution

14 / 15

Which data structure is used to implement recursion?

A) Stack

B) Queue

C) Linked List

D) Tree Solution

15 / 15

Which data structure allows you to access elements in constant time?

A) Linked List

B) Queue

C) Stack

D) Array Solution

Your score is

The average score is 41%

LinkedIn Facebook Twitter

Time is Over

DSA Test 2

1 / 15

What is the time complexity of the binary search algorithm?

A) O(1)

B) O(n)

C) O(log n)

D) O(n log n)

2 / 15

Which data structure uses the “First In First Out” (FIFO) principle?

A) Stack

B) Queue

C) Deque

D) Binary Tree

3 / 15

Which of the following sorting algorithms has the best-case time complexity of O(n log n)?

A) Bubble Sort

B) Quick Sort

C) Merge Sort

D) Insertion Sort

4 / 15

Which of the following data structures is used to implement a balanced binary search tree?

A) Array

B) Linked List

C) Hash Table

D) Red-Black Tree

5 / 15

Which of the following algorithms is used to find the shortest path in a graph with non-negative edge weights?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Prim's Algorithm

6 / 15

Which of the following algorithms is used to perform topological sorting on a directed acyclic graph?

A) Depth-First Search

B) Breadth-First Search

C) Dijkstra's Algorithm

D) Kahn's Algorithm

7 / 15

Which of the following algorithms is used to find the maximum sum subarray of a given array?

A) Binary Search

B) Kadane's Algorithm

C) Dijkstra's Algorithm

D) Prim's Algorithm

8 / 15

What is the time complexity of the worst case scenario for searching an element in a binary search tree?

A) O(log n)

B) O(n)

C) O(n log n)

D) O(n^2)

9 / 15

Which of the following algorithms is used to find the minimum spanning tree in a graph?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Prim's Algorithm

10 / 15

Which of the following algorithms is used to find the shortest path in a graph with negative edge weights?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Prim's Algorithm

11 / 15

Which data structure is used to implement a priority queue?

A) Array

B) Linked List

C) Heap

D) Stack

12 / 15

What is the time complexity of the best case scenario for merge sort algorithm?

A) O(n)

B) O(n^2)

C) O(log n)

D) O(n log n)

13 / 15

Which of the following is not a search algorithm?

A) Depth First Search

B) Breadth First Search

C) Binary Search

D) Quick Sort Solution

14 / 15

What is the time complexity of the best case scenario for selection sort algorithm?

A) O(n)

B) O(n^2)

C) O(log n)

D) O(1)

15 / 15

Which of the following data structures uses a heap data structure internally?

A) Priority Queue

B) Stack

C) Queue

D) Deque

Your score is

The average score is 50%

LinkedIn Facebook Twitter

Time is Over

DSA Test 3

1 / 15

Which of the following data structures is NOT a linear data structure?

A) Stack

B) Queue

C) Linked List

D) Tree

2 / 15

Which of the following data structures uses a Last In First Out (LIFO) principle?

A) Stack

B) Queue

C) Deque

D) Tree

3 / 15

In which data structure does the insertion and deletion of elements happen from the same end?

A) Stack

B) Queue

C) Deque

D) Linked List

4 / 15

Which of the following algorithms is used to find the shortest path in a graph with non-negative edge weights?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Prim's Algorithm

5 / 15

Which of the following algorithms is used to find the longest common subsequence between two strings?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Longest Common

6 / 15

Which of the following data structures can be used to implement a set?

A) Array

B) Linked List

C) Table

D) All of the above

7 / 15

Which of the following is not a type of hash function?

A) Division method

B) Multiplication method

C) Mid-square method

D) Quicksort method

8 / 15

Which of the following is not a type of graph?

A) Directed graph

B) Undirected graph

C) Connected graph

D) Weighted graph

9 / 15

Which of the following is not a type of tree traversal?

A) Inorder

B) Outorder

C) Preorder

D) Postorder

10 / 15

Which of the following data structures is used to implement a deque?

A) Array

B) Linked List

C) Both of the above

D) None of the above

11 / 15

What is the time complexity of insertion operation in a binary search tree?

A) O(n)

B) O(log n)

C) O(n^2)

D) O(2^n)

12 / 15

What is the time complexity of binary search algorithm?

A) O(n)

B) O(log n)

C) O(n^2)

D) O(2^n)

13 / 15

Which of the following is an example of a linear data structure?

A) Binary Tree

B) Graph

C) Array

D) Heap Solution

14 / 15

Which sorting algorithm has the best case time complexity of O(n)?

A) Merge Sort

B) Quick Sort

C) Bubble Sort

D) Insertion Sort Solution

15 / 15

Which sorting algorithm has the worst case time complexity of O(n^2)?

A) Merge Sort

B) Quick Sort

C) Bubble Sort

D) Insertion Sort Solution

Your score is

The average score is 68%

LinkedIn Facebook Twitter

Time is Over

DSA Test 4

1 / 15

Which of the following algorithms is used to find the shortest path between two nodes in a graph?

A) Dijkstra's Algorithm

B) Binary Search

C) Merge Sort

D) Bubble Sort Answer

2 / 15

Which of the following data structures allows efficient searching, insertion, and deletion operations?

A) Array

B) Linked List

C) Binary Tree

D) All of the above Answer

3 / 15

Which of the following is NOT a type of sorting algorithm?

A) Selection Sort

B) Merge Sort

C) Bubble Sort

D) Hash Sort

4 / 15

Which of the following data structures is used to implement a hash set?

A) Array

B) Linked List

C) Binary Search Tree

D) Hash Table

5 / 15

Which of the following data structures is used to implement a trie?

A) Array

B) Linked List

C) Hash Table

D) All of the above

6 / 15

What is the worst-case time complexity of the selection sort algorithm?

A) O(n)

B) O(n log n)

C) O(n^2)

D) O(2^n)

7 / 15

Which of the following data structures is used to implement a min-heap?

A) Array

B) Linked List

C) Tree

D) Hash Table

8 / 15

Which of the following data structures is used to implement a disjoint-set data structure?

A) Array

B) Linked List

C) Heap

D) Tree

9 / 15

Which of the following sorting algorithms is stable?

A) Quick Sort

B) Heap Sort

C) Merge Sort

D) Radix Sort

10 / 15

Which of the following algorithms is used to find the maximum flow in a network flow problem?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Ford-Fulkerson Algorithm

11 / 15

Which of the following traversal methods is used to visit all the nodes of a binary tree in level order?

A) Inorder

B) Preorder

C) Postorder

D) Breadth-First Search

12 / 15

Which of the following data structures is used to implement a queue?

A) Array

B) Linked List

C) Both of the above

D) None of the above

13 / 15

Which data structure is used for breadth-first traversal of a graph?

A) Queue

B) Stack

C) Linked List

D) Tree Solution

14 / 15

Which data structure uses FIFO ordering?

A) Queue

B) Stack

C) Linked List

D) Tree Solution

15 / 15

Which of the following data structures uses LIFO ordering?

A) Queue

B) Stack

C) Linked List

D) Tree Solution

Your score is

The average score is 54%

LinkedIn Facebook Twitter

Time is Over

DSA Test 5

1 / 15

Which of the following is NOT a type of tree traversal?

A) Breadth-First

B) Depth-First

C) Pre-Order

D) Post-Orde

2 / 15

Which of the following sorting algorithms has the worst time complexity?

A) Bubble Sort

B) Insertion Sort

C) Selection Sort

D) Quick Sort Answer

3 / 15

Which data structure allows you to access elements from both ends in O(1) time?

A) Stack

B) Queue

C) Deque

D) Binary Tree

4 / 15

Which of the following data structures is used to implement a disjoint-set data structure?

A) Array

B) Linked List

C) Hash Table

D) Union-Find Data Structure

5 / 15

What is the worst-case time complexity of the bubble sort algorithm?

A) O(n)

B) O(n log n)

C) O(n^2)

D) O(2^n)

6 / 15

Which of the following data structures is used to implement a binary search?

A) Array

B) Linked List

C) Hash Table

D) Stack

7 / 15

Which of the following algorithms is used to find the articulation points in a graph?

A) Dijkstra's Algorithm

B) Bellman-Ford Algorithm

C) Kruskal's Algorithm

D) Tarjan's Algorithm

8 / 15

Which data structure is used to implement a FIFO queue?

A) Array

B) Linked List

C) Stack

D) Heap

9 / 15

Which data structure is used to implement a LIFO stack?

A) Array

B) Linked List

C) Queue

D) Heap

10 / 15

Which of the following sorting algorithms is an in-place sorting algorithm?

A) Merge Sort

B) Quick Sort

C) Insertion Sort

D) All of the above

11 / 15

Which of the following data structures can be used to implement a graph?

A) Array

B) Linked List

C) Both of the above

D) None of the above

12 / 15

Which of the following data structures can be used to implement a stack?

A) Array

B) Linked List

C) Both of the above

D) None of the above

13 / 15

What is the time complexity of the worst-case scenario for binary search tree operations?

A) O(1)

B) O(n)

C) O(log n)

D) O(n^2)

14 / 15

What is the time complexity of the worst-case scenario for quick sort algorithm?

A) O(n)

B) O(n^2)

C) O(log n)

D) O(n log n)

15 / 15

What is the time complexity of binary search algorithm?

A) O(1)

B) O(n)

C) O(log n)

D) O(n^2)

Your score is

The average score is 46%

LinkedIn Facebook Twitter

Click here for Other Mock Tests