Multiple Choice
When the topological sort of a graph is unique?
A) when there exists a hamiltonian path in the graph
B) in the presence of multiple nodes with indegree 0
C) in the presence of single node with indegree 0
D) in the presence of single node with outdegree 0
Correct Answer:
Verified
Correct Answer:
Verified
Q5: In this decomposition problem decomposition goes hand
Q6: A good mapping does not depends on
Q7: he threads in a thread block are
Q8: What is a high performance multi-core processor
Q9: which of the following is not the
Q11: CUDA is a parallel computing platform and
Q12: Renaming relative to the source is _
Q13: Task dependency graph is ------------------<br>A)directed<br>B)undirected<br>C)directed acyclic<br>D)undirected acyclic
Q14: blocking optimization is used to improve temmporal
Q15: which of the following is a an