Q1:Writing correct/fast parallel code is much harder than sequential. Especially in common languages like Java and C++.. Single choice.

False

True

Q2:In adjacency Matrix representation of a graph: Time to determine if (u, v) E:. Single choice.

Big theta of (|V|)

None of the answers is correct

Big theta of (1)

Big theta of (|E|)

Q3:Using the Median of Medians Algorithm (Guaranteeing a good split) : Find the Median of the following: {16, 12 , 2, 8, 17, 44, 1, 28, 66, 6, 20, 4, 21, 89, 14 }. Multi Line Text.

Q4:Using Breadth-First Search : Find the shortest-path distance from the source vertex 1 to each node in the graph? (Remark: make the table as given in the lecture with (Queue u v P(v) d(v))). Multi Line Text.

1 2 5. 4 7 (9) 8