Computer Science 3
Term 20092


General Information

Instructor: Matthew Fluet
E-mail:  mtf at cs.rit.edu
Office hours:M 11am – 12pm & 1pm – 2pm, W 11am – 12pm & 4pm – 5pm (or by apt.); 70-3555
Lectures: Section 01    MW 9:00am – 10:50am; 70-1400
 Section 03    MW 2:00pm – 4:50pm; 70-1400
Labs: Section 41    R 8:00am – 9:50am; 70-3640 (ICL 5)    (Fluet)
 Section 42    R 8:00am – 9:50am; 70-3620 (ICL 6)    (Hicks)
 Section 43    F 10:00am – 11:50am; 70-3520 (ICL 1)    (Fluet)
 Section 44    F 10:00am – 11:50am; 70-3540 (ICL 2)    (Patel)
Home page: www.cs.rit.edu/~mtf/teaching/20092/cs3

Course Description

This course is the third course in the computer science introductory sequence and builds upon the computer science foundations and design principles presented in Computer Science 1 and Computer Science 2. Students will learn how to use linear data structures, such as stacks, queues, and lists and non-linear data structures, such as trees and graphs, and will also be introduced to the design and analysis of algorithms. Students will learn how to analyze the efficiency of basic sorting, searching, and hashing algorithms, and acquire an understanding of how recursion works. Object-oriented programming will be used to design solutions and implement them as Java programs. Programming assignments — labs and projects — are an integral part of the course.

Last modified: Sat Dec 5 16:51:15 EST 2009