DAGs (Directed Acyclic Graphs) orExecuton Graph

Self-check

Questions 1–10 of 10

1. What is an Execution Graph?
Question 1A. A visual and logical representation of how tasks, operations or computations are executed in a system, showing their order and dependenciesB. A chart of how long each server has been runningC. A list of employees and their managersD. A pie chart of CPU usageE. A table of database permissions
2. In a Directed Acyclic Graph (DAG), what does 'acyclic' mean?
Question 2A. Tasks may run in any orderB. The graph does not loop back on itselfC. Every task runs twiceD. The graph has no edgesE. Tasks always run in parallel
3. Which single question does an execution graph answer, in simple terms?
Question 3A. How much does each task cost?B. Who wrote each task?C. What runs first, what runs next and what depends on what?D. Where is the data physically stored?E. Which programming language is fastest?
4. Which of the following is NOT listed as something an execution graph helps systems do?
Question 4A. Understand task dependenciesB. Run independent tasks in parallelC. Recover from failuresD. Choose the cheapest cloud providerE. Track processing stages
5. When a job is submitted to a distributed processing engine, what does the system do before executing it?
Question 5A. It runs each line of code immediately in the order writtenB. It sends the code to a human reviewerC. It converts the code into a relational tableD. It compresses the code to save memoryE. It builds an execution plan, which is converted into an execution graph
6. In an execution graph, what do the nodes and edges represent?
Question 6A. Nodes are tasks or transformations; edges are dependencies between tasksB. Nodes are servers; edges are network cablesC. Nodes are users; edges are permissionsD. Nodes are tables; edges are foreign keysE. Nodes are files; edges are folders
7. In the pipeline Read Data, Filter Rows, Aggregate Results, Write Output, when can the Aggregate Results step start?
Question 7A. At any time, since all steps are independentB. Only after the Filter Rows step it depends on has finishedC. Before Read Data, to save timeD. Simultaneously with Write OutputE. Only after Write Output has completed
8. In the school project example of an execution graph, which task can run in parallel with writing notes?
Question 8A. Presenting to the classB. Collecting information from booksC. A friend drawing pictures for the posterD. Creating the posterE. Nothing; every step must wait
9. Why are execution graphs especially important in distributed environments?
Question 9A. Because distributed systems have no dependenciesB. Because they replace the need for codeC. Because they store the data itselfD. Because multiple machines process data simultaneously and need tasks ordered correctlyE. Because they prevent any task from running in parallel
10. Which statement best captures the key idea of an Execution Graph?
Question 10A. It is only a decorative diagram for documentationB. It is a type of relational databaseC. It replaces data engineersD. It guarantees that tasks never failE. It is how modern data systems organise and optimise work, ensuring correct order, parallel processing and dependency management