Data Structures: Types, Operations, and Applications

Question 1

Which of the following is NOT an advantage of using a stack data structure?

Accepted Answer

Stacks can dynamically allocate memory as needed.

Answer

Efficient addition and removal of elements from the top of the stack.

Answer

Elements are accessed in Last-in-First-out (LIFO) order.

Question 2

Which data structure allows for efficient addition and removal of elements from both the beginning and end of the collection?

Accepted Answer

Queue

Answer

Array

Answer

Stack

Question 3

Which data structure is optimal for efficiently storing and retrieving a collection of unique elements in sorted order?

Accepted Answer

Binary Search Tree

Answer

Hash Table

Answer

Array

Answer

Singly Linked List

Question 4

What is the time complexity of searching an element in a balanced Binary Search Tree?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n^2)

Answer

O(1)

Question 5

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

Accepted Answer

Heap

Answer

Array

Answer

Linked List

Answer

Standard Queue

Question 6

What is the primary purpose of a hash function?

Accepted Answer

To map a key to a unique integer value within a predefined range.

Answer

To compress data for efficient storage.

Answer

To sort a list of elements in ascending order.

Question 7

Which of the following is not a recognized type of tree data structure?

Accepted Answer

Circular Tree

Answer

B-Tree

Answer

AVL Tree

Answer

Red-Black Tree

Question 8

Which operation is not supported by a graph data structure?

Accepted Answer

Merge

Answer

Delete

Answer

Insert

Question 9

Which data structure is ideal for storing elements in a specific order, enabling efficient insertion and deletion at the start or end of the list?

Accepted Answer

Linked list

Answer

Array

Answer

Stack

Question 10

Which data structure allows you to access elements only at the beginning or the end, following the First-In-First-Out (FIFO) principle?

Accepted Answer

Queue

Answer

Array

Answer

Stack

Answer

Linked list

Question 11

In an introductory computer science course, which of these is NOT considered a fundamental data structure?

Accepted Answer

Tuple

Answer

Array

Answer

Hash table

Answer

Queue

Question 12

Which data structure follows the Last In, First Out (LIFO) principle, where the last element added is the first one to be removed?

Accepted Answer

Stack

Answer

Linked List

Answer

Array

Answer

Queue

Question 13

What type of data structure is designed to represent a hierarchical tree structure, where each node can have multiple children?

Accepted Answer

Tree

Answer

Array

Answer

Queue

Answer

Graph

Question 14

Which data structure is used to implement a priority queue, where elements are ordered based on their priority and the element with the highest priority is retrieved first?

Accepted Answer

Heap

Answer

List

Answer

Queue

Answer

Stack

Question 15

Which data structure allows efficient insertion and deletion of elements at the end, making it suitable for scenarios where elements need to be processed in a First In, First Out (FIFO) manner?

Accepted Answer

Queue

Answer

Tree

Answer

Linked List

Answer

Stack

Question 16

Which of the following operations is not commonly performed on a data structure?

Accepted Answer

Transposition

Answer

Deletion

Answer

Insertion

Answer

Searching

Question 17

What type of data structure represents a collection of unique elements without any specific order, where membership of an element can be efficiently determined?

Accepted Answer

Set

Answer

List

Answer

Graph

Answer

Queue

Question 18

Which data structure is most suitable for representing a social network, where users are connected to each other and the relationships between them need to be efficiently tracked?

Accepted Answer

Graph

Answer

Stack

Answer

Tree

Answer

Array

Question 19

What type of data structure stores elements in pairs, where each pair consists of a key and a corresponding value, allowing efficient lookup based on either the key or the value?

Accepted Answer

Dictionary

Answer

List

Answer

Queue

Answer

Set

Question 20

Which data structure represents a sequence of elements with a beginning and an end, where new elements can be added to the end and existing elements can be removed from the beginning?

Accepted Answer

Queue

Answer

Stack

Answer

Tree

Answer

Graph

Question 21

Which data structure is most suitable for storing a collection of unique values and enabling fast retrieval based on a key?

Accepted Answer

Hash table

Answer

Array

Answer

Linked list

Answer

Binary search tree

Question 22

Examine the following C++ code: struct Node { int data; Node* next; }; Node* head; Which data structure is being implemented here?

Accepted Answer

Linked list

Answer

Binary tree

Answer

Array

Answer

Hash table

Question 23

Which of the following operations are supported by a stack data structure?

Accepted Answer

Push and pop

Answer

Sort and merge

Answer

Search and traverse

Answer

Insert and delete at arbitrary positions

Question 24

A queue data structure can be implemented using which of the following?

Accepted Answer

Linked list or array

Answer

Priority queue

Answer

Hash table

Answer

Binary search tree

Question 25

Which data structure is appropriate for representing hierarchical relationships, characterized by a single root node and multiple child nodes?

Accepted Answer

Tree

Answer

Graph

Answer

Linked list

Answer

Array

Question 26

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

Accepted Answer

O(log n)

Answer

O(n^2)

Answer

O(1)

Answer

O(n)

Question 27

Which sorting algorithm has a time complexity of O(n^2)?

Accepted Answer

Bubble sort

Answer

Merge sort

Answer

Heap sort

Answer

Quick sort

Question 28

