Understanding Data Structures Quiz

Which of the following data structures uses a Last In, First Out (LIFO) method for accessing elements?

• Queue

• Stack

• Array

• Linked List

What is the time complexity of searching for an element in a balanced binary search tree?

Which data structure is best suited for implementing a priority queue?

• Stack

• Queue

• Heap

• Linked List

In a linked list, what is the time complexity of inserting an element at the beginning?

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

• Array

• Stack

• Adjacency List

• Queue

What is the main advantage of using a hash table over an array for storing data?

• Faster access time

• Easier to implement

• Uses less memory

• Maintains order of elements

Which of the following operations is not typically associated with a queue?

• Enqueue

• Dequeue

• Peek

• Pop

What is the primary characteristic of a circular queue?

• It has a fixed size

• The last position is connected back to the first position

• It allows random access

• It is implemented using a stack

Which data structure is most efficient for implementing a breadth-first search (BFS) algorithm?

• Stack

• Queue

• Tree

• Graph

In a binary tree, what is the maximum number of children a node can have?

• 1

• 2

• 3

• 4