Networking & SecurityEngineeringFrançais

Introduction to Algorithms

NWS 119 · Semester 1

3 credits · 33 learning units

Lessons

33 beginner lessons with worked examples, diagrams and guided practice. No coding experience is required. Learn one idea, explore a small example, then check your understanding. Pause between lessons and revisit any unfamiliar idea.

Subunit titles retain the curriculum’s original language.

Shared learning sequence · NWS 119 / SWE 114. Combines complementary topics from both curricula.

Start here

  1. Lesson 1Problems, inputs, outputs and trace tablesInteractive tutorial

Curriculum topics

  1. Lesson 2Introduction to algorithmsInteractive tutorial

Build understanding

  1. Lesson 3Writing a problem contractInteractive tutorial
  2. Lesson 4Variables, expressions and assignmentInteractive tutorial
  3. Lesson 5Pseudocode, sequence and trace tablesInteractive tutorial
  4. Lesson 6Flowchart symbols and sequenceInteractive tutorial
  5. Lesson 7Conditions and Boolean logicInteractive tutorial
  6. Lesson 8Flowcharts for decisions and branchesInteractive tutorial
  7. Lesson 9Loops, counters and accumulatorsInteractive tutorial
  8. Lesson 10Flowcharts for loops and terminationInteractive tutorial
  9. Lesson 11Translating flowcharts into pseudocodeInteractive tutorial
  10. Lesson 12Arrays and sequential searchInteractive tutorial
  11. Lesson 13Queues: first in, first outInteractive tutorial
  12. Lesson 14Stacks: last in, first outInteractive tutorial
  13. Lesson 15BFS and DFS with queues and stacksInteractive tutorial
  14. Lesson 16Functions and problem decompositionInteractive tutorial
  15. Lesson 17Correctness, invariants and edge casesInteractive tutorial
  16. Lesson 18Recursion and divide-and-conquer foundationsInteractive tutorial
  17. Lesson 19Trees, graphs and paths before traversalInteractive tutorial

Curriculum topics

  1. Lesson 20Complexity analysis and measuresInteractive tutorial
  2. Lesson 21Sorting and searchingInteractive tutorial
  3. Lesson 22MergingInteractive tutorial
  4. Lesson 23Divide-and-conquerInteractive tutorial
  5. Lesson 24Tree and graph traversalsInteractive tutorial
  6. Lesson 25Greedy algorithmsInteractive tutorial
  7. Lesson 26Shortest pathInteractive tutorial
  8. Lesson 27Minimum spanning treeInteractive tutorial
  9. Lesson 28Dynamic programmingInteractive tutorial
  10. Lesson 29Branch-and-boundInteractive tutorial
  11. Lesson 30Order statisticsInteractive tutorial
  12. Lesson 31String matchingInteractive tutorial

Put it into practice

  1. Lesson 32Guided laboratory and troubleshootingInteractive tutorial

Work independently

  1. Lesson 33Independent project and reviewInteractive tutorial
Curriculum source

HND CURRICULUM-NETWORK AND SECURITY.pdf · NWS 119 · Course table: p. 8 · Outline pages: 52, 53, 54, 55

HND Computer Engineering Software Engineering Curriculum.pdf · SWE 114 · Course table: p. 8 · Outline pages: 14, 15

Correction: the Networking PDF places application development and OOP under algorithms (pp. 52–55). This shared sequence uses the Software algorithm syllabus (pp. 14–15), with introductory learning extensions.