DSA Trivia Rapid Fire

Q1 What data structure uses a Last-In-First-Out (LIFO) order?

• Queue

• Stack

• Linked List

• Heap

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

• Quick Sort

• Merge Sort

• Bubble Sort

  
  

• Insertion Sort

What is the primary purpose of a hash table (hash map)?

• Sorting data

• Searching for data

• Storing data in a balanced tree structure

• Quickly retrieving data based on a key

Which data structure is used to represent a hierarchical relationship between elements?

• Stack

• Queue

• Graph

• Heap

In the context of linked lists, what is a "doubly linked list"?

• A list where each node has a reference to the previous and next nodes.

• A list where each node has a reference to its parent node.

• A list where nodes can be accessed by by parent and child nodes

• A list where each node contains two values.

What is the time complexity of finding an element in a binary search tree (BST) with n nodes in the worst-case scenario?

• O(N)

• O(logN)

• O(NlogN)

• O(1)

Which algorithm is used to find the shortest path in a weighted graph?

• BFS

• DFS

• Dijkstra's

• A* Search

What data structure is typically used to implement a queue in computer science?

• Linked List

• Stack

• array

• tree

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

• Preorder

• Postorder

• Centerorder

• Inorder

In which situation is a dynamic array (e.g., ArrayList in Java) more efficient than a standard array?

• When the size of the array is fixed.

• when you frequently insert or remove elements from the array.

• When you need a contiguous block of memory.

• when you only need to access elements by index.