Design and Analysis of Algorithms

CSCE 500

General Information

Instructor
Dr. Miao Jin
Email: mxj9809@louisiana.edu
Office hours: MW 1:00pm - 3:00pm Oliver Hall 237

TA
Zhiqian You
Email: zhiqianyzq@gmail.com

Times & Places
MW 3:00pm - 4:15pm, Oliver Hall 117

Objectives
This course provides a comprehensive coverage of modern computer algorithms, aiming at in-depth treatment of algorithmic design and analysis with elementary explanation while keeping mathematical rigor.

Upon completion of this course, students will be able to do the following:

• Demonstrate a familiarity with major algorithms and data structures.
• Analyze the asymptotic performance of algorithms.
• Write rigorous correctness proofs for algorithms.
• Apply important algorithmic design paradigms and methods of analysis.
• Synthesize efficient algorithms in common engineering design situations.

References
"Introduction to Algorithms", Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, 3rd Edition, The MIT Press, 2009.

Grading

• 20% Quiz 1
• 20% Quiz 2
• 20% Quiz 3
• 35% Final exam (comprehensive)
• 5% Class participation