Python Level 3 Course Material

Class Videos

1. Introduction and Learning Objectives
2. Dictionaries – A first introduction
3. Accessing dictionary values — get method
4. Important Points about dictionary keys
5. Creating a dictionary from a list of keys
6. A pictorial overview of the data structures and logic for creating the store inventory
7. Creating and populating the master dictionary
8. Creating and populating the master dictionary (Alternative Implementation)
9. Code to create the store’s inventory
10. Getting User’s preference and capturing it in a dictionary
11. Generating the QUERY from the user’s preferences
12. Applying the Query in the NO PREFERENCE case using List Comprehension
13. List Comprehension to Apply the Query when user has indicated some preferences
14. Displaying the Laptops that Meet the User’s preferences
15. Reflection and Looking Back at the data structures used in the project
16. A general discussion on Lists and Dictionaries and their usages.

Enhancement Ideas/Videos

Improvements to the Inventory

1. Brand Model Mapping

2. Pricing Based on Specifications

Improvements to the User Interface
1. Showing Options while indicating Laptop preferences

2. A cleaner and more efficient user interface

3. Allowing multiple comma-separated preferences

4. Allowing a range of values in preferences

Improvements to the final display
1. Displaying Selected Laptops in a SORTED manner

2. Displaying different brands in different colors

Class Material and Notes

Class Notes , Class Project (GITHUB)

• Introduction to Dictionaries
• Basic Dictionary Commands
• Using Dictionaries in code
• Lists vs Dictionaries
• map statement

Independent Activity

Activity and Marking Criteria

Create a REPL (python) which emulates a laptop/product store where customers can choose their products based on the specifications of their choice.

Leaderboard

Class Videos

1. Introduction and Learning Objectives
2. An introduction to Comma Separated Values (.CSV) files
3. CSV.dictreader() method to convert the .csv file to a list of dictionaries
4. List slicing and keys() method to extract the relevant keys
5. A high level overview of the gameplay logic
6. Setting up the gameplay with a while loop
7. A function to format and display the keys and values of player card dictionary
8. A mapping dictionary to facilitate the user interface
9. Using the mapping dictionary to get the key of interest from the player/computer
10. A flexible function to determine the winner of every move
11. A closer look at the default argument in a function and its usage
12. Calling the determine winner function as part of the game loop
13. Redistribute the cards to the player/computer/table at the end of a move
14. Getting the game to be over and discussion of enhancement ideas

Class Material and Notes

Class Notes
Class Project (GITHUB)
Skyscrapers.csv

Key Learning Objectives

1. Further exploration and practice with dictionaries.
2. Reading data from external files

Bonus Videos

Training Mode

1. Showing the BEST card for EVERY category as part of the Training Phase
2. TOP FEW cards of EVERY category in table form in the Training Phase
3. Showing the statistics of EVERY category in the Training Phase

Robust Game Play – Making the game play more robust

Ranking Cards

1. Determining a card’s rank in a given category
2. Determining a card’s strength (strong, moderate, weak) based on all its ranks
3. Number of strong/moderate/weak cards in a card deck

Making Computer Smart – Making the Computer Smart

Enhanced Gameplay – Gameplay with more cards exchanged in every move

Independent Activity

Activity and Marking Criteria

Leaderboard

Class Videos

1. Introduction and Learning Objectives
2. A bird’s eye view of the code flow
3. Using *args to allow multiple arguments into a function
4. Using the tuple called args inside a function to result in a flexible implementation
5. What are tuples? Similarities and Differences with Lists
6. Using try/except in the short code function to catch non-string arguments
7. What are Syntax, Logic and Runtime errors in Python?
8. Common Python exceptions and handling TypeError in our function
9. Adding an index argument to our short form function
10. The general form of try/except: try/except/else/finally, with example
11. What are **kwargs? (Keyword Arguments)
12. Creating a name_strength function that accepts keyword arguments
13. Handling Key Error in the name strength function
14. Using *args and **kwargs in the same function
15. An overview of the use of **kwargs in the Validate function
16. What is assert statement and what causes AssertionError?
17. Using try/except/else and assert statements to develop the validate function
18. Deep Validate function — Raising Errors with the RAISE statement
19. Calling Deep Validate from the validate function using try/except/else/finally

Class Material and Notes

Class Notes
Class Project (GITHUB)

Key Learning Objectives

1. *args and **kwargs arguments
2. An introduction to tuples
3. Handling and Raising Exceptions Across functions

Bonus Videos

1. README file in a .MD format
2. FILE NOT FOUND error
3. Raising CUSTOM Errors
4. Use of DATETIME module in the Deep Validation Stage

Independent Activity

Activity and Marking Criteria

Leaderboard

Project Showcase

Class Videos

