Informatics — Grade 11

11 topics

1. 1

   Sorting algorithms: bubble sort

   Sorting puts data in order and speeds up searching. We study bubble sort, trace it step by step and see why it is slow on big arrays.

   Chapter 1. Algorithms2 min

2. 2

   Search algorithms: linear and binary

   Linear search works on any list, while binary search finds an element very quickly in a sorted array. You will learn both methods and when to choose each.

   Chapter 1. Algorithms2 min

3. 3

   Recursion

   Recursion is a function calling itself. Using factorial and Fibonacci numbers we study how recursion is built, its base case and its pitfalls.

   Chapter 1. Algorithms2 min

4. 4

   Quicksort: divide and conquer

   Quicksort splits an array into two parts around a pivot and sorts each part recursively. We look at its idea, a Python implementation and its advantage over bubble sort.

   Chapter 1. Algorithms2 min

5. 5

   Stack and queue

   A stack works on the “last in, first out” principle, a queue on “first in, first out”. We study their operations, Python implementation and uses.

   Chapter 2. Data structures2 min

6. 6

   Dictionaries and sets

   A dictionary quickly finds a value by its key, and a set stores unique elements. We study the purpose and operations of Python’s `dict` and `set`.

   Chapter 2. Data structures2 min

7. 7

   Trees and graphs

   Trees and graphs are structures that describe connections between objects. We look at their main concepts, how they are stored in Python and where they are used.

   Chapter 2. Data structures2 min

8. 8

   Database basics

   A database is an organized collection of stored data. We study the concepts of table, record, field and primary key, and the role of a DBMS.

   Chapter 3. Databases2 min

9. 9

   SQL: basic queries

   SQL is the language for working with databases. We learn the `SELECT`, `WHERE`, `ORDER BY`, `INSERT`, `UPDATE` and `DELETE` commands and how to use them in Python through `sqlite3`.

   Chapter 3. Databases2 min