Home

Schedule

Assignments

Grading

Goal

We will study:

1. Practice implementing selected algorithms to deepen understanding of the algorithms (implementation details using data structures)
2. Improving programming proficiency
3. Feel free to use codes given for previous lab assignments

Option #1

Implement the dynamic programming solution to midterm lab, and compare the performance (running time) of the three different solutions (using similar method as used in lab1 and lab2). Here is solution to midterm lab.

Option #2

Implement Dijkstra algorithm for shortest distance paths using graph lab as your starting point.

Option #3

Implement one of the two minimal spaning tree algorithms using graph lab as your starting point.

Option #4

Implement the longest common subsuquence algorithm as studied in class, and extend it to return the subsequence itself (in addition to the length).

Submission

Please submit each source files, class specficiation file (header file) and implemenetation file (.cpp file), and driver program using the script given. For example,

submit4080 EXTRA Graph.cpp
...