Why Take this course?
Why did we start learning programming in the first place? To learn to problem-solve. Now that we have acquired tools like lists and understood concepts like abstraction and decomposition, it is time to put that into practice and develop better thinking skills
This course reinforces the importance of mathematical thinking and computer science where the students will be generating patterns. These will also help them think on a deeper level because of nested loops and multiple variables. We will cover modularization and abstraction to help students create a project with multiple levels and several enemies with their special properties.
A huge portion of this course will be spent on developing students’ algorithmic thinking skills, hence we will also introduce a maze-solving algorithm, which can prompt students to think about solving challenges like the micro-mouse competition.
Prerequisites:
- Students must be 10 years or older and meet the following skill qualifications.
- Successful completion of Junior Programming: Scratch Level 2 is required.
- Must be comfortable designing projects that use lists, abstraction, decomposition, cloning, and complex conditional logic.
- Experience with advanced problem-solving and logical flow beyond simple sequence is essential.
Course Outline
Learning Outcomes
- Students will have the skill set of creating patterns using nested loops.
- They will be familiar with recursive thinking and will be able to explore the names of other algorithms.
- Students will have made 5-7 projects with higher level complexity. With interconnected programs, clones, lists and will have acquired project management skills.
- Structure code effectively using access modifiers, public/private variables, and modularization techniques like functions and procedures.
- Manipulate invisible data with lists to create impressive effects like "invisible drawing" and efficient maze traversal.
- Design and solve complex mazes using advanced algorithms like backtracking and have an introduction to graph theory, understanding the strengths and limitations of each approach.

Schedule
Up Coming
Ends 29 Mar 2026
10:00 AM - 11:00 AM
4 seats left
Mishal Ahmed
Ends 29 Mar 2026
8:00 PM - 9:00 PM
5 seats left
Shuja ul Hasan
Ends 2 Apr 2026
7:00 PM - 8:00 PM
5 seats left
Shuja ul Hasan
Ongoing
Ends 9 Apr 2026
12:00 PM - 1:00 PM
Student(s) enrolled
Currently in Module 4
Usama Zaheer
Ends 9 Feb 2026
8:00 AM - 9:00 AM
1 Student(s) enrolled
Currently in Module 4
Usama Zaheer
Ends 12 Apr 2026
11:00 AM - 12:00 PM
Student(s) enrolled
Currently in Module 4
Usama Zaheer
Ends 27 Dec 2025
1:00 PM - 2:00 PM
1 Student(s) enrolled
Currently in Module 4
Usama Zaheer
Ends 19 Dec 2025
12:00 PM - 1:00 PM
1 Student(s) enrolled
Currently in Module 4
Usama Zaheer
Ends 25 Mar 2026
1:00 PM - 2:00 PM
2 Student(s) enrolled
Currently in Module 1
Mishal Ahmed
Ends 22 Mar 2026
11:00 AM - 12:00 PM
Student(s) enrolled
Currently in Module 1
Shuja ul Hasan























