Analysis of Algorithms (CMPSC 250)

Spring 2014

Lecture, Discussion and Group Work Session: Alden 101, MWF 1:30pm to 2:20pm

Laboratory Session: Alden 101, Tuesdays 2:30pm to 4:20pm

Course Resources:

  • Course Syllabus

  • Sakai page

  • Instructor Office Hours

    • Required Textbook: "Algorithms" (4th edition) by Robert Sedgewick and Kevin Wayne.

      The description of the course:

      A treatment of selected topics from the analysis of algorithms including models of computation, design of efficient algorithms, computational complexity, and NP-completeness. Students develop expertise in mathematical analysis and algorithmic programming methodology.

      The course follows two parallel tracks. In the lectures we will look at the theory of the algorithmic analysis, while in the labs you will have a hands-on experience with specific algorithms and with designing and analyzing new algorithms.