|
|
|
|
Finde herein the faintest hint of what bold trials lay soon to come upon the third day of testing.
CS5500
Exam3
Spring 2003 Name:__________________________________________
Email:__________________________________________
1. The
following random list of integers is to be sorted using bitonic sorting: 7
2 4 3 5 1 0 6
What is the order of this list after one set of compare/switches? a.
2 7 4 3 1 5 6 0 correct answer: A 2. In the
recursive transposition algorithm we discussed in class, at any given time, what
is the maximum number of messages that are in transit in a machine of n
processors? a.
4 b.
n/4 c.
n/2 d.
n e.
none of the above correct answer: C 3.
In the distributed termination scheme discussed in the text that makes
use of acknowledgements, a process can accept work a.
only from its parent, as many times as needed b.
from anybody except its parent c.
from its parent, but only once d.
from any process e.
none of the above correct answer: D
4.
Which of the following is NOT a distributed termination scheme discussed
in the text: a.
the acknowledgement scheme b.
the ring scheme c.
Balasubramaniam’s scheme d.
the white/black token scheme e.
none of the above correct answer: C
5.
In Prims algorithm, the goal is to: a.
find a minimum-cost tour b.
find a minimum-cost path c.
find a minimum-cost path from a specific source d.
find a minimum cost spanning tree correct answer: D |
For problems or questions regarding this site contact the class
Web Lackey.
|