Computational thinking and problem solving

This unit will introduce us to some of the classic approaches to problem solving in computer science.

We will learn about abstraction - modeling a complex system by only including essential details. These may include:

• modularised (structured) programming
• developing abstract data types
• developing classes - as in the Object Oriented Programming paradigm
• recursion

We will study and understand classic algorithms for searching and sorting, including:

• linear search
• bubble sort
• insertion sort

We will take a further look at how to implement an Abstract Data Type from another ADT.

We will also take a look at recursion where a function will call itself unti a base case is met.