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) (2-2-3)
On successful completion of this course, the student will:
The above course description and goals were taken from the official course description.
General Course Policies
Please review the general course policies webpage.
* I would like to have lunch with you individually or as a group to get to know you better. If we eat in RWJ, housing will pick up my lunch bill. If you would prefer to eat elsewhere, we will each be responsible for our own bill. Feel free to suggest another time if the time above does not work for you.
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="286taylorPSPL1.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 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:
|© 2001-2003 Dr. Christopher C. Taylor||Office: CC-27C||Phone: 277-7339||Last Updated: Mon Mar 10 09:59:01 2003|
|I am responsible for all content posted on these pages; MSOE is welcome to share these opinions but may not want to.|