practiceexam3fa07SOL

# practiceexam3fa07SOL - Practice Exam 3 Name_SOLUTIONS TA...

This preview shows pages 1–3. Sign up to view the full content.

Practice Exam 3 Name _______ SOLUTIONS _________ TA Name _________________________ Be sure to use a #2 pencil. Calculators are allowed, but cell phones or palm pilots are NOT acceptable. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) If a graph has 99 vertices, how many edges are in the minimum spanning tree? A) 98 (N-1) B) 99 C) 100 D) 9 E) Cannot be determined with the given information. 2) What is the name of the algorithm for finding the minimum spanning tree of a connected graph? A) Brute Force B) Cheapest Link C) Kruskal’s Algorithm D) Hamilton’s Method E) None of the above. Use the graph to answer questions #3 - #5. 3) Using Kruskal’s algorithm, what is the value of the edge chosen first? A) 15 B) 9 C) 2 D) 1 E) None of the above. 4) Using Kruskal’s algorithm, which of the following edges are NOT chosen? A) 6 B) 3 C) 5 D) 10 E) None of the above. 5) What is the weight of the tree resulting from Kruskal’s algorithm? A) 92 B) 36 C) 34 – 1+1+2+3+5+6+8+8 D) 41 E) None of the above.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6) Which of the following is Binet’s formula for computing the th n Fibonacci number? A) 2 ) 1 ( + n n B) 5 2 5 1 2 5 1 N N - - + C) ( 29 ! 1 - n D) ! n E) None of the above. 7) What is the th 10 Fibonacci number? A) 10 B) 55 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, … C) 34 D) 89 E) None of the above. 8)
This is the end of the preview. Sign up to access the rest of the document.

## This document was uploaded on 10/08/2008.

### Page1 / 4

practiceexam3fa07SOL - Practice Exam 3 Name_SOLUTIONS TA...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online