SDSU CS 662
Theory of Parallel Algorithms
(Mathematical Preliminaries Solving Recurrence Relations via Ordinary Generating Functions)
CALCULATING THE NUMBER OF DIFFERENT N-NODE BINARY TREES
Let B(n) d
SDSU CS 662
Theory of Parallel Algorithms
PRACTICE EXAM #1 KEY
(100 points; problems are equally weighted)
PROBLEM #1
Indicate whether each statement below is TRUE or FALSE by circling the appropriate
SDSU CS 662
Theory of Parallel Algorithms
PRACTICE EXAM #1
(100 points; problems are equally weighted)
PROBLEM #1
Indicate whether each statement below is TRUE or FALSE by circling the appropriate let
SDSU CS 662
Theory of Parallel Algorithms
Finding the greatest among N array elements
in (log log N) time using an N-processor CRCW PRAM
Solution of related recurrence relation
(ref: Horowitz & Sahni,
SDSU CS-662
Theory of Parallel Algorithms
N-tuple prefix computation in (log2 N) time
using N/ (log2 N) processors
with CREW PRAM architecture
(HSR Algorithm 13.3)
Example: let the operation be ordina
SDSU CS-662
Theory of Parallel Algorithms
N-tuple prefix computation in (log2 N) time
using N processors
with EREW PRAM architecture
(Modified HSR Algorithm 13.2)
Example: let the operation be ordinar
SDSU CS-662
Theory of Parallel Algorithms
N-tuple prefix computation in (log2 N) time
using N processors
with CREW PRAM architecture
(HSR Algorithm 13.2)
Example: let the operation be ordinary additio
SDSU CS 662
Theory of Parallel Algorithms
(Mathematical Preliminaries Solving Recurrence Relations via Ordinary Generating Functions)
A CLOSEDFORM FORMULA FOR THE N.th FIBONACCI NUMBER
Consider the fu
SDSU CS 662
Theory of Parallel Algorithms
USING OGF's TO SOLVE SIMPLE NONLINEAR RECURRENCES
We wish to solve the following recurrence relation defining the function F : N N :
F (1) c1
N 1
N
F ( N ) F