CpSc 212—Goddard—SummerI 09
Solutions for Practice Test 1
1. (a) if( x%2 == 0 ) cout << "Even";}
(b) Gives bar access to the private parts of Foo
(c) Copying a huge parameter is wasterful.
(d) char[] name = "Goddard";
2. (a) O(n4) (b) O(nlog n)
3. Naive algorithm is O(n2). A binary search on each row gives O(nlog n). (There is even
a linear-time algorithm: start in top-right hand corner and move left on a 1and down
on a 0.)
4. a) it prevents the value val from being changed
b) c) d)
MyInteger ( int v ) : val(v) {} // value must be set in initializer
bool operator==( const MyInteger & oo )
{
return val == oo.val;
}
MyInteger operator+( const MyInteger & oo )
{
return MyInteger( val + oo.val );
}
