CS151 — Computer Science II
This course provides continuing experience in problem solving and software design methods. The exploration of recursion is continued and the entire software-design cycle is considered in greater depth. Introduction to abstract data types and fundamental data structures will cover topics: writing code to generate, use, and maintain complex dynamic structures, including linked lists, pointers, stacks, queues, sorts, searches, and trees. Other topics include a continued development of skills in the analysis of algorithms, dynamic memory use, and the use of external files.
Prerequisites: CS-150, MATH-187, CS-151L