CSE 542 Algorithms and Programs CS 541 Algorithms and Programs
Final Exam Solutions Problem Set 2 Solutions
Jonathan Turner
Exam 2 - 12/22/05 10/28/03
1. (15 points) Suppose you're implementing a grap
CS 541 Algorithms and Programs
Final Exam Solutions Problem Set 2 Solutions
Jonathan Turner
Exam 2 - 12/17/03 10/28/03
1. (15 points) Show that the greedy method for the minimum spanning tree maintain
CS 541 Algorithms and Programs
Final Exam Solutions
Jonathan Turner
12/13/01
Be neat and concise, but complete. 1. (15 points) State the general greedy method for finding minimum spanning trees. Show
CSE 542 Algorithms and Programs CS 541 Algorithms and Programs
Problem ExamSolutions Final Set 2
Jonathan Turner
Exam 2 - 12/22/05 10/28/03
1. (15 points) Suppose you're implementing a graph algorithm
CS 541 Algorithms and Programs
Problem Set 2 Solutions Final Exam
Jonathan Turner
Exam 2 - 12/17/03 10/28/03
1. (15 points) Show that the greedy method for the minimum spanning tree maintains the colo
CS 541 Algorithms and Programs
Final Exam
Jonathan Turner
12/13/01
Be neat and concise, but complete. 1. (15 points) State the general greedy method for finding minimum spanning trees. Show that Prims
CS 542 Advanced Data Structures and Algorithms 541 Algorithms and Programs
Problem Set32 Solutions Exam
Jonathan Turner
Exam 2 - 10/28/03 12/6/05
1. (10 points) The figure below represents one of the
CS 541 Algorithms and Programs
ProblemSolutions Exam 3 Set 2 Solutions
Jonathan Turner
Exam 2 - 12/4/03 10/28/03
1. (10 points) The figure below shows an implementation of the dynamic trees data struc
CS 542 Advanced Data Structures and Algorithms
Exam 2 Solutions
Jonathan Turner
11/1/05
Be neat and concise, but complete. 1. (5 points) The figure below shows a single Fibonacci heap. The numbers nex
CS 541 Algorithms and Programs
ProblemSolutions Exam 3 Set 2 Solutions
Jonathan Turner
Exam 2 - 12/4/03 10/28/03
1. (10 points) The figure below shows an implementation of the dynamic trees data struc
CS 541 Algorithms and Programs
ProblemSolutions Exam 2 Set 2 Solutions
Jonathan Turner
Exam 2 - 10/28/03 10/28/03
1. (15 points) In the Fibonacci heaps data structure, a cut between a vertex u and its
CS 542 Advanced Data Structures and Algorithms
Exam 2
Jonathan Turner
11/1/05
Be neat and concise, but complete. 1. (5 points) The figure below shows a single Fibonacci heap. The numbers next to the n
CS 541 Algorithms and Programs
Exam 2 Solutions
Jonathan Turner
11/8/01
Be neat and concise, but complete. 1. (10 points). Consider a version of the shortest path problem with multiplicative costs. In
CS 541 Algorithms and Programs
Problem Set22 Solutions Exam
Jonathan Turner
Exam 2 - 10/28/03 10/28/03
Be neat and concise, but complete. 1. (15 points) In the Fibonacci heaps data structure, a cut be
CS 541 Algorithms and Programs
Exam 2
Jonathan Turner
11/8/01
Be neat and concise, but complete. 1. (10 points). Consider a version of the shortest path problem with multiplicative costs. In this form
CS 542 Advanced Data Structures and Algorithms
Exam 1 Solutions
Jonathan Turner
9/29/05
Be neat and concise, but complete. 1. (5 points) An incomplete instance of the wgraph data structure is shown be
CS 542 Advanced Data Structures and Algorithms
Exam 1
Jonathan Turner
9/29/05
Be neat and concise, but complete. 1. (5 points) An incomplete instance of the wgraph data structure is shown below. Fill
CS 541 Algorithms and Programs
Exam 1 Solutions
Jonathan Turner
9/25/03
Be neat and concise, but complete. 1. (5 points) An incomplete instance of the wgraph data structure is shown below. Fill in the
CS 541 Algorithms and Programs
Exam 1 Solutions
Jonathan Turner
10/4/01
Be neat and concise, but complete. 1. (15 points) State the general greedy method for finding minimum spanning trees. Show that
CS 541 Algorithms and Programs
Exam 1
Jonathan Turner
9/25/03
Be neat and concise, but complete. 1. (5 points) An incomplete instance of the wgraph data structure is shown below. Fill in the missing f
CS 541 Algorithms and Programs
Exam 1
Jonathan Turner
10/4/01
Be neat and concise, but complete. 1. (15 points) State the general greedy method for finding minimum spanning trees. Show that Kruskals a