Q.1 Which of the following best defines a data structure?
A collection of data organized in a specific format
A programming language
A type of hardware device
A software application
Explanation - A data structure is a way of organizing and storing data so that it can be accessed and modified efficiently.
Correct answer is: A collection of data organized in a specific format
Q.2 Which of the following is NOT a characteristic of data structures?
Data organization
Data operations
Memory management
Internet connectivity
Explanation - Data structures focus on organization, storage, and operations on data, not on connectivity.
Correct answer is: Internet connectivity
Q.3 Which data structure organizes data sequentially in memory?
Array
Graph
Tree
Hash Table
Explanation - Arrays store elements in contiguous memory locations, allowing sequential access.
Correct answer is: Array
Q.4 What type of data structure is used to implement recursion?
Stack
Queue
Linked List
Graph
Explanation - Stacks follow LIFO order, which matches the order of function calls and returns in recursion.
Correct answer is: Stack
Q.5 Which of these operations is NOT typically supported by a data structure?
Insertion
Deletion
Sorting
Cooking
Explanation - Data structures support operations like insertion, deletion, and traversal, not unrelated tasks like cooking.
Correct answer is: Cooking
Q.6 Which of the following is a linear data structure?
Linked List
Tree
Graph
Heap
Explanation - A linked list is linear because elements are arranged sequentially, one after another.
Correct answer is: Linked List
Q.7 Which type of data structure allows elements to be added or removed only at one end?
Stack
Queue
Array
Graph
Explanation - A stack follows Last In First Out (LIFO), allowing insertions and deletions only at the top.
Correct answer is: Stack
Q.8 Which of the following is a non-linear data structure?
Tree
Array
Queue
Stack
Explanation - Trees organize data hierarchically, making them non-linear structures.
Correct answer is: Tree
Q.9 What is the main advantage of using data structures?
Efficient data storage and retrieval
Better screen display
Faster internet connection
Automatic coding
Explanation - Data structures help in storing data efficiently and performing operations like search, insertion, and deletion quickly.
Correct answer is: Efficient data storage and retrieval
Q.10 Which data structure is used to implement a priority queue?
Heap
Array
Stack
Linked List
Explanation - A heap allows quick access to the highest (or lowest) priority element, making it ideal for priority queues.
Correct answer is: Heap
Q.11 Which of the following is used for memory-efficient insertion and deletion?
Linked List
Array
Stack
Queue
Explanation - Linked lists can efficiently insert and delete elements without shifting other elements, unlike arrays.
Correct answer is: Linked List
Q.12 Which operation does a queue follow?
FIFO (First In First Out)
LIFO (Last In First Out)
Random Access
Hierarchical Access
Explanation - A queue follows First In First Out, meaning the first element added is the first one to be removed.
Correct answer is: FIFO (First In First Out)
Q.13 Which data structure can be used to represent hierarchical data?
Tree
Array
Stack
Queue
Explanation - Trees naturally represent hierarchical relationships such as file directories.
Correct answer is: Tree
Q.14 Which data structure is best for implementing undo functionality?
Stack
Queue
Array
Graph
Explanation - Stacks are ideal for undo operations because the last operation performed is the first one to be undone.
Correct answer is: Stack
Q.15 Which of these is NOT a type of data structure?
Procedure
Array
Stack
Queue
Explanation - A procedure is a block of code, not a data structure.
Correct answer is: Procedure
Q.16 Which of the following data structures supports random access?
Array
Linked List
Stack
Queue
Explanation - Arrays allow direct access to any element via its index, unlike linked lists or stacks.
Correct answer is: Array
Q.17 What is the main difference between linear and non-linear data structures?
Linear stores sequentially, non-linear stores hierarchically
Linear uses more memory than non-linear
Non-linear is faster than linear
Linear cannot store numbers
Explanation - Linear data structures store data in sequence while non-linear structures like trees and graphs store data hierarchically.
Correct answer is: Linear stores sequentially, non-linear stores hierarchically
Q.18 Which data structure is ideal for graph traversal algorithms?
Queue
Stack
Array
Heap
Explanation - Queues are commonly used in breadth-first traversal of graphs.
Correct answer is: Queue
Q.19 Which of the following statements is true about arrays?
They store elements in contiguous memory locations
They can dynamically change size without overhead
They allow hierarchical storage of data
They follow FIFO order
Explanation - Arrays store elements in contiguous memory locations allowing direct indexing.
Correct answer is: They store elements in contiguous memory locations
Q.20 Which of the following is true about stacks?
They follow LIFO order
They follow FIFO order
They store data hierarchically
They allow random access
Explanation - Stacks follow Last In First Out (LIFO) principle, where the last inserted element is the first to be removed.
Correct answer is: They follow LIFO order