Index

• Home
  • Timetable and lecture rooms
  • News
  • Slides
  • Office hours
  • Labs timetable
  • Tutoring
  • References
  • Exams
  • Acknowledgements
• Past Exams
  • Data science
  • 2017-18 (QCB)
  • 2016-17 (QCB)
• Slides 2020/21
  • Part A
  • Lab A.1
  • Lab A.2
  • Lab A.3
  • Lab A.4
  • Lab A.5
  • Lab A.6
  • Lab A.7
  • Lab A.8
  • Lab A.9
  • Lab A.10
  • Lab A.11
  • Lab A.12
  • Part B
  • Lab B.1
  • Lab B.2
  • Lab B.3
  • Lab B.4
  • Lab B.5
  • Lab B.6
  • Lab B.7
  • Lab B.8
  • Lab B.9
• Commandments
  • MOVED TO https://en.softpython.org/commandments.html

Part A

• Installation
  • Visual Studio Code
  • The debugger
  • VS Code - collaborative coding
  • VS Code - Sharing test runs
• Python basics
  • MOVED TO en.softpython.org/basics/basics-sol.html
• Strings
  • MOVED TO https://en.softpython.org/#strings
• Lists
  • MOVED TO https://en.softpython.org/#lists
• Tuples
  • MOVED TO https://en.softpython.org/tuples/tuples-sol.html
• Sets
  • MOVED TO https://en.softpython.org/sets/sets-sol.html
• Dictionaries
  • MOVED TO https://en.softpython.org/#dictionaries
• Control flow
  • MOVED TO https://en.softpython.org/#control-flow
• Functions
  • Download exercises zip
  • Introduction
  • Namespace and variable scope
  • Argument passing
  • Simple exercises
  • Verify comprehension
  • Lambda functions
• Errors and testing
  • Testing with Unittest
  • Functional programming
• Matrices: lists
  • Moved to https://en.softpython.org/matrices-lists/matrices-lists-sol.html
• Matrices: numpy
  • Moved to https://en.softpython.org/matrices-numpy/matrices-numpy-sol.html
• Data formats
  • MOVED TO https://en.softpython.org/formats/formats-sol.html
• Graph formats
  • Moved to https://en.softpython.org/graph-formats/graph-formats-sol.html
• Visualization
  • Moved to https://en.softpython.org/visualization/visualization-sol.html
• Pandas
  • Moved to en.softpython.org/pandas/pandas-sol.html
• Binary relations
  • MOVED TO https://en.softpython.org/binary-relations/binary-relations-sol.html

Part B

• OOP
  • Download exercises zip
  • What to do
  • 1. Abstract Data Types (ADT) Theory
  • 2. ComplexNumber class
  • 3. MultiSet
  • 3.1 __init__ add and get
  • 3.2 removen
• OOP Matrix Challenge
  • Download exercises zip
  • What to do
  • DenseMatrix
  • Constructors and printing
  • shape
  • Brackets operator
  • nonzero
  • isclose
  • Equality
  • Sum
  • Multiplication
  • SparseMatrix
  • Sparse constructors and printing
  • Sparse shape
  • Sparse Brackets operator
  • Sparse nonzero
  • Sparse isclose
  • Sparse equality
  • Sparse sum
  • Sparse multiplication
• Algorithm analysis and recursion
  • Introduction
  • List performance
  • Some formulas
  • Lists - exercises
  • Sets performance
  • Sets - exercises
  • Dictionaries performance
  • Dictionaries - exercises
  • Recursion
  • Recursion - exercises
  • Analysis - more exercises
  • Recursion - more exercises
• Sorting
  • Download exercises zip
  • Introduction
  • Exercises
  • 1 Selection Sort
  • 2 Insertion sort
  • 3 Merge sort
  • 4 quick sort
  • 5 chaining
  • 6 SwapArray
  • Challenges
• Sorting Challenge
  • Download exercises zip
  • Crime parade
  • McFat’s
  • Partitocracy
• Linked lists
  • Download exercises zip
  • 0 Introduction
  • 1 v1: a slow LinkedList
  • 2 v2 faster size
  • 3 v3 Faster append
  • 4 v4 Go bidirectional
  • 5 EqList
  • 6 Cloning
  • 7 More exercises
  • 8 Last exercises
  • Challenge
• Linked lists Challenge
  • Download exercises zip
  • rshift
  • lshift
• Stacks
  • Download exercises zip
  • 0. Introduction
  • 1. CappedStack
  • 2. SortedStack
  • 3. WStack
  • 4. Backpack
  • 5. Tasks
  • 6. Stacktris
• Queues
  • Download exercises zip
  • Introduction
  • 1. LinkedQueue
  • 2. CircularQueue
  • 3. ItalianQueue
  • 4. Supermarket queues
  • 5. Shopping mall queues
  • 6. Company queues
  • 7. Concert
  • 8. OfficeQueue
• CircularQueue
  • Download exercises zip
  • 1. Introduction
  • 2. Example
  • 3. Circular span
  • 4. Implement CircularQueue
• Binary Trees
  • Download exercises zip
  • 0. Introduction
  • 0. Introduction
  • 1. Insertions
  • 2. Recursive visit
  • 3. Stack visit
  • 4. Queue visit
  • 5. Modifying the tree
• Generic Trees
  • Download exercises zip
  • 0. Introduction
  • 1 Implement basic methods
  • 2 Implement more complex functions
• Graph algorithms
  • Download exercises zip
  • Introduction
  • 1. Implement building
  • 2. Manipulate graphs
  • 3. Query graphs
• Part B References
  • LeetCode for Part B
  • Geeks for geeks

Index