Course - Imperative Programming I and II HT23

Created: January 14, 2023 | Updated: September 30, 2025 | Read markdown | About these notes | View in context | Study these flashcards

---

This course was the first “standard” programming course, following from Course - Functional Programming MT22^U, although they did decide to use Scala as the programming language of choice. There are whispers of a time long ago when they taught the course using Oberon which is even more obscure.
The first part of the course was about making formal proofs on the behaviour of imperative programs using a technique called Notes - Imperative Programming HT23, Invariants^U, and proving the correctness of algorithms like binary search this way.
The second part of the course mainly focused on abstract data types and implementing different data structures like Notes - ADS HT24, Binary search trees^U. There was a lot of overlap with Course - Design and Analysis of Algorithms HT23^U.

• Course Webpage
• Course Materials
• Predecessor to: Course - Imperative Programming III TT23^U
• Significant overlap with: Course - Design and Analysis of Algorithms HT23^U
• Previous programming course: Course - Functional Programming MT22^U
• Other courses this term: Courses HT22^U

Notes

• Notes - Imperative Programming HT23, Abstract data types^U
• Notes - Imperative Programming HT23, Binary search trees^U
• Notes - Imperative Programming HT23, Bit maps^U
• Notes - Imperative Programming HT23, Hash tables^U
• Notes - Imperative Programming HT23, Invariants^U
• Notes - Imperative Programming HT23, Linked lists^U
• Notes - Imperative Programming HT23, Misc^U
• Notes - Imperative Programming HT23, Object-oriented programming^U
• Notes - Imperative Programming HT23, Priority queues^U
• Notes - Imperative Programming HT23, Scala^U
• Notes - Imperative Programming HT23, Testing^U

Problem Sheets

• Sheet 1
• Sheet 2
• Sheet 3
• Sheet 4
• Sheet 5
• Sheet 6
• Sheet 7
• Sheet 8

Lectures

Part I

• Lecture - Imperative Programming, I^U
• Lecture - Imperative Programming HT23, II^U
• Lecture - Imperative Programming HT23, III^U
• Lecture - Imperative Programming HT23, IV^U
• Lecture - Imperative Programming HT23, V^U
• Lecture - Imperative Programming HT23, VI^U
• Lecture - Imperative Programming HT23, VII^U
• Lecture - Imperative Programming HT23, VIII^U
• Lecture - Imperative Programming HT23, IX^U

Part II

• Lecture - Imperative Programming HT23, X^U
• Lecture - Imperative Programming HT23, XI^U
• Lecture - Imperative Programming HT23, XII^U
• Lecture - Imperative Programming HT23, XIII^U
• Lecture - Imperative Programming HT23, XIV^U
• Lecture - Imperative Programming HT23, XV^U
• Lecture - Imperative Programming HT23, XVI^U
• Lecture - Imperative Programming HT23, XVII^U
• Lecture - Imperative Programming HT23, XVIII^U
• Lecture - Imperative Programming HT23, XIX^U
• Lecture - Imperative Programming HT23, XX^U

Problem Sheets

• Sheet 1
• Sheet 2
• Sheet 3
• Sheet 4
• Sheet 5
• Sheet 6

---

Related posts

• Notes - Imperative Programming HT23, Priority queues^U

  (incoming)
• Notes - Imperative Programming HT23, Linked lists^U

  (incoming)
• Notes - Imperative Programming HT23, Object-oriented programming^U

  (incoming)
• Notes - Imperative Programming HT23, Bit maps^U

  (incoming)
• Notes - Imperative Programming HT23, Scala^U

  (incoming)
• Notes - Imperative Programming HT23, Misc^U

  (incoming)
• Notes - Imperative Programming HT23, Invariants^U

  (incoming)
• Notes - Imperative Programming HT23, Binary search trees^U

  (incoming)
• Notes - Imperative Programming HT23, Testing^U

  (incoming)
• Notes - Imperative Programming HT23, Abstract data types^U

  (incoming)
• Notes - Imperative Programming HT23, Hash tables^U

  (incoming)
• Prelims^U

  (incoming)
• University Notes^U

  (incoming)
• Course - Design and Analysis of Algorithms HT23^U

  (incoming)
• Lecture - Imperative Programming HT23, VI^U

  (incoming)
• Lecture - Imperative Programming HT23, XIII^U

  (sim: 0.7)
• Lecture - Imperative Programming HT23, II^U

  (sim: 0.678)
• Lecture - Imperative Programming HT23, V^U

  (sim: 0.675)
• Course - Functional Programming MT22^U

  (incoming)
• Course - Imperative Programming III TT23^U

  (incoming)