CS201 Data Structures and Algorithms

Syllabus

Printable Version

Instructor

John C. Lusth office: 3427 SEC
phone: 204-348-1618 email: lusth@cs.ua.edu
home page: http://beastie.cs.ua.edu/cs201 office hours: sign-up sheet

Catalog Statement

Provides an introduction to formal techniques for analyzing the complexity of algorithms. The course surveys important classes of algorithms used in computer science and engineering.

Data structures including balanced search trees, heaps, hash tables, and graphs. Algorithm design techniques including divide-and-conquer, greedy method, and dynamic programming. Emphasis on problem solving, design, analysis, and reasoning about data structures and algorithms.

Implementing the Catalog Statement

You will be required to demonstrate your proficiency with implementing algorithms through three programming assignments. The C programming language will be the language used for the three projects.

You will also be tested on your knowledge of algorithms through two concept exams and a final exam.

Prerequisites

CS 101, MATH 301, MATH 302 (with concurrency)
There will be an exam on prerequisite material.

Textbook

Introduction to Algorithms, Third Edition
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
ISBN-13: 978-0-262-033848
ISBN-10: 0-262-033844

Topics

The following sections, chapters and topics from the text will be covered:
though not necessarily in order.

Grading

Grades will be determined by the following percentages:
10% Prereq Exam (click here for a practice exam)
20% First Concept Exam
20% Second Concept Exam
20% Final Exam
30% Four programming assignments

Grading Methodology

For programming assignments, you must pass all tests. If you fail even one test, you will have to resubmit. You are allowed four resubmissions, with each resubmission resulting in a 10 point deduction. If you cannot pass all tests after your fourth resubmission, you will receive a zero for the assignment.

Submissions and resubmissions have due dates, as specified in the schedule. Missing a submisison or resubmission date is the same as failing all tests. Generally, but not always, submission and resubmission dates are seven days apart.

For programming assignments, you will recieve a bonus based upon how successful your initial submission was. The formula for the bonus is the percentage of tests passed divided by twenty. For example, suppose you passed 80% of the tests with your original submission and you passed all tests on your second resubmission. In this case, your score for the assignment would be 100 - 10 - 10 + 80 20 or 84 out of 100. Passing all tests with the original submission will yield a score of 105 out of 100.

Grading for the class is straight scale with the following cut-offs: 90% and above is an A, 80% and above is a B, 70% and above is a C, 60% and above is a D, and anything lower than 60% is an F. These cut-offs are strict. For example, 79.99999% is a C. Plusses and minuses are awarded to the upper and lower percentages of a grade (2% window).

Other Details

The following conventions will be followed in CS201. Please make sure that you fully understand each of the items listed below.