Home / DE Associate practice test / Working with Lakeflow Jobs / Question

Databricks Data Engineer Associate · free practice question

A data engineer builds a Lakeflow Job with four tasks: ingest_bronze, clean_silver, aggregate_gold, and refresh_dashboard. clean_silver must start only after…

Exam-style question on Working with Lakeflow Jobs from the free DE Associate practice test, with the answer and a full explanation below.

Updated November 10, 2026

Working with Lakeflow Jobs

A data engineer builds a Lakeflow Job with four tasks: ingest_bronze, clean_silver, aggregate_gold, and refresh_dashboard. clean_silver must start only after ingest_bronze finishes, and refresh_dashboard only after aggregate_gold completes, while independent branches should run in parallel. How should the job be structured?

  1. APut all four tasks into one notebook and invoke them in sequence with %run commands, because a Lakeflow Job cannot express ordering between separate tasks and will otherwise launch every task at the same moment.
  2. BGive each downstream task a depends_on reference to its upstream task so the job builds a DAG, runs tasks in dependency order, and executes independent branches in parallel automatically wherever no dependency exists.
  3. CAssign each task an identical cron schedule offset by two minutes so they fire in the intended order, since task ordering inside a job is governed purely by the staggered per-task schedule start times you set.
  4. DEnable the continuous trigger on the job so the tasks self-order by completion, because continuous mode inspects each task's inputs and derives the execution DAG without any explicit dependency wiring being needed.
  5. EWrap the four tasks inside a single for-each task and list them in order, because a for-each task guarantees strictly sequential execution of its iterations following the exact order in which the four tasks are listed.
Answer & explanation

Correct answer: B

WHY B: A Lakeflow Job is a DAG of tasks; declaring depends_on on each downstream task makes the job run tasks in dependency order and parallelize independent branches automatically. WHY NOT A: Jobs do express inter-task dependencies via depends_on; collapsing everything into one notebook discards orchestration and is unnecessary. WHY NOT C: Ordering comes from task dependencies, not from staggering per-task schedule times, which is fragile and not how a job DAG works. WHY NOT D: The continuous trigger controls when the job starts (always-on), not how tasks are ordered; it does not infer a DAG from inputs. WHY NOT E: A for-each task fans a single task over a collection of inputs; it does not sequence four distinct heterogeneous tasks.

Take the full DE Associate practice test free →

Would you pass today?

This question is one of 45 in the free, timed Databricks Data Engineer Associate practice test. Take it and get a section-by-section score.

Start the free test →