This course introduces the fundamental concepts of algorithms and programming.
At the end of this course, the learner will be able to design algorithms and programs in a structured and well-thought-out manner.
An algorithm is a finite sequence of instructions that allows you to perform a task to solve a problem.
Sequence, condition, repetition, subroutine (procedure), variables.
A way of thinking to formulate a problem and express its solution in the form of an algorithm.
Elements of Computational Thinking
Decomposition: Understand that solving a large problem can involve breaking it down into a set of smaller problems.
Pattern recognition: Appreciate that a new problem is likely to be related to other problems the learner has already solved.
Abstraction: See a problem and its solution at many levels of detail and consider only the details that matter.
Generalisation: Realise that a solution to a problem can be made in ways that can solve a range of related problems.
Algorithms: Think of tasks as a series of logical steps.