CPSC 311-501 and CPSC 311-502: Analysis of Algorithms
Course Information
Spring 2003

Class Meeting:
CPSC 311-501: 2:20-3:35pm, Tuesdays and Thursdays, ZACH 105B
CPSC 311-502: 9:35-10:50am, Tuesdays and Thursdays, ZACH 105B

Course homepage: http://parasol.tamu.edu/~amato/Courses/311

Course listserv: cpsc311@listserv.tamu.edu
We will sign you onto the list. It will be used by the instructor and the TAs to send announcements and clarifications, and it can be used by the students to ask questions (which can be answered by the instuctor, the TAs, or other students) and to discuss other aspects related to the course.

Textbook: Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein, McGraw-Hill (and MIT Press), 2nd Edition (latest)

Prerequisites: CPSC 211 (Data Structures) and Math 302 (Discrete Mathematics). In particular, you should be familiar with:

• mathematical solutions to recurrence relations
• mathematical induction
• data structures including linked lists, arrays, trees, and graphs
• knowledge of a high level block structured language such as Java, C++, C or Pascal

Course Goals: At the end of the semester you should:

• be familiar with fundamental algorithms and algorithmic techniques,
• given a particular application, be able to decide which algorithm among a set of possible choices is best,
• be able to prove correctness and analyze the running time of a given algorithm,
• be able to design efficient algorithms for new situations, using as building blocks the techniques learned,
• be able to prove a problem is NP-complete using reduction.

Course Content and Tentative Schedule: The course will cover the following topics; the relevant chapters of the textbook are indicated in parentheses.

• Introduction and Mathematical Fundamentals - (Ch. 1, 2, 3, 4 )
• Sorting - (Ch. 6, 7, 8)
• Selection - (Ch. 9)
• EXAM 1 - (Thursday February 13 - TENTATIVE)
• Hashing - (Ch. 11)
• Basic Graph Algorithms - (Ch. 22 )
• More Graph Algorithms - (Ch. 23, 24, 25)
• Union-Find/Disjoint Set Data Structure - (Ch. 21)
• Dynamic Programming - (Ch. 15)
• EXAM 2 - (Thursday March 27 - TENTATIVE)
• NP-Completeness - (Ch. 34, 35)
• Special Topics TBD
• EXAM 3 (FINAL EXAM)
  • CPSC 311-501 (TR 2:20-3:35pm): Wednesday May 7, 1:00-3:00pm
  • CPSC 311-502 (TR 9:35-10:50am): Friday May 2, 12:30-2:30pm

Mechanics: The graded work in the course will consist of: homework assignments (individual), in-class assignments (individual or small groups), programming assignments (individual), computer science culture assignments (individual), quizzes, and exams. The purpose of the individual assignments is to make sure you as an individual understand the material. The purpose of the group assignments is to enable you to learn from and teach your peers as much as possible. It is also good experience for future jobs. All group members will receive the same grade on group assignments.

• Homework Assignments. There will be several (6-10) written (paper & pencil) homework assignments. Although these will primarly be individual assignments, there may be some group assignments.

• Programming Assignments. There will be at least one programming assignment. These assignments will typically not require much actual programming, but instead will enable you understand how the theoretical tools you study in this course should be applied to understand the resource requirements of actual programs.

• In-Class Assignments. There will also be periodic in-class assignments, that is, assignments that are assigned, completed, and due during a single class period. These will be small, one or two problem assignments covering material presented in class that day. These assignments will often be done in small groups (2-4 students).

• CS Culture Assignments. There is alot more to Computer Science than you will be exposed to through your normal coursework. The purpose of the CS culture assignments is to give you an opportunity to learn about some of the various research areas (by attendence at research seminars), and some of the computer scientists that have made significant contributions to the field (by researching and writing short biographies). During the course of the semester, you will be required to complete 5 CS Culture assignments. More details on these assignments are available on the course webpage.

• Quizzes: The quizzes will be over the assigned reading. The purpose of the quizzes is to motivate you to become familiar with the topics to be covered and to learn as much as possible on your own. Expect about one quiz per week - they will be announced at least one class period in advance. You will be permitted to drop at least two quizzes (the total number to be dropped will be decided later in the semester).

• Exams: There will be three exams - two midterms and a final. They will be closed book and in class. All exams will be weighted equally.

Grading: Course grades will tentatively be determined as follows:

• assignments 25%
• quizzes 15%
• exams 60% (20% each)

Computer use and accounts: You will need to be familiar with and have access to a web browser since many handouts for the course will be made available only on the web. In addition, email will be widely used for announcements regarding the course -- you must read your email regularly.

All students registered for this course are entitled to have accounts on the UNIX machines in the CS department. If you do not already have a CS UNIX account you can sign up for one on the second floor in HRBB. You will need to have an account so you can use the turnin program.

Collaboration: Discussion of concepts is encouraged, but, unless otherwise specified, all assignments must be done on your own. If you use a source other than the text (e.g., another book or a person), reference it.

Recall that University Regulations, Section 42, define scholastic dishonesty to include acquiring answers from any unauthorized source, working with another person when not specifically permitted, observing the work of other students during any exam, providing answers when not specifically authorized to do so, informing any person of the contents of an exam prior to the exam, and failing to credit sources used. Disciplinary actions range from grade penalty to expulsion.

All assignments in this course must include a completed and signed coverpage available on the course homepage. Any assignment turned in without a fully completed and signed coverpage will receive ZERO POINTS.