Instructor: Dr. Lynne E. Parker

• Office: Claxton 220
• Email: parker at cs.utk.edu
• Office Hours: Tuesday/Thursday 3:30-4:30 PM

TA: Michael Bailey

• Office: Claxton Complex 125d
• Email: mbailey at cs.utk.edu
• Office Hours: Monday, 1:00-3:00 PM

TA: Charles Phillips

• Office: Claxton Complex 110g
• Email: cphillip at cs.utk.edu
• Office Hours: Tuesday/Thursday, 10:00-11:00 AM

Class Mailing List: cs302-students at cs.utk.edu

Course Description: CS302 provides an in-depth study of the design, analysis, and implementation of fundamental algorithms, such as sorting and searching, and their data structures. Specifically, CS302 is a bridge course between CS140 and CS360 that gives you b oth: 1) a more in-depth knowledge of many of the data structures and algorithms presented in CS140, and 2) additional programming experience that will be valuable in CS360. The goals of this course are to:

1. Acquire a mastery of a variety of algorithms fundamental to computer programming by building on the data structures and algorithms learned in CS140.

2. Acquire a familiarity with object-oriented programming by writing and debugging programs in C++.

3. Acquire a familiarity with a variety of Unix tools that aid in writing and debugging programs.

4. Learn more about algorithm analysis.

A 3 hour lab is required.

Prerequisites: CS140 and CS160.

Required Textbooks:

• Data Structures and Algorithm Analysis in C++, 2nd Edition, by Mark Allen Weiss, Addison Wesley, 1999, ISBN: 0201361221.
• C++ A Beginner's Guide, 2nd Edition, by Herbert Schildt, 2004, McGraw-Hill, ISBN: 0072232153.