FINAL EXAM REVIEW MATERIALS
Last Modified:
Fri Dec 12 11:12:54 1997
This page contains information which may be useful as you prepare
for the final exam, which will be given on Thursday,
December 18. I may add information to this page prior to
the exam, so check here occassionally and look at
the last revision date above to see if
anything has been changed since you last looked at the page.
Also be sure to look at your midterm and the review materials from
the midterm. The final exam is cummulative.
This page contains
- A list of review questions from Programming Abstractions in C
- Some additional questions which i wrote.
Review Questions from Programming Abstractions in C
The following Review Questions in the text are useful for preparing for
the final. Note that the content is more important than the format of
the questions and that this is not an exhaustive list of material to
study.
- chapter 1: 1 -- 8, 10, 14, 15, 18, 20 -- 28
- chapter 2: 2 -- 7, 9 -- 13, 15 -- 18, 20 -- 23, 25 -- 30, 32
- chapter 3: 1 -- 10, 12, 13, 14, 17 -- 21,23, 26 -- 32, 38
- chapter 4: 1, 4 -- 7, 11 -- 14 (also programming ex. 8, 9)
- chapter 5: 1
- chapter 7: 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22
- chapter 8: 1 -- 4, 6, 7, 9 -- 14
- chapter 9: 1, 3 -- 9, 11 -- 23
- chapter 10: 1 -- 13, 15, 16
- chapter 11: 2 -- 5, 7 -- 12, 16, 17, 21 -- 26
- chapter 13: 1, 3, 5, 7, 9 -- 15, 22 -- 24
- chpater 16: 1 -- 5, 7, 9 -- 13, 21, 22, 24, 27, 28, 30, 31
Additional Questions and Programming Exercises and
Things yYou Should Be Able to Do
-
Give the function header for each of the following.
Write a typedef line which declares a pointer-to-function type
which corresponds to each function.
- Function hypotenuse that takes two double-precision floating point
arguments side1 and side2, and returns double-precision floating
point value.
- Function IntToFloat that takes an integer argument Number and returns
a floating point value.
-
For each of the ADTs we have studied (edit buffer, stacks, queues, priority
queues, symbol tables, binary search trees, 2-3 trees, graphs) you
should be able to do the following:
- Give advantages and disadvantages of various implementations we discussed.
- Give the complexity of each of the functions.
- Give the typedef for the CDT.
- Draw a picture of the memory layout after a sequence of ADT operations.
- Draw a picture of the ADT "abstractly" (as oposed ot memory layout above)
after a sequence of operations.
- Write a function (one from the interface or a new one) as implementor.
- Write a function using the ADT as client.
- For ADT's like bst or 2-3 tree which have mapping functions, you
should be able to provide the visit function required to
perform various operations (similar to the things you
did in your inventory program).