cs163_winter2013001004.jpg
CS163 Winter 2013
tabr_n.gif tabr_n.gif tabr_n.gif

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.
tabr_n.gif

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:
cs163_winter2013001002.gif
What does it mean to be online?

This term there are two sections of CS163 - inclass (Section 001) and online (Section 002). These classes are not the same. Inclass students must sign up for a CS199 lab where we have hands-on experience with the concepts learned in the class. Online students will have access to the lab via D2L. For more information please refer to the syllabus.
Office Hours: Monday 9-9:50 in FAB 120-19 and Friday 9-9:50 in FAB 10
Welcome to Winter 2013!

Make sure to practice your C++, pointers, dynamic memory and linear linked lists as we begin the term. You should be proficient at building, traversing, and removing from linear linked lists to be prepared for this course.