Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Chapter: 36
Q581:
What is the worst-case height of a tree using Union by Size for n nodes?
A. n
B. log2(n)
C. n log n
D. O(1)
Correct Answer:
B
Chapter: 36
Q582:
In Union by Height, which tree becomes the root when merging two trees?
A. The tree with the greater height
B. The tree with fewer nodes
C. The tree with the lesser height
D. The tree with more nodes
Correct Answer:
A
Chapter: 36
Q583:
What is the key advantage of using Union by Size over a simple union approach?
A. It ensures that the resulting trees are balanced and shallow
B. It allows trees to be merged without comparing sizes
C. It directly affects the find operation
D. It reduces the complexity of the union operation
Correct Answer:
A
Chapter: 37
Q584:
What does the union operation do in the context of disjoint sets?
A. Links two sets
B. Finds the representative of a set
C. Splits a set into smaller sets
D. Merges two trees into one set
Correct Answer:
A
Chapter: 37
Q585:
In image segmentation, what does a pixel value of 255 represent?
A. Black
B. White
C. Gray
D. Red
Correct Answer:
B
Chapter: 37
Q586:
Which algorithm is used for maze generation as per the content?
A. Depth-First Search
B. Union-Find
C. Prim's Algorithm
D. Dijkstra's Algorithm
Correct Answer:
B
Chapter: 37
Q587:
What is the primary purpose of path optimization in the find method of disjoint sets?
A. To increase tree size
B. To reduce tree traversal time
C. To improve union operation
D. To split trees efficiently
Correct Answer:
B
Chapter: 37
Q588:
When using a threshold of 4 for binary image conversion, which value is replaced by 1?
A. Values less than 4
B. Values equal to 4
C. Values more than 4
D. All values between 0 and 4
Correct Answer:
C
Chapter: 37
Q589:
In the pseudo code for maze generation, what operation is performed when two cells are already in the same set?
A. Remove the wall between them
B. Do nothing
C. Add a new wall between them
D. Combine the cells into one set
Correct Answer:
B
Chapter: 38
Q590:
What is a Table ADT primarily used to represent?
A. Single dimension data
B. Two-dimensional data
C. Graphs and trees
D. Unordered lists
Correct Answer:
B
Chapter: 38
Q591:
In a table, what is the term used for a collection of rows?
A. Fields
B. Records
C. Columns
D. Entries
Correct Answer:
B
Chapter: 38
Q592:
Which data structure is used for implementing a table where entries are stored consecutively?
A. Sorted Sequential Array
B. Unsorted Sequential Array
C. Hash Table
D. Binary Search Tree
Correct Answer:
B
Chapter: 38
Q593:
What is the primary purpose of the key in a table?
A. To organize data into categories
B. To uniquely identify each record
C. To perform mathematical operations
D. To link multiple tables together
Correct Answer:
B
Chapter: 38
Q594:
What method is used to add a new record to a table in an unsorted sequential array?
A. Remove
B. Find
C. Insert
D. Sort
Correct Answer:
C
Chapter: 38
Q595:
Which method in Table ADT is used to retrieve a record based on its key?
A. Insert
B. Find
C. Remove
D. Update
Correct Answer:
B
Chapter: 38
Q596:
In a sorted sequential array, what operation is performed to maintain order when inserting a new record?
A. Binary Search
B. Sorting
C. Shuffling
D. Linear Search
Correct Answer:
B
Chapter: 38
Q597:
What is the time complexity of the find operation in a sorted sequential array using binary search?
A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)
Correct Answer:
C
Chapter: 38
Q598:
When deleting a record from a sorted sequential array, what additional step is needed?
A. Only remove the record
B. Re-sort the array
C. Find the record and shift elements
D. No additional steps needed
Correct Answer:
C
Chapter: 38
Q599:
In the context of Table ADT, what is a "key"?
A. A unique identifier for data records
B. A placeholder for data
C. A method to sort data
D. A temporary storage location
Correct Answer:
A
Chapter: 38
Q600:
What is a typical use of a table in a compiler?
A. Storing function names only
B. Keeping track of variable declarations
C. Managing memory allocation
D. Storing all strings in the program
Correct Answer:
B