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 graph algorithm that uses a heap as one of its primary data
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 maintains the color invariant during an application of the blue
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 that Prim's algorithm is a special case of the general
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 that uses a heap as one of its primary data structures
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 color invariant during an application of the blue rule. Col
CS 542 Advanced Data Structures and Algorithms 541 Algorithms and Programs
ProblemSolutions Exam 3 Set 2 Solutions
Jonathan Turner
Exam 2 - 10/28/03 12/6/05
1. (10 points) The figure below represents one of the trees in a dynamic trees data structure. Sho
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 algorithm is a special case of the general greedy meth
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 trees in a dynamic trees data structure. Show the under
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 structure with several "virtual trees." Show the correspondi
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 next to the nodes are the key values. The ranks are not sh
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 structure with several virtual trees. Show the corresponding
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 parent v causes a cascading cut at v if v has already
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 nodes are the key values. The ranks are not shown. Show
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 this form of the problem, the length of a path is the
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 between a vertex u and its parent v causes a cascading cu
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 of the problem, the length of a path is the product of
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 below. Fill in all the missing entries.
firstedge
a
5
b 3
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 in all the missing entries.
firstedge
a
5
b 3 c d 9 e f
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 missing fields for the adjacency lists. Insert the edg
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 Kruskal's algorithm is a special case of the general gr
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 fields for the adjacency lists. Insert the edges into th
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 algorithm is a special case of the general greedy method