DSA Quiz

In this DSA Quiz section – every Question Carries 2 Marks. If any question is wrong then two marks will be deducted.

Note: – Fill the information Correctly to get Certified.

DSA Quiz

1 / 50

What is a data structure?

A way to store and organize data for efficient access

A programming language

A sorting algorithm

A type of loop in programming

2 / 50

Which of the following is not a linear data structure?

Array

Linked List

Stack

Binary Tree

3 / 50

What is the time complexity of accessing an element in an array?

O(1)

O(log n)

O(n)

O(n^2)

4 / 50

Which data structure uses Last In First Out (LIFO) principle?

Queue

Stack

Linked List

Binary Search Tree

5 / 50

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

Merge Sort

Quick Sort

Bubble Sort

Heap Sort

6 / 50

What is the time complexity of inserting an element into the beginning of an array with n elements?

O(1)

O(log n)

O(n)

O(n^2)

7 / 50

Which data structure is best suited for implementing a LIFO (Last In First Out) order?

Queue

Linked List

Stack

Heap

8 / 50

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

Array

Stack

Queue

Binary Tree

9 / 50

What is the purpose of a hash table?

To sort elements in ascending order

To efficiently search, insert, and delete elements

To perform recursive operations

To create a binary search tree

10 / 50

Which of the following traversal methods is used to visit all the nodes of a binary tree in order (Left, Root, Right)?

Preorder

Inorder

Postorder

Level order

11 / 50

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

O(1)

O(log n)

O(n)

O(n^2)

12 / 50

Which sorting algorithm works by repeatedly dividing the array into halves?

Quick Sort

Bubble Sort

Merge Sort

Selection Sort

13 / 50

What is the main advantage of using a linked list over an array?

Linked lists have better cache locality

Linked lists use less memory

Linked lists support constant-time access to any element

Linked lists can easily grow and shrink in size

14 / 50

Which of the following is a FIFO (First In First Out) data structure?

Stack

Queue

Heap

Binary Search Tree

15 / 50

What is the purpose of the "dequeue" operation in a queue data structure?

Remove the last element from the queue

Remove the first element from the queue

Add an element to the front of the queue

Add an element to the end of the queue

16 / 50

Which of the following is a comparison-based sorting algorithm?

Radix Sort

Counting Sort

Quick Sort

Bucket Sort

17 / 50

Which data structure is typically used to implement undo functionality in text editors?

Queue

Stack

Linked List

Tree

18 / 50

What is the time complexity of the worst-case scenario for sorting an array using Quick Sort?

O(n)

O(log n)

O(n^2)

O(n log n)

19 / 50

Which of the following is NOT a type of tree data structure?

Binary Tree

AVL Tree

Stack

B-Tree

20 / 50

What is the purpose of dynamic programming in algorithm design?

To optimize the use of memory

To solve problems by breaking them down into simpler subproblems

To generate random solutions to problems

To perform parallel processing

21 / 50

Which data structure is used to implement priority queues?

Stack

Queue

Heap

Linked List

22 / 50

What is the main advantage of using a hash table for data storage?

Constant-time search, insert, and delete operations

Efficient sorting of elements

Minimal memory usage

Easy implementation of recursive algorithms

23 / 50

What is the time complexity of the worst-case scenario for searching an element in a hash table?

O(1)

O(log n)

O(n)

O(n^2)

24 / 50

Which of the following is a characteristic of a binary search tree (BST)?

Each node can have more than two children

The left subtree of a node contains only nodes with values greater than the node's value

The right subtree of a node contains only nodes with values less than the node's value

The tree is always perfectly balanced

25 / 50

Which sorting algorithm has the best worst-case time complexity among the following?

Bubble Sort

Insertion Sort

Merge Sort

Selection Sort

26 / 50

What is the purpose of the "binary search" algorithm?

To sort elements in ascending order

To search for an element in a sorted array in O(log n) time

To reverse the order of elements in an array

To remove duplicate elements from an array

27 / 50

Which of the following data structures is used to represent hierarchical relationships between elements?

Array

Stack

Linked List

Tree

28 / 50

What is the time complexity of the worst-case scenario for inserting an element into a max heap?

O(1)

O(log n)

O(n)

O(n log n)

29 / 50

What is the purpose of the "Dijkstra's algorithm"?

To find the shortest path in a weighted graph

To perform sorting of elements

