CS163 Winter 2012
Course Description
CS163 introduces data abstraction with formal specification, and elementary algorithm analysis. Basic concepts of data and its representation inside a computer are included. Data structures emphasized include linear, linked, and orthogonal lists, tree structures, and graphs. Data structures are implemented as data abstractions. Sorting and searching strategies are covered along with overall data management.
Goals
To acquaint students with structures used in C++ for the storage and manipulation of data. The concept of data abstraction and the problem of building implementations of abstract data types are emphasized. Both static and dynamic implementations of major structures are presented and the advantages and disadvantages of each are discussed. Structures include lists of several types, stacks, queues, trees, binary trees, B-trees and graphs. Recursion and key transformation (hashing) are examined. Students are encouraged to examine algorithms and to make judgments about the practical and social application of these algorithm concepts to large scale programming projects; the course stresses the importance of quantitative methods in designing software.
Getting Help:
CS163 Announcements:
Important Links:
What does it mean to be online?
This term there are two sections of CS163. Section 001 is an “in-class” section and Section 002 is an “online” section. For section 001, students are guaranteed to have a seat available in the classroom and that attendance is required. For section 002, students must watch the lectures remotely (on the web). Every lecture is recorded so that students in Section 002 can keep up with the course material as the term progresses. IT IS VERY IMPORTANT that if you are taking the class as “online” that you watch two lectures every week. Missing lectures may mean missing vital information and failing the class! The class lectures are captured via a webcam and will be available for viewing approx. 24 hours after the in-class lectures have occurred. They are not pre-recorded.
Make sure to practice Linear Linked Lists and recursion!