Practice Problems for Exam 1

1.  Problems 3-3 and 3-4, pages 58-59.

2  Problem 4.1-1 and 4.1-6, page 67.

3. Problem 4-1, 4-2, 4-4,  pages 85-86.

4. Problem 9.3-8, 9.3-9, page 193.

5. Let A[1..n] be an array of n integers.  An integer x is said to be
majority element in the array A if x appears more than n/2 times in the array.
Given A, it is possible that there is no majority element.  Given A as input,
give a linear time algorithm to output majority element of A if it exists or
say that there is no majority element.

6.  Give an algorithm to multiply a n digit long integer with another m digit
long integer.

7.  Given n digit long integer x and m digit long integer y, give an algorithm
to output x^y.