Build fluency in the vocabulary of ordering tasks so every one appears after everything it depends on.
0 / 5 completed
1 / 5
At standup, a dev mentions ordering a set of build tasks so that every task appears after all the other tasks it depends on, using the dependency graph between them to compute that order. What is this technique called?
A topological sort is exactly this: given a directed graph of dependencies between tasks, it produces a linear ordering where every task appears after every other task it depends on, which is exactly what's needed to schedule a build, a set of package installations, or any pipeline of steps with prerequisites. A hash collision is an unrelated hash-table concept about two keys sharing a bucket. This ordering is only possible at all if the dependency graph has no cycles, since a cycle would mean two tasks each require the other to run first.
2 / 5
During a design review, the team confirms the dependency graph driving the build pipeline has no cycles, specifically so a valid topological order is guaranteed to exist for every task. Which capability does this acyclic property provide?
Confirming the graph is acyclic provides guaranteeing at least one valid execution order exists, since a topological sort is only possible when there's no cycle forcing two or more tasks to each wait on the other, which would make satisfying both dependencies simultaneously impossible. A graph containing a cycle has no valid topological order at all, since whichever task in the cycle you try to schedule first, another task in that same cycle still needs to come before it. This is exactly why a build system typically runs cycle detection before attempting to compute an execution order, so a broken circular dependency is caught early rather than silently mis-scheduled.
3 / 5
In a code review, a dev notices a dependency graph where task A depends on task B, task B depends on task C, and task C depends back on task A, forming a closed loop among the three. What does this represent?
This is a cyclic dependency, which has no valid topological order at all, since task A needs C done first, C needs B done first, and B needs A done first, so no matter which one is scheduled first, some other task in that same loop still needs to run before it. A cache eviction policy is an unrelated concept about discarded cache entries. This kind of closed dependency loop is exactly what a cycle-detection check catches before a build system even attempts to compute an ordering, since attempting a topological sort on a cyclic graph simply fails.
4 / 5
An incident report shows a build pipeline hung indefinitely because three of its tasks had been configured with a circular dependency, each waiting on another task in the same loop, and the scheduler had no way to compute a valid order among them. What practice would prevent this?
Running cycle detection on the dependency graph before attempting to schedule anything catches a circular dependency immediately and lets it be reported as a clear configuration error, rather than leaving the scheduler to hang indefinitely trying to find an order that doesn't exist. Continuing to schedule from the graph with no cycle check at all is exactly what let the circular dependency cause the indefinite hang in this incident. This upfront cycle-detection step is a standard, cheap safeguard built into essentially every real build system and task scheduler that relies on a topological sort.
5 / 5
During a PR review, a teammate asks why the team runs an explicit cycle-detection pass on the dependency graph instead of just attempting the topological sort directly and seeing whether it produces a full ordering. What is the reasoning?
A topological sort algorithm run directly on a cyclic graph can stall partway through, or in some implementations produce an incomplete ordering that silently omits the tasks caught in the cycle, rather than surfacing a clear, actionable error. An explicit cycle-detection pass instead gives a precise, immediate diagnosis of exactly which tasks are involved in the loop, which is far more useful for actually fixing a broken dependency configuration. The tradeoff is the small extra upfront cost of running a separate detection pass before scheduling, which is well worth it compared to debugging a scheduler that silently hung or misordered a set of tasks.
What does the "Topological Sort Vocabulary" vocabulary exercise cover?
This exercise tests real IT vocabulary related to topological sort vocabulary through 5 multiple-choice questions, each built from realistic workplace sentences rather than abstract definitions.
Is this vocabulary exercise free to use?
Yes. Every exercise on CoderSlingo, including this one, is completely free — no account, sign-up, or payment required.
How many questions does this exercise have?
This exercise has 5 questions. Each one shows a real-world sentence or scenario with multiple-choice options and an explanation once you answer.
What happens after I answer a question?
You'll see immediate feedback showing whether your answer was correct, along with a short explanation of why — then a button to move to the next question, and a full results screen at the end.
Can I retry the exercise if I get questions wrong?
Yes. Once you reach the results screen, click "Try again" to reset your answers and go through the exercise from the start as many times as you like.
Do I need to create an account to take this exercise?
No account is needed. Your answers are scored in your browser during the session — nothing is saved to a server, so you can jump straight in.
Is my progress saved if I leave the page?
No — progress within an exercise resets if you navigate away or reload. Each exercise is short enough to complete in a few minutes in one sitting.
Are these vocabulary exercises connected to other topics?
Yes — browse the full vocabulary exercises hub to find related modules covering adjacent IT topics and roles.
How is this different from reading a glossary or blog article?
Exercises like this one are active recall drills — you have to choose the correct term or phrasing yourself, which builds retention faster than passively reading a definition.
Where can I find more vocabulary exercises?
Browse the full Vocabulary exercises hub for hundreds of modules covering Agile, DevOps, security, databases, architecture, and more — organised by IT role and skill.