Software EngineeringEngineeringFrançais

Advanced Data Structure I

SWE 203 · Semester 3

4 credits · 25 learning units

Lessons

22 of 25 learning units provide interactive tutorials with worked examples, diagrams, knowledge checks and subject mastery questions. Each check draws five questions from the available bank; question counts vary by unit. The remaining units provide preparation, guided practice or an independent project.

Subunit titles retain the curriculum’s original language.

Start here

  1. Lesson 1Data, operations and the cost of a solution

Build understanding

  1. Lesson 2Arrays, indices and boundariesInteractive tutorial
  2. Lesson 3Function contracts and proceduresInteractive tutorial
  3. Lesson 4Parameters, return values and mutationInteractive tutorial
  4. Lesson 5Loop invariants and terminationInteractive tutorial
  5. Lesson 6Counting operations and asymptotic growthInteractive tutorial
  6. Lesson 7Best, worst and average casesInteractive tutorial
  7. Lesson 8Recursion and the call stackInteractive tutorial
  8. Lesson 9Base cases and decreasing subproblemsInteractive tutorial
  9. Lesson 10Iteration versus recursionInteractive tutorial
  10. Lesson 11Linear search and first-match contractsInteractive tutorial
  11. Lesson 12Sentinel search and safe restorationInteractive tutorial
  12. Lesson 13Binary search on a sorted intervalInteractive tutorial
  13. Lesson 14Binary search boundary errorsInteractive tutorial
  14. Lesson 15Insertion sort and a sorted prefixInteractive tutorial
  15. Lesson 16Selection sort and minimum selectionInteractive tutorial
  16. Lesson 17Bubble sort and early stoppingInteractive tutorial
  17. Lesson 18Stability, in-place work and algorithm choiceInteractive tutorial
  18. Lesson 19Merging two sorted sequencesInteractive tutorial
  19. Lesson 20Merge sort and divide-and-conquerInteractive tutorial
  20. Lesson 21Quicksort partitioning and pivot choicesInteractive tutorial
  21. Lesson 22Correctness tests before timingInteractive tutorial
  22. Lesson 23Reproducible algorithm experimentsInteractive tutorial

Put it into practice

  1. Lesson 24Guided laboratory and troubleshooting

Work independently

  1. Lesson 25Independent project and review
Curriculum source

HND Computer Engineering Software Engineering Curriculum.pdf · SWE 203 · Course table: p. 10 · Outline pages: 38