CS 61B, Fall 1994
Final
Professor Yelick
Problem 1. (15 points) For each of the following, fill in the blank with the appropriate phrase that
corresponds to the description. All correct answers have between one and three words. Each is worth 1 point.
Write your name and login at the top of every page in this exam.1. A small piece of code that "fakes" a procedure and is used to test higher level procedures.2. This type of C++ function is used to specify an interface to be used by all derived classes. The
iterator class from Budd contains these. (The correct answer is 3 words.)
3.
This representation of an undirected graph is best if we are interested in finding whether or not a
vertex is isolated, .e. is not connected to any otehr vertices.
4.
What function, besides quicksort, uses a partition function?5. You are asked to sort 10,000 integers that are evenly distributed between 0 and 1000. Which sorting
algorithm is best?
6.
This kind of matrix is typically represented using same data structures as those used in an edge list
representation of a graph.
7.
This representation of a queue is best for large queues in a system in which new and delete are very
expensive.
8.
What is minimum number of keys for a non-root node in a B-tree of order k, where k is even?9. Give another name for an undirected graph in which there is a single path from every vertex to every
other vertex.
10.
A storage allocator may not be able to find a large enough block for allocation, even though there is
plenty of unused storage. What causes this?
11.
Scheme does not have a new and delete operations (or anything like them) because it does this.12. This method of reclaiming memory cannot reclaim cycles.13. This strategy has proven superior when searching a free list for a sufficiently large block of memory.14. This method of memory allocation uses multiple free lists.15.
Problem 2. (20 points)
a. (6 points) The appendix contains the tree code from lab 9, modified to use integer values at the nodes rather
than strings. Draw a picture of the data structure for t1 and t2 after the following code is executed. Designate
which objects are on the stack and which are on the free store.
Tree* t1 = new Tree(4);
Tree* t2 = new Tree(2, t1);
t2 = new Tree(3, t1);
t2 = new Tree(4, t2);
b. (4 points) What would the above data structure look like after executing: delete t2?
c. (10 points) In lab 9, we used trees to represent amoeba family trees. We will call the number of elements in
a given level of such a tree the generation size of that level. The generation of the root is 1; if it has two
amoeba children, the generation size of their level is 2; if both of them have 3 children, the generation size of
their level is 6. Write a function maxGeneration that, given a pointer to a tree, returns the size of the largest
generation in the tree. You may use any auxiliary data structures or functions from the books. Give a brief
description of how your algorithm works here. Write your solution on the following page.
CS 61B, Final, Fall 1994
CS 61B, Fall 1994FinalProfessor Yelick 1
