This course presents and in-depth look at data structures and algorithms. Students taking this class already have some exposure and familiarity with both data structures and algorithms. In this class, we look more closely at both with particular attention to their formal properties. As a consequence of taking this course, students should be well versed in the design and analysis of algorithms that they will encounter in the future. The prerequisites for the course include CS030 and MA/CS015, Discrete Mathematics. If for some reason you are concurrently taking Discrete Mathematics, you should refer early and often to the Appendices in Part VIII of the text.

- Required textbook:
*Introduction to Algorithms*(second edition), by Thomas Cormen, Charles E. Leiserson, Ronald L. Rivest, & Clifford Stein. (2001). Our Westmont Bookstore will not carry any copies so order them on your own if you would like a hard copy. - Development platform and environment:
We will use C++ for our programming projects
and your code must compile and run on my machine.
Therefore, I
*strongly*encouraged you to use Linux. You may use whatever editor you prefer; however, be careful to observe instructions when submitting assignments.

- Time and place: Tuesdays and Thursdays,
*3:15-5:05pm*; Winter Hall 212 - Professor: Wayne Iba
- Office: Winter Hall 308
- Office Hours:
*see main teaching page* - Course Syllabus
- Class schedule will be posted on Eureka