|
Description. This course surveys the most important algorithms and data structures in use on computers today. Particular emphasis is given to algorithms for sorting, searching, and string processing. Fundamental algorithms in a number of other areas are covered as well, including geometric and graph algorithms. The course will concentrate on developing implementations, understanding their performance characteristics, and estimating their potential effectiveness in applications.
Prerequisites. COS 126 or ISC 231–234 or approval by the COS placement officer.
Meetings. Class meetings are held twice per week, on Tuesdays & Thursdays.
Video Lectures. Available online.
Precepts. We cover details pertinent to programming assignments and exams. You should come to precept prepared to participate in the discussion, not just ask questions.
Course staff. You are welcome to attend the office hours of any staff member. Office hours begin Wednesday, September 16th.
| SECTION | TIME | ROOM | STAFF | OFFICE | HOURS |
|---|---|---|---|---|---|
| L01 | 11:00 to 12:30 |
Friend 001 | Bob Sedgewick | CS ... | 10-12PM |
The staff is complemented by Graduate Student Graders (TBA) and Undergraduate Course Assistants (TBA).
Online forum. If you have questions about the assignments, lectures, textbook, or other course materials, please post via Piazza. " ?> Posts marked private are viewable only by the course staff.
Grading. Your grade for the course will be based on the following components: programming assignments (45%), midterm exam (15%), final exam (25%), exercises (10%), and participation (5%). Participation includes using iClickers, contributing to the flipped lectures, participating in precepts, and answering forum posts. Occasionally, we make mistakes. To request a regrade, write a brief note indicating the perceived mistake by the grader; attach it to your graded work; and give it to your preceptor within two weeks of when the graded work was returned.
Course website. The course website
http://www.princeton.edu/~cos226includes links to course content, including programming assignments, exercises, lecture slides, and old exams. You will also use it to submit programming assignments.
Readings. The following textbook is required. It contains a wealth of information beyond what we can cover in lecture; it is certain to enhance your understanding of algorithms and data structures.
Booksite. There are many resources that you can find at the booksite http://algs4.cs.princeton.edu/home/
iClickers. To make the lectures more interactive, we will be using iClickers in the traditional lectures. Any hardware version of the iClicker (set to default frequency AA) is suitable. You cannot use iClicker GO because the lecture hall has insufficient connectivity.
Programming assignments. The programming assignments involve applying the material from lecture to solve problems in science, engineering, and commerce.
Exercises. The exercises consist of short drill questions on the material in the lectures and readings. They are done within Blackboard, and are due each Sunday at 11:00 PM.
Exams. The in-class midterm exam is Tuesday, October 27. The final exam will be scheduled by the Registar.
Computers. You may develop your programs on any machine that you like: we encourage you to use your own equipment. We provide instructions for setting up a Java programming environment under Windows, Mac OS X, and Linux.
Laboratories. Undergraduate lab TAs are available to answer general computing questions in Lewis 121. They can assist you in debugging, provided you have first made a reasonable effort to identify the bug and isolate the problem. If you have questions regarding the course material or programming assignments, see your preceptor or instructor.
