18.3) This code will work if there are only two processors, 0 and 1. Any processors beyond that will be stuck in
the first if block waiting for a message that they will never receive.
18.6) Procedure Scatter(L[0:n-1], p)
Input: L, a list of size n, and p
(5.12)
An algorithm to solve this problem using pipelining is as follows. Arrange the processors in a binary tree, such that
n/2 processors are on the bottom level, with n/4 on the next highest level, and so on until there is a single processor
at the roo
26.6) To prove this proposition, assume that the subset U is a clique of the vertex set V.
By definition U is a complete graph, meaning all of the vertices are connected to each
other. If we take the complement of the graph G, and then examine only the ve
Homework Assignment 1
1) Recurrence relation solutions:
n-1
a) 3n-2
b) 2(3n + 3i )
c) 4k + n2 -n
i=0
All solutions were verified by plugging in a value for n.
3) The following table shows the initial values for Fib(k) as they are called with k=0,1,2.n:
k