This course extends the study of algorithms introduced in CS-2851. Topics covered include searching, sorting, selection, graph structures, traversal algorithms, and P/NP complete problems. Applications such as data compression, optimization problems and database indexing are also discussed. Laboratory activities include the implementation and comparison of problem-specific algorithms. (prereq: CS-2851, SE-280, MA-230) (3-2-4)

Upon successful completion of this course, the student will:

- apply asymptotic time complexity analysis to choose among competing algorithms.
- construct and solve recurrence equations describing the asymptotic time complexity of a given algorithm.
- implement sorting algorithms such as heapsort and quicksort.
- describe how graph and tree structures are implemented.
- describe similarities and differences between breadth-first and depth-first search techniques.
- compare and contrast at least two minimum spanning tree alogrithms.
- identify the use of dynamic programming techniques in algorithmic design.
- describe the implications of demonstrating that a particular algorithm is NP complete.
- list at least three engineering applications of algorithmic design and analysis.

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

Please review the general course policies webpage.

*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)

Each student will be responsible for a 10 minute oral presentation of an algorithm or concept related to this course. The topic should be unique and not covered in class. A one paragraph abstract identifying the topic is due by the end of week 5. Presentations will be scheduled for week 10. Students are advised to take this assignment seriously as it is worth more than a lab grade. A typical student should plan to allocate 0.5-2 hours selecting a topic, 4 hours researching the topic, 4 hours developing a presentation, and 1 hour practicing.

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

Unless stated otherwise, all laboratory assignments will be completed in teams of two. One lab report should be submitted for each team. All Lab assignments are worth 50 points per week (i.e., a two week lab assignment is worth 100 points).

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

8:00 | SE1010-2L CC49 |
SE1010 | SE1010 | ||

9:00 | CS3851 CC45 | CS3851L-1 CC44 |
CS3851 CC45 | CS3851 CC45 | |

10:00 | Office Hour |
Office Hour |
Office Hour |
Senate | |

11:00 | Lunch w/ Students* |
Lunch w/ Students* |
Dr. Durant | XX | |

12:00 | Technology Comm. | ||||

1:00 | Dept Mtg | Office Hour |
|||

2:00 | CS2851 | CS2851L-2 CC51 |
CS2851 | ||

3:00 | Office Hour |

* 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.

Presentation: | 15% |

Lab Projects: | 40% |

Midterm Exam: | 20% |

Final Exam: | 25% |

Total: | 100% |

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