CS 215 is a 3-unit lecture that introduces students to the basic techniques in algorithm analysis using asymptotic notations and analysis, sorting algorithms, graph algorithms, and different algorithm design techniques such as greedy, divide and conquer, dynamic programming, and backtracking algorithms.