ACSU/CS 2110

CS 2110
Number	CS 2110
Offered	Every semester
Prerequisites	CS 1110, CS 1112, or AP credit
Historical median	B
Workload	Moderate (5 to 8 hrs/wk)

This is the second course in the introductory computer science sequence. It teaches basic computer science topics including sorting and searching, asymptotic complexity, recursion and data structures. Almost all material in this course is used in later courses or interviews.

Typically taught by David Gries and one other CS professor, this class forms the core of many CS topics and forms the basis of general CS knowledge. Many 4000 level courses will have this class as their highest requirement. A very large portion of programming interviews use material from this class.

This class has a lighter amount of work compared to other CS classes. There are seven projects which can be completed with a partner. There are two prelims and an optional final. Grades in homeworks are typically very high (~90) while prelim grades follow a normal distribution (average between 65 and 75). This means that prelims are weighted heavily when deciding grades, so study up.

Notes: This course does assume some programming experience (at the level of CS 1110), but the majority of students will not have background in Java.