Crucial Exams

AWS Certified Data Engineer Associate DEA-C01 Practice Question

A data engineer is generating an AWS Step Functions workflow from a dependency table containing up to 10,000 tasks, each with at most 30 downstream dependencies. The engineer must store the directed acyclic graph in memory inside a 512 MB Lambda function and run a topological sort in O(V+E) time. Which in-memory representation best meets these requirements?

  • A nested dictionary that maps each source task ID to a dictionary of destination IDs set to true.

  • An adjacency list implemented as a dictionary that maps each task ID to a list of its dependent task IDs.

  • A single list containing one JSON object for every edge, scanned each time the graph is traversed.

  • A 10,000 × 10,000 boolean adjacency matrix stored in memory.

AWS Certified Data Engineer Associate DEA-C01
Data Ingestion and Transformation
Your Score:
Settings & Objectives
Random Mixed
Questions are selected randomly from all chosen topics, with a preference for those you haven’t seen before. You may see several questions from the same objective or domain in a row.
Rotate by Objective
Questions cycle through each objective or domain in turn, helping you avoid long streaks of questions from the same area. You may see some repeat questions, but the distribution will be more balanced across topics.

Check or uncheck an objective to set which questions you will receive.

Wipe Score
Bash, the Crucial Exams Chat Bot
AI Bot