Data Structures and Algorithms Quiz

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

• Stack

• Linked List

• Array

• All of the above

What is the time complexity to search an element in a balanced binary search tree?

• O(n)

• O(log n)

• O(n log n)

• O(1)

In which of the following data structures is the insertion of data elements done at one end, called the rear, and deletion is done from the other end, called the front?

• Stack

• Queue

• Linked List

• Array

Which traversal technique of binary trees ensures the nodes are processed in ascending order for a Binary Search Tree (BST)?

• Preorder

• Inorder

• Postorder

• Level-order

Which data structure is used in recursion?

• Queue

• Stack

• Tree

• Graph

The time complexity for inserting an element in an array at the beginning is:

• O(1)

• O(log n)

• O(n)

• O(n^2)

In a max-heap, the value of the root node is:

• Less than its child nodes

• Greater than or equal to its child nodes

• Equal to its child nodes

• None of the above

What is the minimum number of nodes in a complete binary tree with height h?

• 2^h

• 2^(h+1) - 1

• 2^(h-1)

• h+1

What is the best case time complexity of a quicksort algorithm?

• O(n log n)

• O(n^2)

• O(n)

• O(log n)

A circular queue is full when:

• front == rear

• front = rear + 1

• rear = front + 1

• None of the above