Introduction to Data Structures
CS367 - Summer 2006

Class Schedule

Day: MTWR
Time: 10:20-11:35am
Location: cs 1257
Class e-mail list: compsci367-1-sum06@lists.wisc.edu
Archived Class E-mail List

Instructor

Laura Goadrich
Office: cs 5390
e-mail: goadl@cs.wisc.edu
Office Hours: MW 11:35am-12:35pm (or by appointment)

Teaching Assistant

Matt Anderson
Office: cs 1301
e-mail: mwa@cs.wisc.edu
Office Hours: TR 11:35am-12:35pm (or by appointment)

Announcements

• Have a wonderful summer!
• Your final course grades are available. I will be available in my office from 1-2pm on Sunday to answer any final questions. I will finalize grades at 2pm on Sunday, August 13th. The final letter grades are
  85-100 A
  80-84 AB
  73-79 B
  65-72 BC
  55-64 C
  40-54 D
  0-39 F
  
• Note that the due time for the last assignment has been pushed back to 9pm (see the homework page for more information).
• Here is the review sheet for the final. We will be going over any questions you have on our review day, Wed.
• Note that the deadline for Assignment 5 has been pushed back- see the syllabus for more information.
• Note that the due date for Assignment 4 has been modified- see the syllabus for more information.
• There will be no class nor office hours on July 4th.
• Note that the due date for Assignment 2 has been modified- see the syllabus for more information.
• Instructions to obtain information from a removable storage device (like a floppy or flash drive) have been posted under the FAQ.
• In order to use the Learn@UW system to post your grades, the grading scale has been modified slightly- see the "grading" section for details.
• Information about remotely logging to the CS lab from a home computer has been posted under the "FAQ" section.
• There is a UNIX Orientation session hosted by the CS lab for new and novice UNIX users. The times for the orientation can be found at CSDocs. Students new to UNIX can purchase the CS 1000 handout at the DoIT Tech Store. You can also find the handout online.

Course Description

Catalog description:Study of data structures (including stacks, queues, trees, graphs, and hash tables) and their applications. Development, implementation, and analysis of efficient data structures and algorithms (including sorting and searching).

Prerequisites: CS 302 or consent of instructor.

Informal description:This course assumes that you know how to program a computer in a object-oriented language such as C++ or Java. We will be using Java 5.0 for our projects. This course is designed to give you an overview of a wide variety of data structures. We will compare the the performance efficiency and appropriate use of each different structure.