What is the primary purpose of using a priority queue data structure?

Accepted Answer

To retrieve elements based on their assigned priorities

Answer

To implement a linked list

Answer

To store a fixed number of elements

Answer

To efficiently search for elements

Question 29

Consider the following Java code: interface Shape { double getArea(); } What is the intended purpose of this interface?

Accepted Answer

To establish a contract for classes representing shapes

Answer

To create a new data structure

Answer

To implement the Shape class

Question 30

Which of the following is not a fundamental operation on a data structure?

Accepted Answer

Concatenation

Answer

Traversal

Answer

Insertion

Question 31

Which data structure is optimal for storing unique elements in sorted order?

Accepted Answer

Binary search tree

Answer

Array

Answer

Hash table

Answer

Linked list

Question 32

What is the time complexity of searching for an element in an unsorted array?

Accepted Answer

O(n)

Answer

O(n^2)

Answer

O(1)

Answer

O(log n)

Question 33

What is the primary purpose of a hash function in a hash table?

Accepted Answer

To map keys to unique indices

Answer

To compress data for storage

Answer

To sort elements in the table

Answer

To resolve collisions

Question 34

Which of the following is not a recognized graph type?

Accepted Answer

Undirected linear graph

Answer

Complete graph

Answer

Directed acyclic graph

Answer

Weighted graph

Question 35

What is the time complexity of performing depth-first search on a binary tree to visit all nodes?

Accepted Answer

O(n)

Answer

O(n^2)

Answer

O(log n)

Question 36

Which data structure is most appropriate for storing a collection of unique items in an ordered manner?

Accepted Answer

Sorted array

Answer

Queue

Answer

Hash table

Question 37

Which data structure is used to implement a priority queue?

Accepted Answer

Heap

Answer

Hash table

Answer

Linked list

Answer

Queue

Question 38

Which data structure is used to represent a set of nodes connected by edges?

Accepted Answer

Graph

Answer

Linked list

Answer

Array

Question 39

Which data structure is used to implement a last-in, first-out (LIFO) data structure?

Accepted Answer

Stack

Answer

Queue

Answer

LinkedList

Answer

Hash Table

Question 40

Which of the following is a key characteristic of an array data structure?

Accepted Answer

Fixed size

Answer

Non-linear structure

Answer

Dynamic size

Answer

Can store multiple data types

Question 41

Which data structure is a linear collection of elements that can be accessed sequentially?

Accepted Answer

Array

Answer

Tree

Answer

Graph

Answer

Stack

Question 42

What is the time complexity of searching for an element in an unsorted linked list?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n^2)

Question 43

Which data structure allows efficient insertion and deletion of elements at the end?

Accepted Answer

Queue

Answer

Array

Answer

Stack

Answer

Linked List

Question 44

What is a binary tree?

Accepted Answer

A tree data structure in which each node has at most two child nodes.

Answer

A linear data structure used to store elements in a specific order.

Answer

A graph data structure consisting of vertices and edges.

Question 45

Which sorting algorithm has a time complexity of O(n log n) in the best case?

Accepted Answer

Merge Sort

Answer

Insertion Sort

Answer

Selection Sort

Answer

Bubble Sort

Question 46

Which data structure is used to represent a collection of unique elements without duplicates?

Accepted Answer

Set

Answer

List

Answer

Queue

Answer

Map

Question 47

What is the purpose of a hash function in a hash table?

Accepted Answer

To map keys to a fixed-size array index.

Answer

To store the values associated with keys.

Answer

To sort the keys in ascending order.

Question 48

Which data structure is used to store a collection of key-value pairs?

Accepted Answer

Map

Answer

Array

Answer

Set

Answer

Queue

Question 49

What is the primary advantage of using a balanced binary search tree over a regular binary search tree?

Accepted Answer

Improved search and insertion/deletion efficiency due to balanced height.

Answer

Smaller memory footprint.

Answer

Faster traversal operations.

Question 50

Which data structure is a non-linear collection of data elements where each element can have multiple child elements?

Accepted Answer

Tree

Answer

Queue

Answer

Array

Question 51

What is the time complexity for searching an element in an unsorted array of size n?

Accepted Answer

O(n)

Answer

O(log n)

Answer

O(1)

Question 52

Which data structure can be used to efficiently implement a priority queue?

Accepted Answer

Heap

Answer

Queue

Answer

Tree

Answer

Stack

Question 53

What is the difference between a stack and a queue?

Accepted Answer

A stack follows a LIFO (Last In First Out) order while a queue follows a FIFO (First In First Out) order.

Answer

A stack is a non-linear structure while a queue is a linear structure.

Question 54

Which of the following is NOT a binary tree traversal technique?

Accepted Answer

Depth-first Depth-first

Answer

Pre-order

Answer

Post-order

Answer

In-order

Question 55

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

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Question 56

What is the purpose of a hash function in a hash table?

Accepted Answer

To convert a key into a unique index within the hash table.

Answer

To search for an element in the hash table.

Answer

To store the value associated with a key.

Question 57

Which of the following is an advantage of using a self-balancing binary search tree?

Accepted Answer

Improved search and insertion performance compared to a regular binary search tree.

Answer

Less memory usage than a regular binary search tree.

Answer

Easier to implement than a regular binary search tree.