Lesson Notes By Weeks and Term v5 - Grade 11

Lesson Video

This page supports the lesson note with a companion video and a short classroom-ready summary.

For class groups and homework, share this lesson page so learners also get the summary, objectives, and full lesson context.

Performance objectives

• Apply object-oriented programming principles.
• Evaluate searching and sorting algorithms.
• Design and implement simple database applications.
• Explain ethical and societal implications of IT.
• Debug and correct errors in code.

Lesson summary

This week focuses on integrated revision and exam preparation. This isn't just about memorizing facts; it's about understanding how different IT concepts fit together and developing problem-solving skills that are essential for success in your final Grade 12 IT exam and beyond. In a digitally-driven South Africa, understanding IT is crucial for many career paths, from software development to data analysis, cybersecurity, and even entrepreneurship. Strong IT skills can empower you to participate actively in the digital economy, create innovative solutions to local challenges, and contribute to South Africa's technological advancement.

Lesson notes

This week’s integrated revision will cover object-oriented programming (OOP), searching and sorting algorithms, database concepts, and ethical implications. 2.1 Object-Oriented Programming (OOP) OOP is a programming paradigm built around "objects", which are instances of "classes." A class is like a blueprint, defining the characteristics (attributes) and behaviors (methods) of objects.

Encapsulation: Bundling data (attributes) and methods that operate on that data within a single unit (the class). It protects the data from outside access and misuse, promoting data integrity. Think of a bank account class; the balance is an attribute, and deposit and withdraw are methods. You can only change the balance through these methods, ensuring it’s done correctly.

Example (South African Context):* Consider a `Learner` class. Attributes could include `IDNumber`, `name`, `grade`, `marks`. Methods could include `calculateAverageMark()`, `checkPromotionStatus()`. Encapsulation would prevent direct modification of the `marks` attribute from outside the class, enforcing proper mark management.

Inheritance: Allows a new class (subclass/child class) to inherit attributes and methods from an existing class (superclass/parent class). This promotes code reusability and reduces redundancy. It establishes an "is-a" relationship.

Example: You might have a `Vehicle` class with attributes like `make`, `model`, `engineSize`. You could then create a `Taxi` class that inherits from `Vehicle` but adds attributes like `taxiPermitNumber` and `numberofPassengers`.

Polymorphism: The ability of an object to take on many forms. This is often achieved through method overriding (where a subclass provides a specific implementation for a method already defined in its superclass).

Example: A `Shape` class could have a method `calculateArea()`. `Circle`, `Square`, and `Triangle` classes could all inherit from `Shape` and override `calculateArea()` to provide their own specific area calculation formulas. The same method name (`calculateArea()`) performs different actions depending on the object it's called on. 2.2 Searching and Sorting Algorithms Searching Algorithms: Used to find a specific element within a dataset.

Linear Search: Checks each element in the list sequentially until the target element is found or the end of the list is reached. Simple but inefficient for large datasets.

Example:* Imagine searching for a specific learner's name in a register where names are not sorted. You'd check each name one by one.

Binary Search: Requires the dataset to be sorted. It repeatedly divides the search interval in half. If the middle element is the target, the search is successful. Otherwise, the search continues in either the left or right half depending on whether the target is less than or greater than the middle element. Much more efficient than linear search for sorted data.

Example:* Searching for a specific word in a dictionary. You open the dictionary near the middle, check the words on that page, and then move either forward or backward depending on whether the word you're looking for comes before or after the words on that page.

Sorting Algorithms: Arrange elements in a specific order (ascending or descending).

Bubble Sort: Repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The largest element "bubbles" to the end of the list in each pass. Simple but inefficient.

Example:* Sorting a deck of cards by repeatedly comparing adjacent cards and swapping them if they are out of order.

Selection Sort: Finds the minimum element in the unsorted portion of the list and swaps it with the first element of the unsorted portion. This process is repeated until the entire list is sorted.

Example:* Imagine sorting a list of exam scores from lowest to highest. You find the lowest score and place it at the beginning, then find the next lowest score and place it second, and so on.

Efficiency Considerations: For small datasets, the difference in performance between these algorithms may be negligible. For large datasets, binary search is significantly faster than linear search (O(log n) vs O(n)). Bubble sort and selection sort are relatively slow (O(n^2)) compared to more advanced sorting algorithms (which are beyond the scope of Grade 11 but good to be aware of). 2.3 Database Concepts Database: An organized collection of data, typically stored and accessed electronically.

Relational Database: A database that organizes data into one or more tables, where each table consists of rows (records) and columns (fields). Relationships between tables are established through foreign keys.

SQL (Structured Query Language): The standard language for interacting with relational databases.

Common SQL Commands: `SELECT`: Retrieves data from the database. `INSERT`: Adds new data to the database. `UPDATE`: Modifies existing data in the database. `DELETE`: Removes data from the database.