This course is the fourth of eight courses aiming to help you to become confident working with algorithms and data structure. You will learn the history of algorithms, discretisation and pseudocode and Euclidean algorithm in pseudocode.
Overview
Syllabus
- Week 1: Problems, algorithms and flowcharts - Part 1
- This week, we will cover three key concepts: problems in computer science (CS), algorithms in CS, and flowcharts.
- Week 2: Problems, algorithms and flowcharts - Part 2
- This week, we will continue covering the three key concepts: problems in computer science (CS), algorithms in CS, and flowcharts.
- Week 3: Pseudocode - Part 1
- This week, we will cover three key concepts: pseudocode, iteration and conversion from flowcharts to pseudocode.
- Week 4: Pseudocode - Part 2
- This week, we will continue covering three key concepts: pseudocode, iteration and conversion from flowcharts to pseudocode.
Taught by
Robert Zimmer
