Understanding Data Structures Quiz

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

• 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

• Array

In a linked list, what is the term for the first node?

• Head

• Tail

• Root

• Leaf

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

• Stack

• Queue

• Adjacency List

• Array

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

• Faster access time

• Easier to implement

• Uses less memory

• Maintains order of elements

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

• Array

• Linked List

• Tree

• Stack

What is the time complexity of inserting an element at the beginning of a linked list?

Which data structure is used in the implementation of recursion?

• Queue

• Stack

• Tree

• Graph

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 duplicate elements

• It is implemented using a stack