Question 1

To add a new node, you need to start a process by first placing it as _______ and move it up to maintain the heap property.

Accepted Answer

A)  the last node in the heap 
B)  the new root 
C)  the right child of the root 
D)  the left child of the root A

Question 2

A ___________ of a graph is a subgraph that is a tree and connects all vertices in the graph.

Accepted Answer

A)  spanning tree 
B)  shorted path A

Question 3

Find all shortest paths starting from vertex A in the following graph.

Accepted Answer

The answer of Find all shortest paths starting from vertex...

Question 4

The ________ is to visit the left subtree of the current node first, then the current node itself, and finally the right subtree of the current node.

Accepted Answer

A)  postorder traversal 
B)  preorder traversal 
C)  inorder traversal 
D)  breadth-first traversal

Question 5

Show the inorder, preorder, and postorder of the following BST.

Accepted Answer

The answer of Show the inorder, preorder, and postorder of...

Question 6

If two vertices are connected by two or more edges, these edges are called ______.

Accepted Answer

A)  loop 
B)  parallel edge 
C)  weighted edge 
D)  directed edge

Question 7

The time complexity of the DFS algorithm is

Accepted Answer

A)  true 
B)  false

Question 8

Draw a DFS tree from the following graph starting from vertex E.

Accepted Answer

The answer of Draw a DFS tree from the following...

Question 9

Show the BST after inserting 45, 43, 100, 34, 23, and 3 into an empty BST.

Accepted Answer

The answer of Show the BST after inserting 45, 43,...

Question 10

Show the BST after deleting 60 from the following BST.

Accepted Answer

The answer of Show the BST after deleting 60 from...

Question 11

The time complexity for finding an element in a binary search tree is _________.

Accepted Answer

A)  O(logn) 
B)  O(nlogn) 
C)  O(n) 
D)  O(1)

Question 12

Draw a BFS tree from the following graph starting from vertex E.

Accepted Answer

The answer of Draw a BFS tree from the following...

Question 13

A _________ is the one in which every two pairs of vertices are connected.

Accepted Answer

A)  complete graph 
B)  weighted graph 
C)  directed graph

Question 14

Find a MST in the following graph.

Accepted Answer

The answer of Find a MST in the following graph....

Question 15

A graph may have several minimum spanning tree.

Accepted Answer