Solve problems 2.3, 2.9 and 2.11 from Chapter 2 of the textbook.
2. Homework 2 Assigned on: 09-26-02 Due by: 10-03-02
Solve problems 4.6,4.7,4.11 and 4.12 from Chapter 4 of the textbook.
3. Homework 3 Assigned on: 10-10-02 Due by: 10-17-02
Problems 3.1,3.3 and 3.4 from Chapter 3 of the textbook.
; 4. Homework 4 Assigned on: 11-22-02 Due by: 12-3-02
Solve Problems 6.5,6.11 and 6.22 from Chapter 6 of the textbook.
Solve Problems 9.1, and 9.3 from Chapter 9 of the textbook.
6-5 (hint: assume that the number of elements is n and that elements merged at the kth stage,
with sub-sequence size 2^k, correspond to wires whose binary representation have the
same (log n - k) most significant bits),
6-11 (hint: a direct analogy to the hypercube implementation may not be possible),
9-1 (hint: the problem size can be increased by increasing the capacity c).