CMPT 306 Algorithms & Data Structures Fall 2013
Homework #2
80 Total Points
Due Date: Wednesday, October 2, 2013. You may either hand it in or submit an electronic
version to Canvas.
Be sure to show all supporting work to receive full credit.
1. (3 points

CMPT 306 Algorithms & Data Structures Fall 2013
Homework #6
15 Total Points
Due Date: In class 5:30 pm, Monday, December 9, 2013.
Be sure to show all supporting work to receive full credit.
1. (15 points) The network shown in Figure ? illustrates the ow f

CMPT 306 Algorithms & Data Structures
Fall 2013
Homework #1
50 Total Points
Due Date: In class Wednesday, September 4, 2013.
SOLUTIONS
1. (4 points) Consider the following problem: Design an algorithm to determine the best
route for a subway passenger to

CMPT 306 Algorithms & Data Structures Fall 2013
Homework #2
80 Total Points
Due Date: Wednesday, October 2, 2013. You may either hand it in or submit an electronic
version to Canvas.
Be sure to show all supporting work to receive full credit.
Solutions
1.

CMPT 306 Algorithms & Data Structures Fall 2013
Homework #3
20 Total Points
Due Date: 4:30
PM,
Wednesday, November 6, 2013.
Be sure to show all supporting work to receive full credit.
1. (6 points) Which of the following are
AVL
trees?
Figure 1: AVL trees

CMPT 306 Algorithms & Data Structures Fall 2013
Homework #4
20 Total Points
Due Date: 4:30
PM,
Wednesday, November 13, 2013.
Be sure to show all supporting work to receive full credit.
To answer the following questions, you will need to download the sourc

CMPT 306 Algorithms & Data Structures
Fall 2013
Homework #1
50 Total Points
Due Date: In class Wednesday, September 4, 2013.
1. (4 points) Consider the following problem: Design an algorithm to determine the best
route for a subway passenger to take from