1. A single tree with three or more elements can meet all of the criteria for both a Binary Search Tree and a Heap.

a.

True

b.

False

2. All trees are graphs.

a.

True

b.

False

3. A complete undirected graph with 5 vertices has 10 edges.

a.

True

b.

False

4. Which of the sorts below, if any, execute in better than O(N2) time in general, i.e. in the absence of any special state of the data prior to the start of sorting? Note: N is the number of items to be sorted.

a.	Insertion sort

b.	Bubble sort

c.	Merge sort

d.	Selection sort

5. Which, if any, of the techniques below are used in a selection sort, bubble sort and an insertion sort? That is, which techniques are used in all three sorts.

a.

swapping

b.	use of additional memory

c.

recursion

6. When testing a sorting algorithm, it is important to vary the size or amount of the test data. It is also important to vary the original order of the data, i.e., the order of the test data at the start of the test. Which of the following, if any, should be considered for the original order of the test data?

a.	almost sorted

b.	all identical elements

c.	random order

d.	reverse order