Need help with this questions, would appreciate the help.

1) A graph that has a path between every pair of distinct vertices is called a

	a.	connected graph
	b.	complete graph
	c.	both a and b
	d.	none of these

2 )When deleting from a B-Tree, if the node deleted from has less data than the minimum and the sibling cannot be borrowed from then we must:

	a.	join the node with the parent and sibling
	b.	split the node
	c.	then we cannot delete the data
	d.	none of these

3) Adjacent vertices are called neighbors.

True

False

4) In an unweighted graph, the shortest path between two given vertices has __________.

	a.	the longest length
	b.	the smallest length
	c.	the smallest edge value sum
	d.	none of these

5) Which graph traversal visits a vertex, then a neighbor of the vertex, a neighbor of the neighbor, and so on, advancing as far as possible from the original vertex?

	a.	breadth first
	b.	level order
	c.	cyclic order
	d.	depth first

6) A path that begins and ends at the same vertex is called a(n) ________.

	a.	cycle
	b.	simple path
	c.	circle path
	d.	acyclic path

7) The vertices in a graph may only have one topological order

True/False?

8) In a weighted graph, the shortest path between two given vertices has __________.

	a.	the largest edge-weight sum
	b.	none of these
	c.	the smallest edge-weight sum
	d.	the shortest path length

9) A topological order is not possible for a graph that has a cycle. (T/F)?

10) When deleting from a Red-Black tree, if the node which is deleted results in the creation of a double black node whose sibling is a black node but has a red child, we are dealing with which case?

	a.	case 1
	b.	case 4
	c.	case 3
	d.	case 2