COM 1101 Algorithms and Data Structures 1 - Winter 2001

Reviewing for the Final Exam

for Professor Futrelle's section
College of Computer Science, Northeastern U., Boston, MA

(Version of 3/6/2001)

This page lists the major topics to be covered on the Final Exam. The Final will be held at 3:30pm, Tuesday the 13th of March in the Ell building auditorium -- the huge auditorium that can be reached from the front of the Ell building, which faces the Quad and Huntington Ave. There will be other exams going on in the auditorium at the same time, so our class will occupy some corner of the auditorium, away from the others.

In addition to this page, there have been a number of other pages created during the course which are accessible from the course gateway. These include lengthy notes for Quiz 2, notes for the Midterm and the wrap-up notes.

This page is not meant to be totally exhaustive and detailed. For example, if a particular chapter has been fully covered in the course, and all topics in it are relevant to the Final, I'll simply note that and not go through and list all the topics in the chapter. But often, less than all the material in a chapter will be covered and I'll be especially careful to describe the parts you do not need to study. Though such sections would probably be useful and educational, studying them now would not offer you much in the way of short-term benefits in taking the Final. At the end of the course, I have given you material emphasizing pointers and the use of the new operator. But since this material is hardly covered in the textbook, I am not emphasizing it on the Final Exam. Instead, I'm emphasizing material that is explained in the textbook, material you can study there. The textbook referred to below is of course, Problem Solving with C++: The Object of Programming (3rd edition, 2001) by Walter Savitch.

What you need to know for the Final Exam