Data Structures and Algorithms Quiz - BATCH 1

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

• Queue

• Stack

• Linked List

• Tree

Answer explanation

The data structure that uses the Last In First Out (LIFO) principle is a Stack.

Which sorting algorithm is based on the divide and conquer strategy?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Selection Sort

Answer explanation

Merge Sort is based on the divide and conquer strategy, where the array is divided into two halves, sorted separately, and then merged back together.

In which data structure can elements be added or removed from both ends efficiently?

• Stack

• Queue

• Deque

• Array

Answer explanation

In a Deque, elements can be added or removed from both ends efficiently, making it the correct choice for this scenario.

Which data structure is ideal for implementing recursion?

• Queue

• Stack

• Linked List

• Binary Tree

Answer explanation

Stack is ideal for implementing recursion because it follows Last In First Out (LIFO) order, which is essential for managing function calls in a recursive manner.

Which data structure is used in Breadth-First Search (BFS)?

• Stack

• Queue

• Priority Queue

• Linked List

Answer explanation

BFS uses a Queue data structure to traverse nodes level by level, ensuring that nodes are visited in the order they were added.

What is the primary purpose of a hash table?

• Sorting elements

• Storing elements with a unique key

• Implementing a priority queue

• Graph traversal

Answer explanation

The primary purpose of a hash table is storing elements with a unique key, allowing for efficient retrieval and storage based on key-value pairs.

Which of the following is a linear data structure?

• Tree

• Graph

• Linked List

• Trie

Answer explanation

The correct choice is Linked List because it is a linear data structure where elements are stored in a sequential manner.

In a binary tree, which traversal method processes nodes in the order: left subtree, root, right subtree?

• Preorder

• Inorder

• Postorder

• Level order

Answer explanation

Inorder traversal processes nodes in the order: left subtree, root, right subtree, matching the given order.

Which data structure is used to implement depth-first search (DFS) in a graph?

• Stack

• Queue

• Priority Queue

• Hash Table

Answer explanation

The correct data structure used to implement depth-first search (DFS) in a graph is a Stack.

Which of the following is used to represent hierarchical data?

• Stack

• Queue

• Tree

• Graph

Answer explanation

The correct choice to represent hierarchical data is a Tree. Trees are used to organize data in a hierarchical structure with parent-child relationships.