CS 14: Introduction to Data Structures and Algorithms

Fall Quarter 2002: September 23, 2002 - December 6, 2002

Links:

Catalog Description: Topics include basic data structures such as arrays, lists, stacks, and queues; dictionaries including binary search trees and hashing; priority queues (heaps); introductory analysis of algorithms; sorting algorithms; and object-oriented programming including abstract data types, inheritance, and polymorphism. Also covers solving complex problems through structured software development.

Prerequisite(s): CS 012 with a grade of "C-" or better; MATH 009A or MATH 09HA; proficiency in C++.

Kudos: Special thanks to Dan Berger for teaching the first two weeks of class and still helping out now and then!

Instructor: Peter H. Fröhlich
Office Hours: By appointment only (email me); Tuesday & Thursday, 2:00 pm - 3:00 pm.

Assistant: Theodor Ilie
Office Hours: Wednesday, 2:30 pm - 4:00 pm & 5:00 pm - 6:30 pm, Surge 282
Grading: Homework 1, Homework 2, Lab 2.

Assistant: Jiannan Wang
Office Hours: Tuesday, 8:00 am - 11:00 am, Surge 282
Grading: Lab 1.

Grader: Ron Feliciano
Grading: Homework 3, Lab 4, Homework 5.

Grader: Adam Meadows
Grading: Lab 3, Homework 4, Lab 5.

Mailing List: cs14@lists.cs.ucr.edu (Archive)

Lectures: Tuesday, Thursday, 5:10-6:30 pm (11819), 6:40-8:00 pm (17325)
Location: Olmsted Hall, Room 1208

Intensive Care: Wednesday, 5:00 pm - 6:00 pm, Surge 284. Maximum 30 students. Requirements: Reserve seat by email. Guaranteed seat if < 50 points in midterm, until full if < 60 points in midterm; can't attend if 60 or more points in midterm.

Course Workshop: Please contact the workshop facilitator Omokhoje Amu for details.

Recursive Help: Monday, Wednesday, 4:15 pm - 5:30 pm, fixed times, Science Library, contact Adam Collins. Tuesday, 11:00 am - 5:00 pm, Friday, 11:00 am - 3:00 pm, open time and place, contact Joshua Bowers.