Practice Problems for Exam 2

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

2. 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.

3. Problem 15-4, 15-5 and 15-7 (pages 367-369).

4. Problem 16.2-2, 16.2-5, 16.2-7 (page 384).

5. Problem 16-2 (page 402).