To traverse all nodes in a tree

To search for an element in an array

30 / 50

Which of the following is NOT a fundamental operation of a stack data structure?

Push

Pop

Delete

Peek

31 / 50

What is the main purpose of the "Bellman-Ford algorithm"?

To find the shortest path in an unweighted graph

To perform sorting of elements

To find the maximum flow in a network

To find the shortest path in a weighted graph with negative edge weights

32 / 50

Which of the following data structures allows rapid search, insert, and delete operations and maintains a sorted order of elements?

Stack

Queue

Heap

Binary Search Tree

33 / 50

What is the main advantage of using a heap data structure over a binary search tree (BST)?

Heap has better cache locality

Heap supports constant-time search operations

Heap always maintains a balanced structure

Heap supports efficient extraction of the minimum (or maximum) element

34 / 50

Which of the following is NOT a type of graph traversal algorithm?

Breadth-First Search (BFS)

Depth-First Search (DFS)

Dijkstra's Algorithm

Kruskal's Algorithm

35 / 50

Which of the following is a common application of a priority queue?

Solving maze puzzles

Implementing undo operations in text editors

Storing data in a sorted manner

Representing hierarchical relationships

36 / 50

What is the time complexity of the worst-case scenario for searching an element in an AVL tree?

O(1)

O(log n)

O(n)

O(n^2)

37 / 50

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

Prim's Algorithm

Kruskal's Algorithm

Tarjan's Algorithm

Floyd-Warshall Algorithm

38 / 50

What is the time complexity of the worst-case scenario for merging two sorted arrays of sizes m and n using a merge operation?

O(m)

O(n)

O(m + n)

O(m * n)

39 / 50

Which of the following is NOT a valid application of a binary search algorithm?

Searching for a word in a dictionary

Finding the square root of a number

Checking if an array is sorted

Determining the longest increasing subsequence in an array

40 / 50

Which of the following algorithms is used to find the minimum spanning tree (MST) of a weighted graph?

Dijkstra's Algorithm

Bellman-Ford Algorithm

Prim's Algorithm

Depth-First Search (DFS)

41 / 50

What is the main advantage of using a trie data structure?

It supports efficient sorting of elements

It allows rapid search, insert, and delete operations on strings

It is a self-balancing tree structure

It efficiently represents hierarchical relationships

42 / 50

Which of the following is NOT a typical use case for a depth-first search (DFS) algorithm?

Finding connected components in a graph

Detecting cycles in a graph

Computing the shortest path in a weighted graph

Generating mazes

43 / 50

What is the purpose of the "topological sorting" algorithm?

To determine the maximum flow in a network

To sort elements of a graph in topological order

To find the shortest path in a weighted graph

To compute the strongly connected components of a graph

44 / 50

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

Prim's Algorithm

Kruskal's Algorithm

Dijkstra's Algorithm

Ford-Fulkerson Algorithm

45 / 50

Which of the following is a characteristic of a balanced binary search tree (BST)?

It always has a constant height

It guarantees O(1) time complexity for search operations

It maintains a balanced structure to ensure O(log n) time complexity for operations

It allows duplicates to be stored in the tree

46 / 50

What is the purpose of the "Kruskal's algorithm"?

To find the shortest path in a weighted graph

To find the maximum flow in a network

To find the minimum spanning tree (MST) of a weighted graph

To compute the strongly connected components of a graph

47 / 50

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

Linked List

Heap

Binary Search Tree (BST)

Union-Find Data Structure

48 / 50

What is the main advantage of using the quicksort algorithm over other sorting algorithms?

It has a worst-case time complexity of O(n^2)

It is an in-place sorting algorithm with good average-case performance

It is stable and guarantees O(n log n) time complexity in all cases

It uses divide-and-conquer strategy to sort elements

49 / 50

Which of the following is NOT a characteristic of a min-heap data structure?

The root node always contains the minimum element

The heap property is maintained at every node (parent is less than or equal to its children)

It is a complete binary tree

It is always a balanced binary search tree

50 / 50

Which algorithm is used for finding the shortest path in a weighted graph with positive edge weights?

Dijkstra's Algorithm

Bellman-Ford Algorithm

Floyd-Warshall Algorithm

Prim's Algorithm

Your score is

The average score is 0%

Leave a Comment Cancel Reply

Digital College Library

Master Menu

Digital College Library