1. Introduction and Learning Objectives
2. Creating our first recursive function call
3. Analysis of how the recursive function to draw squares works
4. Reversing the order of drawing and recursive calls when drawing squares
5. Two more examples for recursion: Countdown and Sum of Numbers
6. Some variations for the recursive squares function to get new patterns
7. The magic created by 2 or 3 recursive calls in the squares function
8. How do the two successive recursive calls create an intricate pattern?
9. An introduction to the tree fractal pattern
10. Analysis of the Tree Pattern and its similarity to the Squares pattern
11. Recursion to draw the right side branch of the tree pattern
12. Re-aligning and bringing the turtle back to draw the left branch
13. Code for drawing the complete tree with two recursive calls
14. Generating Fibonacci Numbers with two recursive calls

Bonus Videos

Enhancements to the Square Fractal Pattern

1. Creating Levels in square pattern
2. Different levels in different colours
3. Placing the squares in a step formation
4. A tilt for all the squares in the square fractal

Dancing Animation – A dancing animation in the square pattern fractal

Colorful and Realistic Trees

1. Making tree colorful — branches, leaves, fruits
2. Unequal left and right angles in the Tree

Tree in the wind animation

1. Animation to make tree move in the wind
2. Adding randomness to the tree construction

Special Tree Patterns

1. Three branches in the Tree pattern
2. Tree fractals using the Golden Ratio

Independent Activity

Activity and Marking Criteria

Create a project in Python Turtle which draws a fractal using recursion.

Leaderboard

Project Showcase

Class Material and Notes

Class Notes
Class Project (GITHUB)

Key Learning Objectives

1. Recursion — Functions that call themselves
2. An understanding of fractals

Class Material (Live Quiz)

Key Learning Objectives

1. Revise the concepts covered so far with an interactive quiz.  
2. Provide students a chance to consolidate their learning and build an independent project of their choice.

Independent Activity

Activity and Marking Criteria

Leaderboard

Class Videos

1. Introduction and Learning Objectives
2. Preparing CSV data for Wimbledon and French Open winners
3. Using CSV module to convert the data into a list of dictionaries
4. Open Analysis.dat for writing the analysis results (mode = ‘w’)
5. Getting a list of winners and the set of unique winners using the SET() command
6. What are sets? How do we create them? What are their important properties?
7. Comparing Lists/Tuples/Dictionaries and Sets in Python
8. Writing a line of analysis in the analysis.dat file (mode = ‘a’)
9. Extracting player info for every winner to a list of dictionary
10. A function to write a table of data into the analysis.dat file
11. Creating a subset — Players who have won the Wimbledon more than once
12. Converting the analysis code to a function so that we can reuse it easily
13. Introducing comparative analysis using Wimbledon and French Open datasets
14. A function to write values from a set to our analysis.dat file (mode = ‘a’)
15. Union of sets to find players who have won EITHER Wimbledon OR French Open
16. Intersection of sets to find players who have won BOTH Wimbledon And French Open
17. Difference to find players who have Wimbledon but not French Open or vice-versa
18. Symmetric Difference for players who have won Wimbledon or French Open, not both
19. Wrapping up with an important formula from SET theory in mathematics and bonus ideas

Class Material & Notes

Class Notes, Class Project (GITHUB)
Wimbledon.csv
FrenchOpen.csv

Key Learning Objectives

1. Introduction to sets
2. Uses of set operations

Bonus Videos

Presentation of the Analysis Results
1. Presenting Analysis Results in a sorted order
2. A discussion on LAMBDA statements in the sorted function

More metrics in the Analysis
3. Country Centric Analysis
4. Longest Winning streaks for more than once winners
5. Including Runners-Up and Finalist analysis

Flexible Comparative Analysis

6. A flexible comparative analysis (motivation, big/picture)
7. A flexible function to do UNION of any number of sets
8. A flexible function to do INTERSECTION of any number of sets
9. Find ONLY ONE TOURNAMENT winners from any number of sets
10. Find SYMMETRIC DIFFERENCE winners from any number of sets

Include US Open and Australian Open

11. Include US Open and Australian Open in the analysis
12. Presenting a consolidated picture of all the Grand Slam tournaments

Independent Activity

Activity and Marking Criteria

Write a Python program that demonstrates the uses of set functions to do analysis of data.

Leaderboard

Project Showcase

Class Videos

1. Introduction and Learning Objectives
2. Counting with Binary Numbers
3. Converting between Decimal and Binary Numbers
4. A big picture view of bitwise operators
5. Three basic SINGLE bit operators: OR/AND/XOR
6. Bitwise AND
7. Bitwise OR
8. Bitwise XOR
9. Compare and contrast bitwise AND/OR/XOR with other operators
10. Some interesting special cases — AND/OR/XOR with all 1s and all 0s
11. Bitwise RIGHT shift operators
12. Bitwise LEFT shift operators
13. Using Pixels of an image to visualise the bitwise operators
14. A description of the Activity that we will perform
15. Setting up the LED matrix emulation using Python Turtle
16. Lighting up the LEDs based on the binary representation of the pattern
17. Setting up an outer loop to create dynamic patterns
18. Dynamic LED Pattern Using LEFT shift
19. Dynamic LED Pattern Using RIGHT shift
20. Dynamic LED Pattern Using Bitwise XOR
21. Dynamic LED Pattern Using Bitwise OR

