DSA Quiz 4th Semster CE

What is the time complexity of inserting an element into a stack implemented using an array?

• O(1)

• O(n)

• O(log n)

• O(n^2)

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

• Stack

• Queue

• Array

• Linked List

What is the worst-case time complexity of the quicksort algorithm?

• . O(n)

• O(n log n)

• O(n^2)

• O(log n)

In a binary search tree, which traversal gives the nodes in ascending order?

• Preorder

• Inorder

• Postorder

• Level order

What is the purpose of hashing in data structures?

• Sorting elements

• Searching elements

• Inserting elements

• Deletion of elements

Which sorting algorithm has the best average-case time complexity?

• Bubble Sort

• Merge Sort

• Insertion Sort

• Selection Sort

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

• Queue

• Stack

• Linked List

• Tree

What is the primary purpose of an algorithm?

• To find errors in computer programs

• To perform repetitive tasks

• To solve a specific problem

• To manage hardware resources

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

• Array

• Linked List

• Queue

• Tree

What is the time complexity of finding an element in a binary search tree?

• O(1)

• O(log n)

• O(n)

• O(n log n)