The exam is comprehensive, and covers all the the following:
Chapters 1-10 in Savitch
Chapters 6-8 in Just Enough Unix
All Lecture Notes
All Labs and Projects
but will definitely concentrate on material from the following sources:
Chapters 6-10 in Savitch
Details below on what to emphasize and what you can leave out
Labs 5 through 7
(Honors section only: labs 6-8; lab 9 will not be on the exam)
Projects 2 and 3
When reading in Savitch:
All of Chapter 6 is important.
In Chapter 7, emphasize sections 7.1 and 7.2 up to and including page 303.
Omit pages 304 through 311, up to and including the part right before the chapter summary.
In Chapter 8, emphasize the following:
do read section 8.1 up to page 333,
but omit part starting with Overloading Function Application
you may omit section 8.2 on "friend" functions
do read section 8.3 up to page 354,
but omit part starting with Overloading the Incr and Decr operators
omit through p. 359, but do read the chapter summary on p. 359
In Chapter 9, read section 9.1 only. Omit 9.2 and 9.3
In Chapter 10,
Section 10.1 is one of the most important sections in the book
DEFINITELY review this section!
Section 10.2 is also important (not as important as 10.1, but
more important that a lot of other sections).
The only part you may omit for the exam is the part starting
with "multidimensional arrays" on p. 448 to the end of the section
BUT don't omit the blue box on p. 449... it is helpful!
Section 10.3 IS THE MOST IMPORTANT SECTION FOR THIS
EXAM TOTALLY! Read it over and over again.
I hope this helps!
Other things to look over
==================
Section 11.1 is not "officially" on the exam---but it does happen to
contain good and useful stuff that we talked about in lecture, and
is therefore not only "potentially" on the exam, but is in fact on the
exam! (In fact, it was on exam 2!)
Ditto for Section 12.1. This has all the stuff about ifstream and ofstream
that we did in many labs and projects, including Conrad's favorite
"pattern" for reading until end of file (see page 533).
Chapter 13 is all about recursion. There is a question about
recursion on the exam, so you may want to review this chapter.
The questions on the exam will come primarily from the lecture notes,
but the material in Chapter 13 is a nice way to re-enforce all
of that material.
Chapter 17 is about Linked Data Structures. However, the material
in Section 17.1 presents linked lists in a very different way than we
presented them in lecture and in the projects. So I would caution you
away from studying this chapter as preparation for the exam. Instead,
look it over, if you like, after the course is over, and before you take
CISC220, to see a different way of thinking about linked lists. But for
now, don't confuse yourself.
Chapter 18 contains information about Exceptions. Only the honors
section covered Exceptions, and only in one lab---there will be no material
about exceptions on the exam for anyone.
All the other chapters contain information that you will cover in
CISC220, if/when you take that course. I'd encourage you to NOT
sell back your CISC181 textbook until after you have completed
CISC220---you'll need it as a reference! If you don't beleive me,
ask a CISC or CPEG junior or senior.
Email me if you have any other questions!
Regards,
Phill Conrad
PS: There is one other useful handout about Linked Lists, available as a PDF file at the following link:
http://www.udel.edu/CIS/181/pconrad/05S/exams/E02/linkedList1.pdf
|
|
