CS200 Algorithms and DataStructures Main Page |
|
|
|
||
CS161 (with a C [2.0] or better); MATH160 or MATH141 or MATH155 (all with a C [2.0] or better).
The goal of this course is to convey an understanding of abstract data types, common data structures, necessary discrete structures and complexity analysis. The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graph algorithms. Complementary topics from theory include complexity analysis, recurrence relations, trees, and graphs.
The schedule page contains the weekly schedule, links to lecture notes, homework, etc.
Notes
The lecture notes are in slide form and thus brief. They are not meant to be complete study material, but initial pointers to what needs to be studied. For more complete material, see the resources page.
The quizzes are there for you to make sure you are getting the material, and whether you are working hard enough.
Instructor
Wim Bohm, CS, CSU
Email: bohm at cs dot colostate dot edu
Office (CS 344) hours MW 10:00-11:00
Lectures Tue/Thu 9:30 - 10:45, Wagar 232
Lab recitations
L01 Mon 3 - 4:40, CS225
L02 Tue 11 - 12:40, CS225
L03 Thu 3 - 4:40, CS215
L05 Tue 3 - 4:40, CS215
GTA
Artem Sokolov
Email: artem dot sokolov at gmail dot com
Office Hours = Recitations, as well as, Wed 3-5pm, CSB120 lab
Tutors
The department has hired tutors who are able to help out with CS160, CS161, and CS200 at the following times:
These are in addition to GTA hours. All paid staff sit at either the GTA desk or the workstation by room 110 or are floating. Both monitors have BIG signs that say "Need help? Ask me!"
Copyright © Colorado State University. All rights reserved.