A programme can contain enough credits for graduation and still take longer than expected to complete. Required modules may depend on earlier passes, run only in certain terms or compete for the same timetable space. Counting credits is a useful first check; arranging the learning in a feasible order is another task.
The short answer is to put each requirement on a term-by-term plan. Record its prerequisites, offering terms, duration and any relevant load or timetable constraints. Then check both that the proposed sequence works and that an earlier finish has not been assumed without evidence.
This guide uses a fictional programme at Alder College. Every module, credit value, offering pattern and progression rule is invented. The examples are planning models, not a statement about a real university, an approval to register or a prediction of anybody’s graduation date. Use your institution’s current official information and advice for an actual decision.
eduKateSG · Universities
Find your next learning step
Plan fictional prerequisite sequences with offering terms, load constraints, repeat scenarios, alternative modules and independent completion-time checks.
ROUTE 1 · CHAPTERS 1–4
Read requirements and offerings
Start with the quantities, purpose and explicit assumptions.
ROUTE 2 · CHAPTERS 5–8
Construct and defend a plan
Work through original examples and decisive comparisons.
ROUTE 3 · CHAPTERS 9–12
Test changed progression rules
Preserve the conditions that make a conclusion valid.
ROUTE 4 · CHAPTERS 13–18
Check timing and transfer
Apply the reasoning independently and inspect its limits.
ROUTE 5 · CHAPTERS 19–20
Answer questions and continue
Use useful FAQs, verified reading routes and primary sources.
Chapter contents
Read requirements and offerings · Chapters 1–4
Construct and defend a plan · Chapters 5–8
Test changed progression rules · Chapters 9–12
Check timing and transfer · Chapters 13–18
- 13. Distinguish a catalogue entry from a confirmed offering
- 14. Evaluate alternatives through the later chain
- 15. Add timetable conflicts as a separate constraint
- 16. Represent a multi-term requirement by its duration
- 17. Attempt a changed prerequisite schedule independently
- 18. Make the plan useful for an academic conversation
Answer questions and continue · Chapters 19–20
CHAPTER 1 OF 20 · Read requirements and offerings
1. Define completion before counting the remaining credits
Suppose a learner has six required modules left. Each carries five credits, so thirty credits remain. A permitted load of ten credits per term gives an arithmetic lower bound of three terms: thirty divided by ten. That calculation says the work cannot fit into fewer than three full-load terms under the stated credit rule.
It does not show that three terms are achievable. Some modules may be unavailable until earlier requirements are completed. An unused place in the current term cannot be filled with a future module whose prerequisite has not yet been passed.
The Universities subject guide encourages readers to examine the programme beneath its name. Here we develop one of those programme questions in detail: what sequence could actually complete the remaining requirements?
Write the completion condition explicitly. In this first model, all six named modules must be passed, prerequisites must have been passed in an earlier term and every module lasts one term. We initially assume that a place is available, the timetable works and each attempted module is passed. Those assumptions make the first sequence check possible. Later chapters examine changes rather than quietly treating the baseline as a promise.
CHAPTER 2 OF 20 · Read requirements and offerings
2. Build a module ledger with offering terms
Alder College numbers consecutive teaching terms 1, 2, 3 and so on. Odd-numbered terms share one offering pattern; even-numbered terms share another. These labels do not represent actual months, summer sessions or any institution’s academic calendar.
Module A has no prerequisite and runs in odd terms. B and C each require A and run in even terms. D requires both B and C and runs in odd terms. E requires D and runs in even terms. F requires C and runs in odd terms.
| Fictional module | Credits | Earlier passes required | Offering terms |
|---|---|---|---|
| A | 5 | None | Odd |
| B | 5 | A | Even |
| C | 5 | A | Even |
| D | 5 | B and C | Odd |
| E | 5 | D | Even |
| F | 5 | C | Odd |
The initial load limit permits two modules per term. A module cannot be taken twice simultaneously, and passing it once satisfies its named requirement in this model.
The ledger should be small enough to review but complete enough to reproduce the calculation. If offering information is only provisional, label it accordingly. The clean alternating pattern is an educational assumption; actual modules may have irregular offerings, separate activity sections or a schedule that is not yet confirmed. A precise table should preserve those differences rather than disguise them.
CHAPTER 3 OF 20 · Read requirements and offerings
3. Read prerequisite relationships as conditions
The relationship A before B means that A must be passed in a term strictly earlier than B’s term. It does not mean that the learner may put both in the same term because A’s examination happens first. That would be a different rule.
D has an AND requirement: both B and C must already be passed. Completing either one alone is insufficient. A catalogue could instead define an alternative such as B or C, or a more complicated combination. The connector belongs to the requirement and must survive the move into a planning diagram.
Trace two chains in the fictional ledger: A, B, D, E and A, C, D, E. Each contains four one-term modules that must occur in that order. F creates another branch, A, C, F. The shared A and C are individual requirements, not extra modules to be counted again for each branch.
This distinction prevents two opposite errors. Adding every chain length double-counts shared requirements. Looking only at the six-module total ignores order. Keep one module identity with several relationships attached to it. A useful learning check is to ask which requirement blocks D when B has been passed but C has not, and to justify the answer from the ledger rather than from a guess about module difficulty.
CHAPTER 4 OF 20 · Read requirements and offerings
4. Calculate the earliest permitted term carefully
For a module with prerequisites, first find the latest term in which any required prerequisite is completed. The module must occur after that term under our strict earlier-pass rule. Next choose the first permitted offering term that satisfies that condition.
In words, earliest term equals the first allowed offering after every prerequisite is complete. Without a load constraint, this can be calculated through the prerequisite graph from foundations towards later modules. The order matters because a later module’s earliest term depends on earlier results.
For A, the learner’s first available term is 1 and A runs in odd terms, so term 1 is possible. For B and C, A is then complete at the end of term 1; their first eligible even offering is term 2. D must follow both, so its first possible odd term is 3.
The calculation still needs a joint schedule check. If several individually eligible modules would exceed the load limit or clash, they cannot all occupy their individual earliest terms. An earliest-term table is therefore a useful foundation, not an automatic complete timetable. Preserve the difference between a dependency calculation and a schedule that also satisfies shared constraints.
CHAPTER 5 OF 20 · Construct and defend a plan
5. Work through a complete feasible baseline
Take A in term 1. Take B and C together in term 2. Both prerequisites for D are now complete, while C also permits F. D and F can share term 3 because each runs in odd terms and the two-module limit is respected. E follows D in term 4.
| Term | Modules in the baseline | Credits in that term |
|---|---|---|
| 1 | A | 5 |
| 2 | B and C | 10 |
| 3 | D and F | 10 |
| 4 | E | 5 |
Every named requirement appears once. The credit total is thirty. Every prerequisite lies in an earlier term, each offering pattern is respected and no term contains more than two modules. The schedule therefore establishes a four-term feasible completion under the supplied assumptions.
Read the rows in both directions. Forward reading asks what becomes eligible next. Backward reading asks what must already be complete for the final module. E in term 4 requires D earlier; D in term 3 requires B and C earlier; those depend on A. The same relationships should remain visible whichever direction the explanation takes. This is a stronger check than merely finding thirty credits across four rows.
CHAPTER 6 OF 20 · Construct and defend a plan
6. Explain why the baseline cannot finish in three terms
A feasible four-term plan establishes that four terms are sufficient within the model. To establish that four is the earliest possible finish, we also need a reason that fewer terms cannot work.
The chain A, B, D, E supplies that reason. Its four modules must occupy four strictly increasing term numbers. Each lasts a full term, and the learner cannot begin before term 1. E therefore cannot finish earlier than term 4. The alternative chain through C gives the same bound.
Our schedule reaches that lower bound, so four terms is optimal for this stated model. The proof combines an impossibility argument with a matching feasible construction. Neither part should replace the other.
The three-term credit calculation remains correct as a weaker lower bound. It was never a feasible schedule. More spare credit capacity in terms 1 or 4 does not remove a prerequisite relationship. This is a useful interpretation of unused space: it may be available for other permitted learning, but its existence does not demonstrate that the required sequence can be compressed. The limiting relationship is order, not merely the total amount of credit.
A term count is also different from elapsed calendar time. For a separate fictional calendar, let term 1 run from week 0 to week 12, term 2 from week 20 to week 32, term 3 from week 52 to week 64 and term 4 from week 72 to week 84. A baseline beginning at week 0 and finishing at the end of term 4 spans eighty-four weeks, even though the four teaching periods total forty-eight weeks.
Multiplying four by twelve counts the represented teaching duration. It omits the gaps between terms. That calculation is not wrong when teaching weeks are the intended quantity; it is wrong when labelled the elapsed time from entry to completion. A real plan needs actual dates and the relevant completion or award definition.
The distinction becomes useful when comparing an additional session or a different entry point. An extra term label does not necessarily represent the same calendar delay in every programme. Keep the event that defines the end, such as completing the final requirement, separate from another event such as formal award processing. This fictional calendar supplies no rule about either event at a real institution.
CHAPTER 7 OF 20 · Construct and defend a plan
7. See why missing one start can cost two terms
Suppose A is not taken in term 1 and every other fictional rule remains unchanged. A’s next available odd term is 3. B and C then first become possible in term 4, D and F in term 5, and E in term 6.
The finish shifts from term 4 to term 6. Missing the first offering did not simply add one term to the original plan. The learner had to wait for the next permitted occurrence of the foundation module, and its dependent chain moved with it.
This is a scenario calculation, not a prediction of what a real student will experience. A real institution might have another session, an approved equivalent or different progression arrangements. Those possibilities need verification before they enter the plan.
The useful question is which opportunities are time-sensitive because later requirements depend on them. A student need not treat every elective as equally urgent. Identify the modules whose next eligible offering changes the completion path, then ask precise questions about confirmed availability and any legitimate alternatives. A planning model can make that advice conversation clearer without pretending to grant an exception or reserve a seat.
CHAPTER 8 OF 20 · Construct and defend a plan
8. Rebuild the plan after an unsuccessful prerequisite
Now return to the baseline, but suppose B is attempted in term 2 and is not passed. C is passed. Under the invented repeat rule, B may next be taken at its normal even offering in term 4.
D cannot be taken in term 3 because it requires both passes. F can still be taken then because it requires C alone. After B is passed in term 4, D can occur in term 5 and E in term 6. The earliest final completion moves to term 6 under this scenario.
Do not describe every other module as blocked. C’s successful completion still permits F. Accurate dependency tracing reveals both the affected chain and the work that remains possible. That can produce a more useful recovery conversation than a general statement that the whole programme has stopped.
Actual repeat, progression, standing and support rules must come from the institution. The fictional example supplies one rule so we can examine its consequence. For learning, ask which arrow caused the later finish and which unaffected branch can continue. The aim is a precise revised plan, accompanied by questions for appropriate advice, rather than an unsupported judgement about the learner’s ability or future.
A changed logical connector can alter that recovery sequence. In another explicitly fictional version, suppose D requires B or C rather than both, while B remains a separate graduation requirement. With C passed in term 2, D and F can then occur in term 3. B can be repeated in term 4 alongside E, so all requirements can be completed by term 4 if both attempts succeed.
B has not disappeared from the degree. Its role as a prerequisite changed, while its role as a required module remained. This is why a learner should keep the graduation checklist and the prerequisite relationships connected but distinct. Removing an arrow is not the same action as removing a requirement. The alternative is useful only because the rule was supplied explicitly; it is not a suggested interpretation of an ambiguous real catalogue.
CHAPTER 9 OF 20 · Test changed progression rules
9. Check branches that become critical later
In the original baseline, F finishes in term 3 while the programme finishes in term 4. It therefore appears less urgent than E. That observation depends on F actually being completed at the planned offering.
Suppose the learner does not take F in term 3, while D and E proceed as before. F’s next odd offering is term 5. The finish now becomes term 5 because all six named modules are required. A branch that was not controlling the baseline finish can become controlling after a change.
This is why a plan should track the whole remaining requirement set. Protecting the longest-looking chain while forgetting another required module can leave a late surprise. A module’s role is a relationship within the current plan, rather than a permanent label attached to it.
For a practical paper check, highlight the final completion term of every branch. After changing any offering or registration assumption, update those highlights. The programme finish is the latest required completion, not the finish of the branch that received the most attention. This simple discipline also makes the plan easier to review with an adviser because the remaining requirement is visible by name.
CHAPTER 10 OF 20 · Test changed progression rules
10. Add a tighter load limit and compare actual choices
Consider a new version allowing only one module per term. Six modules now require at least six terms by counting alone. The earlier four-term schedule is no longer permitted because terms 2 and 3 each contain two modules.
One feasible six-term sequence is A in 1, C in 2, F in 3, B in 4, D in 5 and E in 6. Every offering and prerequisite condition holds. Since six modules cannot fit into fewer than six one-module terms, this sequence is optimal within the new model.
Choosing B before C can give a slower sequence: A in 1, B in 2, C in 4, D in 5, E in 6 and F in 7. Term 3 cannot hold C because C runs only in even terms; F is not yet eligible. The final result is seven terms.
| One-module-limit plan | Term sequence | Final term |
|---|---|---|
| C before B | A1, C2, F3, B4, D5, E6 | 6 |
| B before C | A1, B2, empty3, C4, D5, E6, F7 | 7 |
Both plans respect the rules. Only the first reaches the six-term lower bound. Picking any currently eligible module is therefore not a universal earliest-finish strategy. The choice changes which later opportunities become available.
CHAPTER 11 OF 20 · Test changed progression rules
11. Keep prerequisite and corequisite meanings separate
A prerequisite in this article means earlier successful completion. A corequisite can define a different permitted relationship, such as concurrent study, depending on the institution’s actual rule. A planning diagram should preserve that distinction explicitly.
For a separate fictional example, O, P and Q are available every term, with a two-module load limit. P requires O. Under a strict P-before-Q rule, the chain requires O in term 1, P in 2 and Q in 3. If the supplied rule instead permits P and Q together after O, O can occur in 1 and both later modules in 2.
The shorter schedule follows from a changed rule, not from more efficient arithmetic. It would be wrong to apply it to the original strict chain without authority. Equally, forcing an earlier-pass relationship onto a genuine concurrent rule can overstate the delay.
Ask what the condition actually requires: completion, a specified result, concurrent registration or another documented relationship. Do not translate a catalogue abbreviation into an arrow until its meaning is known. Where rules are unclear, mark the relationship unresolved and obtain the responsible academic answer. The model should clarify the question rather than silently settle an institutional interpretation.
CHAPTER 12 OF 20 · Test changed progression rules
12. Separate recognised credits from prerequisite clearance
Credit recognition and permission to enter a later module answer related but different questions. Thirty recognised credits might reduce the total remaining credit requirement without establishing that a particular named prerequisite has been satisfied. The actual recognition decision matters.
In our fictional ledger, suppose a record explicitly recognises A as passed for progression before term 1. B and C still run only in even terms, so their earliest offering is term 2. D and F remain in term 3, followed by E in 4. Recognising A does not automatically advance this particular finish because the offering calendar still constrains the next step.
If instead the learner starts in term 2 with that same explicit A clearance, B and C can begin immediately. The effect of recognition depends on the starting point as well as what was recognised.
For a real transfer or programme change, keep the official decision with the plan. Identify the named requirement, credited amount, progression effect and any conditions. Do not infer equivalence from a similar title or a general credit total. A clear distinction helps the learner ask whether the unresolved issue is credit counting, prerequisite readiness, an offering date or registration permission.
CHAPTER 13 OF 20 · Check timing and transfer
13. Distinguish a catalogue entry from a confirmed offering
A module can be listed in a catalogue without being offered in every teaching period. The UBC Okanagan Academic Calendar introduction explicitly notes that not all listed courses run each year. Its registration guidance also explains prerequisite requirements in its own setting.
These are examples of why availability and eligibility need separate checks. They do not supply Alder College’s invented alternating pattern or establish another university’s current rules. Read the responsible institution’s information for the actual programme.
A useful plan distinguishes confirmed, expected and unknown offerings. A conditional future schedule can still be valuable, provided its dependence on an unconfirmed module remains visible. It should not acquire the appearance of an approved graduation plan simply because every cell contains a term number.
Record when the information was checked and which version of a programme requirement applies. If a later change affects a module, follow the relevant academic advice route rather than substituting a convenient old catalogue. The planning achievement is knowing which conclusion is conditional and which authoritative answer would make it firmer.
CHAPTER 14 OF 20 · Check timing and transfer
14. Evaluate alternatives through the later chain
Suppose a separate version permits either C or C-alt to satisfy D’s second prerequisite. C keeps its original even offerings. C-alt requires A but runs only in odd terms. Assume each alternative is acceptable for the later requirements being considered, as explicitly stipulated in this version.
Starting with A in term 1, C can be completed in 2. C-alt cannot follow A until term 3. D, which runs only in odd terms and requires earlier completion, would then have to wait until 5, followed by E in 6.
An alternative may therefore be academically acceptable while producing a different schedule. A preference based on content, mode or personal interest can be reasonable, but the time consequence should be visible. Do not declare one option better solely because it finishes earlier; the learner’s actual objectives and conditions still matter.
The example also shows why substitution needs its full documented scope. Does C-alt satisfy D only, or also F? If that question is unresolved, the six-module completion plan is unresolved too. Avoid inventing an equivalence that the supplied rule did not grant. Trace the alternative to every dependent requirement before treating the original module as completely replaced.
CHAPTER 15 OF 20 · Check timing and transfer
15. Add timetable conflicts as a separate constraint
The baseline places B and C together in term 2. That is permitted by the two-module credit limit, but a credit limit does not establish that their actual sessions can be attended together. A timetable conflict is another condition.
In a fictional variant, B and C each have one compulsory session at the same time, with no approved alternative. They cannot share term 2. If one moves to its next even offering in term 4, D cannot occur until term 5 and E until term 6.
The dependency-only result of four terms was conditional on a compatible timetable. Adding the conflict does not reveal an arithmetic mistake in that result; it changes the set of permitted schedules. State which constraint was added and rebuild the affected path.
Real activities can include lectures, laboratories, studios, placements or other arrangements with their own requirements. A plan should obtain the relevant official information instead of treating every module as one interchangeable block. For a learner, separate these questions: am I academically eligible, is it offered, is a place available, can the required activities fit and is the resulting load appropriate? One positive answer does not establish all the others.
CHAPTER 16 OF 20 · Check timing and transfer
16. Represent a multi-term requirement by its duration
So far, every module lasts one term. That is a modelling choice. A requirement extending across several periods needs its actual duration and progression relationship represented, rather than appearing as a one-term label because it carries one module code.
For an independent variant, replace E with two required consecutive stages, E-first and E-final. E-first follows D in an even term. E-final occupies the immediately following odd term and requires successful completion of the first stage. With D completed in term 3, the stages occupy 4 and 5. Completion now occurs in 5.
That result assumes the supplied consecutive sequence is available and permitted. If the stages have separate offering restrictions, those need to be checked as well. A placement, project or continuing requirement may require another representation.
The useful habit is to give every requirement the time structure it actually has. Credits express an academic quantity under a defined system; they are not automatically a calendar duration. A large-credit module need not span more terms than a smaller one, and a one-code requirement need not occupy just one period. Read the documented relationship rather than infer duration from the number printed beside the title.
CHAPTER 17 OF 20 · Check timing and transfer
17. Attempt a changed prerequisite schedule independently
Try a fresh fictional set before reading the answer. P has no prerequisite and runs in odd terms. Q requires P and runs in even terms. R requires P and runs every term. S requires both Q and R and runs in odd terms. T requires S and runs in even terms. The learner starts in term 1 and may take two modules per term.
P can be taken in 1. Q and R can share 2. S follows in 3, and T in 4. The chain P, Q, S, T requires four strictly ordered terms, so the feasible plan reaches the four-term lower bound.
Now change only R’s offering pattern to odd terms. After P in 1, R’s first eligible offering is 3. S cannot share that term because R must already be passed. Its next odd term is 5, with T in 6. Q can still occur in 2. The revised finish is 6.
For a final check, restore R’s every-term availability but start the learner in term 2. P first occurs in 3, Q and R in 4, S in 5 and T in 6. Explain which delay came from the entry point and which came from the changed R offering. Identical final term numbers can arise from different constraints.
CHAPTER 18 OF 20 · Check timing and transfer
18. Make the plan useful for an academic conversation
A dependable record preserves the applicable programme requirements, completed named modules, recognised equivalences, prerequisites, offering evidence, durations and shared constraints. It distinguishes an illustrative plan, a conditional plan and an institutionally confirmed arrangement.
For checking, account for every remaining requirement once. Verify each prerequisite arrow, offering term and load. Then examine timetable, place availability and any other relevant conditions. If claiming an earliest finish, give both a feasible schedule and a justified lower bound. If those do not meet, report the gap rather than call the first schedule optimal.
The repair route begins with reading a prerequisite correctly. Stabilisation adds a small term ledger and an independent forward-and-backward check. Extension examines alternative modules, shared load and uncertainty about future offerings. Bring the first unresolved relationship to the relevant adviser with the evidence attached.
The Education parent guide connects this approach with independent transfer. The aim is a student who can explain why the sequence works, revise it when a condition changes and recognise which decision remains with the institution. A useful plan supports that conversation; it does not replace it.
CHAPTER 19 OF 20 · Answer questions and continue
19. Questions about prerequisites and completion time
Does enough remaining credit capacity prove an early finish?
No. It supplies one constraint. Required order, offering times, durations and shared conditions may impose a later finish. A complete feasible schedule is needed before an arithmetic credit bound can be described as achievable.
Is the longest prerequisite chain always the completion time?
It can give a lower bound under the specified duration rules. Offering gaps, load limits and other constraints can require more time. In the baseline, a feasible schedule reaches the bound; that matching construction is what completes the argument.
Can I take a prerequisite and its later module together?
Only if the actual rule permits that relationship and the other registration conditions are met. Our strict earlier-pass examples do not permit it. A corequisite or approved exception needs its own documented interpretation.
Will an exemption necessarily shorten the programme?
Not necessarily. It depends on what is recognised, what becomes eligible and when the remaining requirements run. The fictional A recognition leaves the original finish unchanged because the next modules still wait for even terms.
Does a future catalogue listing reserve a place?
No such conclusion follows. Availability, registration eligibility, capacity and confirmation are separate evidence questions. Use the responsible institution’s current arrangements for the real programme.
What should I bring to an adviser?
Bring the applicable requirement list, your relevant completion or recognition records, a proposed term sequence and the precise unresolved conditions. This makes it easier to discuss a concrete alternative instead of relying on a hopeful total-credit calculation.
CHAPTER 20 OF 20 · Answer questions and continue
20. Continue through programme, evidence and source routes
Understand the programme and its choices
Return to The Gold Standard of Universities for teaching, support and institutional responsibility. The International Courses and University Fit Hub supports a broader course comparison. Changing a university major raises the separate questions of approval, recognition and transition.
To read the evidence behind the plan, use Reading a University Module Description, Reading a Programme Handbook and Reading a Course Registration Guide. Those guides explain the language and administrative conditions. Dependency Timing develops the broader readiness principle; this lesson adds explicit offering calendars and independently checked schedules.
Keep outcome comparisons distinct from schedules
Cohort Mix and Outcome Comparisons and Graduate Outcomes with Missing Responses examine the evidence behind institutional percentages. Neither a favourable percentage nor a famous name establishes that one particular module sequence fits a student’s circumstances.
Check the official course information
The UBC Okanagan catalogue introduction and registration guidance illustrate why course availability and prerequisites need explicit attention. Source routes checked on 22 October 2026. Every Alder College module, sequence and transfer task here is an original hypothetical construction, rather than advice about UBC or another institution’s specific degree plan.
Use How X Works for wider learning connections. For an actual completion plan, return to the current programme information and the responsible academic adviser with the conditions of the proposed sequence visible.