CS 261   (4 credits)
Data Structures
Spring 2006 <>

Schedule        Score Posting        Links
Lecture Owen 103   MWF 3:00-3:50 (4/3/06 - 6/9/06)
Instructor
Prof. Timothy A. Budd (contact info)
Office Hours MWF 10:00-11:30, KEC 3049
Teaching Assistant Nadia Payet (payet@engr.orst.edu) office Hours: Monday/Wednesday 2-3, KEC 1130
Ben Hermens (hermens@engr.orst.edu) office Hours: Th 2-3, Fr 11:30-12:30, KEC 1130
Prerequisites CS 162, Math 232
Textbook Timothy Budd, course notes, Schildt: C/C++ Programmer's Reference
Course Learning Objectives
    1.    describe the properties, interfaces, and behaviors of basic abstract data types, such as collection, bag, indexed collection, sorted collection, stack, and queue
    2.    read an algorithm or program code segment that contains iterative constructs and analyze the asymptotic time complexity of the algorithm or code segment
    3.    state the asymptotic time complexity of the fundamental operations associated with a variety of data structures, such as vector, linked list, tree, and heap
    4.    recall the space utilization of common data structures in terms of the long-term storage needed to maintain the structure, as well as the short-term memory requirements of fundamental operations, such as sorting
    5.    design and implement general-purpose, reusable data structures that implement one or more abstractions
    6.    compare and contrast the operation of common data structures (such as linear structures, priority queues, tree structures, hash tables, maps, and graphs) in terms of time complexity, space utilization, and the abstract data types they implement
Schedule Check here every week; the schedule is subject to "adjustments"
This course is being redesigned to make use of C instead of Java, and to incorporate a different teaching style. This is admittedly experimental. I will evaluate the success of this approach as the term progresses, and adjust the schedule as necessary.
Communication There is a class mail list established for this course. I will use this to send e-mail to the entire class where appropriate. You can also use this as you wish, simply by sending e-mail to cs261-sp06@engr.oregonstate.edu.

There is also a web-based form you can use if you want to send anonymous e-mail to the professor. There is no way that mail generated from this source can be traced back to an individual.

Grades There will be a number of homework sets, programming assignments, two midterm exams, and a final. The grades for these will be weighted so that the homework is about half of the final grade, and the exams the remaining half.
Academic Honesty Policy See the university, college, department, and course policies.
Obviously, compliance is expected.