Data Structures and Algorithms Finals
Data Structures and Algorithms Finals
It is a node-based binary tree structure which has the left and right subtree.
binary search tree
These are a software artifacts that allows data to be stored, organized and accessed.
Data structures
All nodes have two children and all levels are at the same level.
perfect binary tree
It is a type of diagram that organizes and represents a set of numerical or qualitative data.
data chart
In building linked list, it needs three pointers to build: one to point to the first node in the list, one to point to the
last node and one to create the new one.
True
It is a linear data structures that can accessed, store and removed at one end.
stack
It can be used to determine the shortest path from one node in a graph to every other node.
Dijkstra’s algorithm
This linked list operation determines whether a particular item is in the list.
Search
pie chart
It is a collection of nodes wherein every node contains the address of the next node.
linked list
It is the transformation of the string characters into a usually shorter fixed-length value that represents the
original string.
hashing
It is a mathematical model for a certain class of data structure that has similar behavior.
abstract data type
It is used to compare changes over the same period of time for more than one group.
line graph
Are used to compare things between different groups or to track changes over time.
bar graphs
It is a list-like structure in which elements are removed from only one end.
stack
A data structure requires a large amount of space for each data item stores and a large amount of time to
perform a single operation and a certain amount of programming effort.
False
It contains only nodes with keys greater than the node’s key.
the right subtree
Every node other than the leaf nodes has 2 child nodes.
full binary tree
It contains only nodes with keys greater than the node’s key.
the right subtree
It is a linear data structures that can accessed, store and removed at one end.
stack
Are used to compare things between different groups or to track changes over time.
bar graphs
It can be used to determine the shortest path from one node in a graph to every other node.
Dijkstra’s algorithm
In building linked list, it needs three pointers to build: one to point to the first node in the list, one to point to the
last node and one to create the new one.
True
It is a list-like structure in which elements are removed from only one end.
stack
It is a mathematical model for a certain class of data structure that has similar behavior.
abstract data type
It is a type of diagram that organizes and represents a set of numerical or qualitative data.
data chart
It contains only nodes with keys lesser than the node’s key.
left subtree
It is used to compare changes over the same period of time for more than one group.
line graph
Every node other than the leaf nodes has 2 child nodes.
full binary tree
It is the transformation of the string characters into a usually shorter fixed-length value that represents the
original string.
hashing
It is a collection of nodes wherein every node contains the address of the next node.
linked list
It contains an element field to store an element value, and a next field to store a pointer to the next node on the
list.
Objects
All nodes have two children and all levels are at the same level.
perfect binary tree
A data structure requires a large amount of space for each data item stores and a large amount of time to
perform a single operation and a certain amount of programming effort.
False
It is a node-based binary tree structure which has the left and right subtree.
binary search tree
These are a software artifacts that allows data to be stored, organized and accessed.
Data structures
This linked list operation determines whether a particular item is in the list.
Search
It is a list of items.
linked list
It is a pair of nodes.
edge of tree
It contains an element field to store an element value, and a next field to store a pointer to the next node on
the list.
Link class
It is a collection of values.
type
It contains only nodes with keys lesser than the node’s key.
left subtree
Dijkstra’s algorithm
It is a collection of values.
data type
It is a list of items.
linked list
It is a pair of nodes.
edge of tree