This course extends the study of algorithms introduced in CS-285. Topics include searching, sorting, selection, graph structures, and traversal algorithms. Applications such as dynamic memory management, data compression, optimization problems, and database indexing are also discussed. Laboratory activities include the implementation and comparison of problem-specific algorithms, as well as the use of generic algorithms from the C++ standard library. (prereq: CS-285, SE-280, MA-230) (3-2-4)

Objectives

On successful completion of this course, the student will:

- Be able to use generic algorithms from the STL and implement additional generic algorithms.
- Be able to apply asymptotic time complexity analysis to choose among competing algorithms.
- Understand how sorting algorithms such as heapsort and quicksort work.
- Understand how graph and tree structures are implemented.
- Be familiar with engineering applications for many of the fundamental algorithms discussed in the course.
- Be familiar with dynamic programming.

The above course description and goals were taken from the official course description.

General Course Policies

Please review the general course policies webpage.

Textbook

*Introduction to Algorithms e/2*, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, MIT Press and McGraw-Hill, 2001. (errata list)

PSP

You will be required to complete the PSP spreadsheet for each lab assignment. The spreadsheet filename should begin with your MSOE login. In addition, you should make a hyper-link to the spreadsheet from within your report. This can be done with the following line:

<a href="385taylorPSPL1.xls">PSP data for lab 1</a>A zip archive containing the spreadsheet and your report (and any additional files) should be created and submitted using the submission webpage

Homework

Homework assignments will be given throughout the quarter. You are encouraged to work on the homework in groups, but you should not turn in any solutions that you do not understand completely (I may quiz you on what you submit). At least 25% of the midterm and final will be problems from the homework or directly related to homework problems.

Each problem will be graded on the following scale:

- -3 points: substantially incorrect
- 0 points: minor mistakes, unorganized, or unclear
- 3 points: Clearly presented and correct

My Schedule

Time | Mon | Tue | Wed | Thu | Fri |
---|---|---|---|---|---|

9:00 | Office Hours by Appointment* |
Office Hours by Appointment* |
Office Hours by Appointment* |
Office Hours by Appointment* |
Program Director |

10:00 | |||||

11:00 | |||||

12:00 | CS2852 Planning |
SDsgn Gameboy |
PD Mtg | ||

1:00 | Dept Mtg | SDsgn ABET |
Program Director |
||

2:00 | Program Director |
SDsgn DroneBlock |
SDsgn Brewery |
||

3:00 | Program Director |
Program Director |

Please send me a calendar invite in Outlook if you would like to meet during my office hours. We can meet via a Teams Meeting.

Grading

Lab projects: | 50% |

Midterm: | 25% |

Final exam: | 25% |

Total: | 100% |

© 2001-2006 Dr. Christopher C. Taylor | Office: CC-36C | Phone: 277-7339 |