1. Check all that apply.

	A.	Since Ying's loop pointer, p, is type Base, no compiler error will occur.
	B.	Ying can call p->func() on each object in the loop and get distinct behavior as defined by the object pointed to.
	C.	Ying can call p->func() on each object in the loop and force only base class behavior of that method by using type coercion.
	D.	Ying can call p->func() on each object in the loop (no coercion) and will always get the Base behavior of this function. 2.

Multiple Inheritance

Consider a derived class B that is multiply inherited from base classes A1 and A2. Which would be a reasonable example of classes A1, A2 and B. (There may be more than one correct answer.)

	A.	A1 is a person who has some degree in math: DegreeHolderInMath A2 is a person who has some degree in computer science: DegreeHolderInCS B is DegreeHolderInBothMathAndComputerScience
	B.	A1 is an Insect (animal without a backbone, body in three sections, skeleton on the outside, usually give birth as eggs) A2 is a Mammal (animal with backbone, has hair/fur, usually give birth alive) B is an Animal (any living being on Earth which is neither a plant (vegetable) nor fungus)
	C.	A1 is a RealEstateProperty A2 is an ItemForSale B is a RealEstatePropertyForSale
	D.	A1 is a Condominium (One unit in a condo development in which a family might own and reside) A2 is a SingleFamilyDwelling (One house+land in which a family might own and reside) B is a ResidentialProperty (House+land, condo unit, townhome, or any other place in which a family might own and reside)
	E.	A1 is an Arm A2 is a Leg B is a HumanBody 3.

Select the derived class constructor definitions that represent actual constructor chaining (never mind the reason or effect, as long as it demonstrates a derived class constructor chaining to a base class constructor). There is more than one correct answer.

	A.	SubClass::SubClass(int a) : BaseClass() { // other stuff }
	B.	SubClass::SubClass() : BaseClass(4) { // other stuff }
	C.	SubClass::SubClass(int a) { BaseClass(a); // other stuff }
	D.	SubClass::SubClass(int a) { BaseClass::BaseClass(a); // other stuff }
	E.	SubClass::SubClass(int a) : BaseClass(a) { // other stuff 4.

Consider the boolean expression (where XOR is the exclusive-or operator defined in the modules or throughout the internet):

(P OR Q) XOR (P AND Q)

Match the inputs P and Q with the output that this expression produces (assume 0 = false and 1 = true).

	Choices - use a choice only once
A.	P = 1, Q = 0
B.	P = 1, Q = 1

	Match each of the following to a choice
1.	1	Select A. P = 1, Q = 0 B. P = 1, Q = 1
2.	0	Select A. P = 1, Q = 0 B. P = 1, Q = 1

5.

The is a sum-the-data-in-the-tree question. It asks whether a method, sumAll() is a well-written recursive method. You will see three different versions of this question throughout the exam, but the opening assumptions, are identical for all such versions. The only difference between the various questions is the code that implements the method sumAll().

Assumptions:

The general tree in this problem is assumed to be physical, i.e., there is no lazy or soft deletion designed into this tree.

We are considering a recursive work-horse method to sum all the (assumed) integer data of the sub-tree.

The sub-tree is specified by the root pointer passed in. As usual, some client would pass a root to this method, then this recursive method would generate other (child or sibling) roots to pass to itself when recursing.

The members sib and firstChild have the same meanings as in our modules.

True of False:

The method, as defined below, is a good recursive method for summing the data of the sub-tree, based at the root node passed in.

To be true, it must satisfy all the following criteria. If it misses one, it is false:

It gives the right sum for the sub-tree, that is, it does not miss counting any data.

it does no unnecessary work, micro-management or superfluous testing.

It covers all situations (empty trees, NULL roots, handles all the children, etc.).

int TreeClass::sumAll(Node *root)

{

int sibSum, thisSum, childrenSum;

FHsdTreeNode