Class Material and Notes

Class Notes , Class Project (GITHUB)
Raw Image

Key Learning Objectives

1. Bitwise operations in Python

Bonus Videos

Functions using bitwise operators

1. Left Shift and Clip Function
2. A function to swap two bits in a number
3. A function to reverse the bits of a number

Circular Shifts

4. Circular Left Shift
5. Circular Right Shift

1D LED pattern enhancements

6. Displaying the value of the pattern along with the LEDs
7. Lighting up the LEDs in a bit reversed pattern update
8. Lighting up the LEDs in a GRAY Coded Manner

Hexadecimal Numbers

9. Hexadecimal Numbers

Color LED patterns

10. Static RGB colors to the LEDs using bitwise operators
11. Every LED in a different color using bitwise operators
12. Dynamically changing colors for every LED
13. Two dimensional dynamic LED patterns
14. Two dimensional dynamic LED patterns with color changes

Independent Activity

Activity and Marking Criteria

Create a Python program that illustrates bitwise operations through manipulations on a monochrome image.

Leaderboard

Project Showcase

Class Videos

1. Introduction and Learning Objectives
2. Setting up the game screen — World Coordinates
3. A function to draw the game board
4. Creating a 2D list (a list of lists) to describe the board
5. The concept of SHALLOW Copy in Python
6. Drawing the board according to the items of the 2D list
7. Function to determine the lowest available row in a given column
8. Function to determine the open columns on the board
9. Creating the player turn using the sreen.onclick() method
10. Creating the function for the computer turn
11. Implementing the game flow — alternating turns and checking for winner
12. The big picture view of the function to determine winner
13. A function to determine if all items of a list are the same
14. A function to determine horizontal winners (along a single row)
15. A function to determine vertical winners (along a single column)
16. A function to determine positive sloping diagonal winners
17. A function to determine negative sloping diagonal winners
18. Putting together the checkwinner function
19. The final gameplay and some enhancement ideas

Class Material

Class Notes, Class Project (GITHUB)

Key Learning Objectives

1. Two dimensional lists
2. Onclick statements in turtle

Bonus Videos

Enhancements to the Game Structure

1. Toss
2. Winner Notified using Turtle on the Screen
3. Winning Line Drawn on the game board

Enhancements to the Code Organization

4. A single function to determine winners in ALL directions

Game Variants

5. Anti C4 (You Get 4 in a row and you lose!)
6. Pop-Out version (You can take coins out too!)

Making Computer Smart

7. Computer Plays more in the central columns
8. Computer Identifies and plays winning moves
9. Computer Identifies and plays blocking moves
10. Computer Anticipates and Computes Ahead

Independent Activity

Activity and Marking Criteria

Create a Connect Four game played against the computer

Leaderboard

Class Videos

1. Introduction and Learning Objectives
2. Understanding the clues given during the game
3. Creating a grid of buttons in Tkinter
4. Storing buttons in a list of lists
5. Introducing the two dimensional field list
6. Sprinkling mines randomly across the minefield
7. Our approach to find neighbors of a given square
8. A function to find neighbors for the centre squares
9. Dealing with edge/corner squares when finding neighbors
10. Updating neighborhood information of each mine in the field
11. lambda statements and onClick() function to handle button clicks
12. Clicking on a square that contains a mine
13. Clicking on a square with mines in its neighborhood
14. Setting up the recursion to open up the field
15. Conditions to get the two dimensional recursion to stop
16. Determining the winner when the player has discovered all the mines!

Class Material

Class Notes, Class Project (GITHUB)

Key Learning Objectives

1. Logic in two dimensional lists
2. Application of recursion to solve a game

Bonus Videos

Code Organization

1. Organize code better with functions.

User Interface Improvements
2. Re-start Button
3. Flagging Mines with Right Click of the Mouse
4. A counter for the flagged mines on the GUI
5. Timer
6. Allowing the player to decide the size of the playing field

Minesweeper Variants: Incorrect Clues

7. LIAR variant
8. MULTPILE variant

Minesweeper Variants: Special Placements of Mines

9. BALANCE placement of mines — One mine in every row and every column
10. CLUSTERED placement of mines — A high density mine cluster in the field.

Independent Activity

Activity & Marking Criteria

Implement an interactive minesweeper in Tkinter.

Leaderboard

Project Showcase