Data Structures

Spring 2009 CS163 Instructor: Karla Fant

Announcements

q When you submit anything that needs to get graded, email it to karlafgr@cs.pdx.edu

q Finals Week Office Hours are T/TH 9-10am in FAB 120-19

TA Office Hours

Seho Park [seho@cs.pdx.edu] and Sharookh Daruwalla [sharookh@cecs.pdx.edu] are our TA’s this term. Their office hours will be held at the Round Tables (in the fish bowl) outside of FAB 120. They will have the following office hours this term:

Seho: Sharookh:

Mon 9-12pm 10:30-1pm

Tues 3-5pm 9-1pm

Wed 9-12pm 10:30-1pm

Thurs 3-5pm 9-1pm

Fri 9-2pm 1-3pm

pdf Handwritten Notes

· Week #1 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Week1.pdf

· Day #3 Notes: http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day3.pdf

· Day #4 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day4.pdf

· Day #5 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day5.pdf

· Day #6 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day6.pdf

· Day #7 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day7.pdf

· Day #8 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day8.pdf

· Day #10 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day10.pdf

· Day #11 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day11.pdf

· Day #12 Notes http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Day12.pdf

· Notes on Trees and Heaps http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Tree_Practice_and_Heaps.pdf

· Notes on Graphs http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Graphs.pdf

· Notes on Sorting Algs http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_Sorting_Algs.pdf

· Notes to Prepare for Final http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Prep_for_Final.pdf

· Notes on HW3 http://www.cs.pdx.edu/~karlaf/CS163_Spring09/CS163_Notes_HW3.pdf

Important Links to Use this Term

1. Frequent Our Home page: http://cs.pdx.edu/~karlaf/CS163_Spring09.html

1. Weekly login to Blackboard: http://psuonline.pdx.edu/

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.