Participation

Please register for the course to gain access to the Adam workspace.

Lecture Material

A1
18.2.
Organizational Matters
Slides (Print version)
A2
18.2.
Python Intro
Slides (Print version)
Notebook: JupyterHub (VPN), Github
A3
19.2.
Sorting I: Selection and Insertion Sort
Slides (Print version)
Notebook: JupyterHub (VPN), Github
A4
19.2.
4.3.
Sorting II: Merge Sort
Slides (Print version)
Notebook: JupyterHub (VPN), Github
A5
4.3.
Runtime Analysis: Introduction and Selection Sort
Slides (Print version)
A6
5.3.
Runtime Analysis: Logarithm
Slides (Print version)
A7
5.3.
Runtime Analysis: Bottom-Up Merge Sort
Slides (Print version)
A8
11.3.
Runtime Analysis: Asymptotic Notation
Slides (Print version)
Notebook: JupyterHub (VPN), Github
A9
11.3.
Runtime Analysis: Application
Slides (Print version)
A10
12.3.
Runtime Analysis: Divide-and-Conquer Algorithms
Slides (Print version)
A11
12.3.
Runtime Analysis: Solving Recurrences
Slides (Print version)
A12
18.3
Sorting: Quicksort (& Heapsort)
Slides (Print 4-on-1, 1-on-1)
A13
18.3
Sorting: Lower Bound
Slides (Print 4-on-1, 1-on-1)
A14
19.3.
Sorting: Counting Sort & Radix Sort
Slides (Print 4-on-1, 1-on-1)
Notebooks:
counting sort on JupyterHub (VPN), counting sort on Github
radix sort on JupyterHub (VPN), radix sort on Github
A15
19.3.
Sorting: Overview & Outlook
Slides (Print 4-on-1, 1-on-1)
B1
25.3.
26.3.
Arrays and Linked Lists
Slides (Print 4-on-1, 1-on-1)
Notebook: JupyterHub (VPN), Github
B2
26.3.
Abstract Data Types: Stacks & Queues
Slides (Print 4-on-1, 1-on-1)
Notebook: JupyterHub (VPN), Github
B3
1.4.
Heaps, Heapsort and ADT Priority Queue
Slides (Print 4-on-1, 1-on-1)
Notebook: JupyterHub (VPN), Github
B4
9.4.
15.4.
Hash Tables
Slides (Print 4-on-1, 1-on-1)

 

If you have problems opening a notebook on JupyterHub (although you are in the VPN), please check the instruction in the ADAM workspace.

To top