CMSC 341 questions with verified answers
A binary tree in which every external node is at the same level and all external
nodes are filled in left to right is called a ... Ans✓✓✓-Complete Binary Tree
A full binary tree is a tree in which every node has zero or two children. True or
False? Ans✓✓✓-True
A hash function converts the data part of a (key-data) pair to an index number to
find the storage location. True or False? Ans✓✓✓-False, because a hash function
is used to transform a key into the index of an array element where the
corresponding value is to be sought.
A hash table data structure is an implementation of the Map ADT ... True or False?
Ans✓✓✓-True
A hash table provides efficient operations (search, insert, remove) when sorting
the data is required. True or False? Ans✓✓✓-False
A hash table with quadratic probing guarantees finding an empty bucket in the
table. True or False? Ans✓✓✓-False
ADT Stands For .... Ans✓✓✓-Abstract Data Type
An ADT is the implementation of a data structure. True or False? Ans✓✓✓-False.
Abstract Data Types are the interface class or data models with no
implementation.
, An algorithm with the running time of O(2n) practically is able to run and process
the large amount of data. True or False? Ans✓✓✓-False
Does the following tree represent a valid max-leftist-heap? Please note, in this
tree the alphabet characters represent the priority. For example, "A" shows the
lowest priority.
G
/\
FD
//\
EBC
/
A Ans✓✓✓-NO, because the leftist tree has to follow binary tree properties
Finding a specific node takes the same amount of time whether we use a singly
linked list or a doubly linked list to store the same data. True or False? Ans✓✓✓-
True
Generally, the Queue ADT provides "First In Last Out" data storage. True or False?
Ans✓✓✓-False
Generally, the stack ADT provides "First In First Out" data storage. True or False?
Ans✓✓✓-False. stack ADT provides "Last In First Out" data storage
How do we deallocate memory for the following variable?
A binary tree in which every external node is at the same level and all external
nodes are filled in left to right is called a ... Ans✓✓✓-Complete Binary Tree
A full binary tree is a tree in which every node has zero or two children. True or
False? Ans✓✓✓-True
A hash function converts the data part of a (key-data) pair to an index number to
find the storage location. True or False? Ans✓✓✓-False, because a hash function
is used to transform a key into the index of an array element where the
corresponding value is to be sought.
A hash table data structure is an implementation of the Map ADT ... True or False?
Ans✓✓✓-True
A hash table provides efficient operations (search, insert, remove) when sorting
the data is required. True or False? Ans✓✓✓-False
A hash table with quadratic probing guarantees finding an empty bucket in the
table. True or False? Ans✓✓✓-False
ADT Stands For .... Ans✓✓✓-Abstract Data Type
An ADT is the implementation of a data structure. True or False? Ans✓✓✓-False.
Abstract Data Types are the interface class or data models with no
implementation.
, An algorithm with the running time of O(2n) practically is able to run and process
the large amount of data. True or False? Ans✓✓✓-False
Does the following tree represent a valid max-leftist-heap? Please note, in this
tree the alphabet characters represent the priority. For example, "A" shows the
lowest priority.
G
/\
FD
//\
EBC
/
A Ans✓✓✓-NO, because the leftist tree has to follow binary tree properties
Finding a specific node takes the same amount of time whether we use a singly
linked list or a doubly linked list to store the same data. True or False? Ans✓✓✓-
True
Generally, the Queue ADT provides "First In Last Out" data storage. True or False?
Ans✓✓✓-False
Generally, the stack ADT provides "First In First Out" data storage. True or False?
Ans✓✓✓-False. stack ADT provides "Last In First Out" data storage
How do we deallocate memory for the following variable?
