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.

0%

DSA Test 1

1 / 15

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

2 / 15

Which data structure is used to implement recursion?

3 / 15

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

4 / 15

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

5 / 15

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

6 / 15

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

7 / 15

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

8 / 15

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

9 / 15

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

10 / 15

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

11 / 15

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

12 / 15

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

13 / 15

Which data structure is used to implement a hash table?

14 / 15

Which data structure is used to implement recursion?

15 / 15

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

Your score is

The average score is 41%

0%

0%

DSA Test 2

1 / 15

What is the time complexity of the binary search algorithm?

2 / 15

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

3 / 15

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

4 / 15

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

5 / 15

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

6 / 15

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

7 / 15

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

8 / 15

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

9 / 15

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

10 / 15

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

11 / 15

Which data structure is used to implement a priority queue?

12 / 15

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

13 / 15

Which of the following is not a search algorithm?

14 / 15

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

15 / 15

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

Your score is

The average score is 50%

0%

0%

DSA Test 3

1 / 15

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

2 / 15

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

3 / 15

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

4 / 15

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

5 / 15

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

6 / 15

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

7 / 15

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

8 / 15

Which of the following is not a type of graph?

9 / 15

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

10 / 15

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

11 / 15

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

12 / 15

What is the time complexity of binary search algorithm?

13 / 15

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

14 / 15

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

15 / 15

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

Your score is

The average score is 69%

0%

0%

DSA Test 4

1 / 15

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

2 / 15

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

3 / 15

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

4 / 15

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

5 / 15

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

6 / 15

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

7 / 15

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

8 / 15

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

9 / 15

Which of the following sorting algorithms is stable?

10 / 15

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

11 / 15

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

12 / 15

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

13 / 15

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

14 / 15

Which data structure uses FIFO ordering?

15 / 15

Which of the following data structures uses LIFO ordering?

Your score is

The average score is 55%

0%

0%

DSA Test 5

1 / 15

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

2 / 15

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

3 / 15

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

4 / 15

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

5 / 15

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

6 / 15

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

7 / 15

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

8 / 15

Which data structure is used to implement a FIFO queue?

9 / 15

Which data structure is used to implement a LIFO stack?

10 / 15

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

11 / 15

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

12 / 15

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

13 / 15

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

14 / 15

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

15 / 15

What is the time complexity of binary search algorithm?

Your score is

The average score is 48%

0%

Get up to 100% Scholarship to get Package up to 40 LPA Register Now
+ +