Examinables in Lecture Slides
The content is divided into three parts, each marked by its own colour:
- Examinable (slides available)
- Not Examinable (slides available)
- Not Examinable (no slides available)
| Topic | Notes (pdf) | Slides with Examinable Content |
|---|---|---|
| J1 Java: Language and Platform | J1 | All slides |
| J2 Data Representation and Types | J2 | All slides |
| J3 Names, (Literal) Values, Variables | J3 | All slides |
| J4 Standard Libraries: I/O, String, Random | J4 | All slides |
| J5 Bits, Bytes and Machine Arithmetic | J5 | |
| J6 Program Structure, Statements & Expressions | J6 | All slides |
| J7 Control Flow: Loops and Conditionals | J7 | All slides |
| J8 Methods | J8 | All slides |
| J9 Syntax Oddities | J9 | All slides |
| J10 Input and Output | J10 | All slides |
| J11 Threads | J11 | |
| J12 Packages | J12 | 1–10 |
| J13 Annotations | J13 | |
| O1 Objects and Classes | O1 | All slides |
| O2 Access Control, Scope and Initialisation | O2 | All slides |
| O3 Inheritance, Overriding & Abstract Classes | O3 | 1–11, 13–17 |
| O4 Types, Interfaces, Polymorphism | O4 | All slides |
| O5 Equality, Wrapper Classes and Auto-boxing | O5 | All slides |
| O6 Enums | O6 | 1–5, 7–15 |
| O7 State and Identity | O7 | |
| O8 Generic Types | O8 | All slides |
| O8.2 Generic Methods | O8.2 | |
| P1 Editor, IDE & Command-Line | P1 | All slides |
| P2 JDK Tools | P2 | All slides |
| P3 Version Control with Git | P3 | All slides |
| P4 Clean Code | P4 | |
| P5 Robust Code: Exceptions | P5 | All slides |
| P6 Program Design | P6 | All slides |
| P7 Test-Driven Development | P7 | All slides |
| P8 Software Creation and Quality | P8 | |
| F1 Code as Data, λ-expressions | F1 | All slides |
| F2 Functional Interfaces, Default Methods | F2 | 1–12, 14–16, 20, 21 |
| F3 Functional Programming Paradigm | F3 | |
| F4 Stream Data | F4 | All slides |
| F5 Stream Pipeline | F5 | 1–15, 16–19, 21, 22, 25, 27 |
| F6 Mixing Programming Paradigms | F6 | |
| A1 Containers, Lists, Iterators | A1 | All slides |
| A2 Collection Traversal | A2 | All slides |
| A3 Algorithms: Correctness and Efficiency | A3 | All slides |
| A4 Recursive Algorithms | A4 | All slides |
| A5 Searching and Sorting | A5 | 1–10, 13, 17 |
| A6 ADT Interfaces | A6 | All slides (overlap with A1) |
| A7 ADT Implementation | A7 | 1–20 (juche is not examinable) |
| A8 Hash code, Hashtable | A8 | 1–7 |
| A9 Trees | A9 | 1–7, 19 |
| R1 GUI and Event-Driven Programming | R1 | All slides |
| R2 Scene Graph, Layout, Styles | R2 | All slides |
| R3 Properties, Events, Listeners | R3 | All slides |
| R4 Transformations & Transition Effects | R4 | All slides |
| R5 Case Studies: Splotch & Rolling Wheel | R5 | All slides |