Roosevelt University in Chicago, Schaumburg and Online - Logo

Course Details


CST 280 - INTRODUCTION TO ALGORITHMS

The course focuses on basic techniques used to design and analyze efficient algorithms. The major topics include: the divide-and-conquer approach, sorting algorithms, graph algorithms, the greedy approach, dynamic programming, computational complexity.

Credits: 3

Prerequisites:

  • MATH 245 (with a min grade of C-)
  • AND  CST 150 (with a min grade of C-)
  • View the Course Finder for more detailed prerequisite information.

    Course Notes: