Crystal Run
Create your hero and escape automatic sentries. Edit the class and constructor calls, collect power cells and use Python methods to attack and heal.
Lecture 6 · Game extension of slides 31 and 32
Objects, algorithms and data structures
Create a character, follow a function call and trace a traversal. These activities connect the Python code with the data it changes.
Optional practice. Exams are based on lecture notes. This first collection covers selected examples, not every topic.
Create your hero and escape automatic sentries. Edit the class and constructor calls, collect power cells and use Python methods to attack and heal.
Lecture 6 · Game extension of slides 31 and 32
Run one rover survey, swap two base classes and see which method super() calls next.
Lecture 7 · Inheritance, overriding, type checks and super()
Step through factorial. See each call wait for a smaller call and then return its answer.
Lecture 8 · Slides 28 through 35
Insert the same items into a stack and a queue. Predict which item leaves next. Then use a stack to check matching brackets.
Lecture 9 · Longer version · Slides 25 through 43 and 49 through 56
Insert and remove nodes. Follow the changed references and test what happens when the list becomes empty.
Lecture 10 · Longer version · Slides 13 through 23
Follow the lecture DFS and BFS visit orders on the same binary tree. Try inorder and postorder as optional comparisons. This tree has no search ordering rule.
Lecture 11 · Slides 14 through 19
Still to come
Future activities can cover operation counts, binary search, recursive sums, circular queues and doubly linked lists. Middle node, reversal, cycle detection and sorting can form separate extensions.
Recorded videos are not available yet. The interactive activities let you control the pace yourself.