A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as

Related MCQs

• The graph of tasks (nodes) and their interactions/data exchange (edges)?
• All nodes collects _____ message corresponding to √p nodes to their respectively
• In task dependency graph longest directed path between any pair of start and finish node is called as --------------
• Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?
• In this decomposition problem decomposition goes hand in hand with its execution
• The pattern of___________ among tasks is captured by what is known as a task-interaction graph?
• Which task decomposition technique is suitable for the 15-puzzle problem?
• Topological sort of a Directed Acyclic graph is?
• In a balanced binary tree processing nodes is equal to
• The length of the longest path in a task dependency graph is called?