We will be not be following the book closely, but you should use it as a reference. For some topics, I will provide supplementary material from other texts. You are responsible for everything that is covered in the lecture. Topics to be covered will include recursion, linear data structures (lists, stacks, queues), trees, heaps, sorting, hashing, and space/time complexity analysis of the algorithms involved, including proof techniques. In the book, we will cover (roughly in this order) sections 2.1, 11.1, 11.2-3, 5.5, 11.4, 13.1-3, 12.1-4, 7.1-3, 7.4, 8.1-4, 9.1-4. Other topics may be added if time permits.

Grading

Programming projects: 45%

Written assignments: 20%

midterm: 15%

final: 20%

Grading is on a straight curve (A 90% and above, B 80-89%, C 70-79%, D 60-69%, F below 60%). Please note that projects make up 45% of the grade. This means it is not possible to pass the class without doing the projects, even if you ace the tests. The final is comprehensive, with more emphasis on the second half of the course.

Each student will be assigned a random code which will be mailed to your account. Grades will be posted to the website, as they become available, sorted by this code. This way you can not only see your own grade, but also compare your progress with the rest of the class.

All course material will be posted to the class website. Programming assignments are turned in and graded electronically. Partial projects will be given to partially completed projects. however, programs that do not compile will be penalized heavily. Written assignments are due in class on the due date. Extra credit opportunities will abound.