CS 311 Fall 2009 > Syllabus

CS 311 Fall 2009
Syllabus

COURSE:	CS 311 Data Structures and Algorithms. 3 credits.
Time & place:	1–2 p.m. MWF, 104 Chapman.
Prerequisites:	CS 202. Prerequisites will be enforced.
INSTRUCTOR:	Glenn G. Chappell, Dept. of Computer Science.
Office:	201B Chapman.
Office hours:	10–12 MWF on fall 2009 class days, or by appointment.
Office phone:	[474-]5736. This is also voice mail.
E-mail:	`ffggc@uaf.edu`
Paper mailbox:	Inside the CS Department office, 202 Chapman.
TEXT:	Carrano, Data Abstraction and Problem Solving with C++: Walls and Mirrors, 5th ed. Supplementary readings will be provided by the instructor.
WEB PAGE:	`http://www.cs.uaf.edu/2009/fall/cs311`

Course Topics & Goals

CS 311 builds on CS 201 & 202. Emphasis is on organizing data (data structures) and working with it (algorithms) so as to minimize use of time and other resources (efficiency). Topics include Advanced C++, software engineering concepts, recursion, searching & sorting, algorithmic efficiency, data abstraction, and basic abstract data types & data structures, including: smart arrays & strings, Linked Lists, Stacks & Queues, trees (various types), Priority Queues, Tables, and graph algorithms.

After taking this class, students should:

Have experience writing and documenting high-quality code.
Understand how to write robust code with proper error handling.
Be able to perform basic analyses of algorithmic efficiency, including use of “big-O” notation.
Be familiar with various standard algorithms, including those for searching and sorting.
Understand what data abstraction is, and how it relates to software design.
Be familiar with standard data structures, including their implementations and relevant trade-offs.

Important Dates

Mon, Sep 7	No class (Labor Day)
Wed, Oct 21	In-class midterm exam
Fri, Oct 30	Last day to withdraw
Fri, Nov 27	No class (Thanksgiving)
Mon, Dec 14	Last regular class meeting
Wed, Dec 16	Final exam 1–3 p.m. in the classroom

Procedures

Class meetings—Class meetings will be conducted using a lecture-discussion format.

Homework—Homework will be assigned roughly weekly, and will consist largely of C++ programming. The first few homework assignments are to be done by each student individually. Later in the semester, most assignments will be done in groups of 2–3 students. Late homework will be accepted for partial credit up to 5 calendar days after the assignment due date, with credit awarded decreasing with each day the homework is late.

Quizzes—Short in-class quizzes will be given, unannounced. However, possible quiz topics will always be announced in advance. No make-up quizzes will be given.

Exams—Two exams will be given: midterm and final. The final will be comprehensive, emphasizing material covered after the midterm. See “Important Dates”.

Grades

Course grades will be based on points earned, using a 90-80-70-60 scale. The lowest two quiz scores and the lowest homework score will be dropped. Point totals will be as follows.

Assignments and Quizzes (total)	225 pts
Midterm Exam	75 pts
Final Exam	100 pts
TOTAL	400 pts

Policies

Students are expected to be at every class meeting on time, and are responsible for all class content, whether present or not. If absence from class is necessary, in-class work (other than quizzes) and homework may be made up only if the instructor is notified as soon as possible; in particular, absences due to scheduled events must be arranged ahead of time.

Academic dishonesty will not be tolerated, and will be dealt with according to UAF procedures.

Students in this class must pay the CS lab fee. Payment allows access to the Chapman 103 lab.

UAF academic policies: http://www.uaf.edu/catalog/current/academics
CS Department policies: http://www.cs.uaf.edu/cs/Policies.html