Introduction to Analysis of Algorithms

CAS CS 330

Examines the basic principles of algorithm analysis; techniques of efficient programming; analysis of sorting and searching; graph algorithms; string-matching algorithms; matrix algorithms; integer and polynomial arithmetic; the fast Fourier transform; and NP-hard and NP-complete problems.

FALL 2014 Schedule

Section Instructor Location Schedule Notes
A1 Homer CAS 211 TR 9:30 am-11:00 am Class Full

FALL 2014 Schedule

Section Instructor Location Schedule Notes
A2 Homer MCS B25 M 12:00 pm-1:00 pm Class Full

FALL 2014 Schedule

Section Instructor Location Schedule Notes
A3 Homer MCS B23 M 1:00 pm-2:00 pm Class Full

FALL 2014 Schedule

Section Instructor Location Schedule Notes
A4 Homer MCS B23 M 4:00 pm-5:00 pm

Note that this information may change at any time. Please visit the Student Link for the most up-to-date course information.