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.

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.

Although there is only one section of CS163 this term, the class lecture is "captured" and streamed on the web (typically within 48 hours of the live lecture taking place). Students may watch this class each week on the web, use the material to prepare for exams, or watch the classes easily if the event comes that you are sick or unable to attend class. *** IF YOU DO NOT ATTEND CLASS, it is VITAL that you watch the lecture each week and participate in the weekly online Activities. Falling behind is the biggest risk you will face. Be proactive!

Announcements will be posted on D2L for all students, so you won't miss anything if you treat this as an "online" class!