b.
0
One component of a hash table is the header.
False
Given the data below, what position in the array HON will occupy?
HON, BRO,VON,ABE, GHI
b.
4
Collision resolution wherein the number of failed attempts will be squared when deciding how far along from point of the original collision to look next.
d.
Quadratic Probing
The collision resolution is trying the place along and if necessary the next and so on until an empty slot is eventually found
d.
Linear probling
In closed addressing, when address produced by hash function h(k)has no more space for insertion, an empty slot other than h(k) in hash table is located.
False
Keys in a hash table are also called addresses
True
Hash table is data structure that allows very quick retrieval of data regardless of how much data there is.
True
Chaining seems disadvantageous if the size of the entries are large
False
By using one dimensional array, Max can be represented.
True
A stores a collection of elements with their _______________ at its nodes and satisfies _________ additional properties
a.
associated keys, two
In min , the value of node is ________ or equal to the parent value.
b.
greater than
The two operations of are insert element and delete element.
True
Min isthe values of its children must be less than or equal of the value of a node.
True
When creating a max , you need to transform the _____ into a __________
c., max
A should form anincomplete binary tree.
False
Then we create another node, we apply the top to _____ then _____ to right.
a.
bottom, left
Max isthe value of a node must be less than or greater to the values of its children.
False
When we create another node, we apply the top to bottom then left to right
True
When deleting element from a you first need to remove the root node.
True
Based on the property of a , we can classify heaps into four types.
False
What type of is this example?
a.
max
To build a , create a new node at the end of the then assign the first value of the data element into the node
True
In a Max , the _______ node is always greater than or equal to its _____ nodes.
a.
parent, child
The basic requirement of a is that the value of a node must be ≥ (or ≤) than the values of its children; what does it called?
d.
property
When deleting element from a you first need to:
a.
Remove root node
A is a tree with some special properties.
TrueWhen we create another node, we apply the top to left then right to bottom.False
The two operations on are _______ element and _____ element.
d.
insert, delete
Adjacency matrix is a way to represent .
True
The following are applications of Graphexcept for one.
a.
Deck of cards in a table.
A Self loop is an edge that connects a vertex to its own self.
True
A ________________ is a graph with all of the edges are present in every vertex.
c.
Complete Graph
A Graph is connected if there is a path from every vertex to another vertex.
True\
Twitter and Instagram friend feature are examples of Undirected Graph
False
Facebook friend feature is an example of a Directed Graph.
False
The time complexity of DFS would be O(V+E) where in V is vertices and the E is the edges
True
The process of returning from the "dead-end" in the Depth First Search Algorithm is called Backtracking.
True
The level-order traversal of the trees was actually inspired from Breadth First Search Algorithm
True
Which of the following is the time complexity of Breadth First Search when using adjacency matrix to represent the graph?
a.
O(V^2)
What do you call a vertex that has been processed or traversed in a graph?
c.
Visited
Depth Forst Search algorithm works like a pre-order traversal of the Tree data structure
True
The BFS has lower memory requirements than the DFS.
False
Which of the following traversal was inspired by Breadth First Search algorithm?
c.
level-order Traversal
Navigation applications such as Waze, Google Maps are examples of
True
Which of the following is the time complexity of the Breadth First Search when using adjacency list to represent the graph?
d.
O(V + E)
algo qiuz1
Start from the beginning
