CMPT 383 Lecture Notes

1. Course Introduction [“Course Introduction” slides]
   1. This Course [This Course slides]
   2. Online Offering Strategy [Online Offering Strategy slides]
   3. Topics (1) [Topics (1) slides]
   4. Overall Goals [Overall Goals slides]
   5. Grades [Grades slides]
   6. Weekly Exercises [Weekly Exercises slides]
   7. Assignments [Assignments slides]
   8. Quizzes [Quizzes slides]
   9. Project [Project slides]
   10. References [References slides]
   11. Expectations [Expectations slides]
   12. What is a program? [What is a program? slides]
   13. Imperative Programming [Imperative Programming slides]
   14. Declarative Programming [Declarative Programming slides]
2. Functional Programming & Haskell [“Functional Programming & Haskell” slides]
   1. Haskell [Haskell slides]
   2. Haskell Basics [Haskell Basics slides]
   3. Haskell Functions [Haskell Functions slides]
   4. Pattern Matching [Pattern Matching slides]
   5. Conditionals [Conditionals slides]
   6. Repetition [Repetition slides]
   7. List Comprehensions [List Comprehensions slides]
   8. Let and Where [Let and Where slides]
   9. Recursion [Recursion slides]
   10. Isn't Recursion Slow? [Isn't Recursion Slow? slides]
   11. Tail Recursion [Tail Recursion slides]
   12. Creating Tail Recursion [Creating Tail Recursion slides]
   13. Aside: C and Tail Recursion [Aside: C and Tail Recursion slides]
3. Haskell: Types & Functions [“Haskell: Types & Functions” slides]
   1. Functions and Operators [Functions and Operators slides]
   2. Parts of Lists [Parts of Lists slides]
   3. More List Processing [More List Processing slides]
   4. Haskell Types [Haskell Types slides]
   5. Type Classes [Type Classes slides]
   6. Partially-Applied Functions [Partially-Applied Functions slides]
   7. Curried Functions [Curried Functions slides]
   8. Manipulating Functions [Manipulating Functions slides]
   9. Lambda Expressions [Lambda Expressions slides]
4. Haskell: Expression Evaluation [“Haskell: Expression Evaluation” slides]
   1. Assignment 1 [Assignment 1 slides]
   2. Lazy Evaluation [Lazy Evaluation slides]
   3. Controlling Laziness [Controlling Laziness slides]
   4. Function Application [Function Application slides]
   5. Pure Functions [Pure Functions slides]
   6. Concurrent Programming [Concurrent Programming slides]
   7. Monads [Monads slides]
   8. Monad: Maybe [Monad: Maybe slides]
   9. Monad: Random Numbers [Monad: Random Numbers slides]
   10. Haskell Tips [Haskell Tips slides]
   11. Functional Programming Context [Functional Programming Context slides]
   12. Functional + Imperative [Functional + Imperative slides]
5. What Do Processors Do? [“What Do Processors Do?” slides]
   1. What Does A Programming Language Do? [What Does A Programming Language Do? slides]
   2. What Does A Compiler Do? [What Does A Compiler Do? slides]
   3. What Do Processors Do? [What Do Processors Do? slides]
   4. Pipelines [Pipelines slides]
   5. SIMD [SIMD slides]
   6. Multiple Cores [Multiple Cores slides]
   7. Memory Cache [Memory Cache slides]
   8. Summary [Summary slides]
6. Language Implementations [“Language Implementations” slides]
   1. Language Choice [Language Choice slides]
   2. Compilers & Interpreters [Compilers & Interpreters slides]
   3. Virtual Machines [Virtual Machines slides]
   4. Compiler Optimization [Compiler Optimization slides]
   5. Just-In-Time Compilation [Just-In-Time Compilation slides]
   6. Language Implementations [Language Implementations slides]
   7. A Silly Benchmark [A Silly Benchmark slides]
7. Languages: Types & Memory [“Languages: Types & Memory” slides]
   1. Static/Dynamic Typing [Static/Dynamic Typing slides]
   2. Static/Dynamic Binding [Static/Dynamic Binding slides]
   3. Type Inference [Type Inference slides]
   4. Duck Typing [Duck Typing slides]
   5. Type Checking [Type Checking slides]
   6. Mutable/Immutable Data [Mutable/Immutable Data slides]
   7. Memory Management [Memory Management slides]
   8. Managing Memory [Managing Memory slides]
   9. Manual Memory Mgmt. [Manual Memory Mgmt. slides]
   10. Garbage Collection [Garbage Collection slides]
   11. Tracking Ownership [Tracking Ownership slides]
   12. First-Class Functions [First-Class Functions slides]
   13. Closures [Closures slides]
   14. Callbacks [Callbacks slides]
   15. Coroutines [Coroutines slides]
   16. Undefined Behaviour [Undefined Behaviour slides]
8. Languages & Concurrency [“Languages & Concurrency” slides]
   1. Concurrent Programming [Concurrent Programming slides]
   2. Threads & Processes [Threads & Processes slides]
   3. Kernel/User Threads [Kernel/User Threads slides]
   4. Thread Communication [Thread Communication slides]
   5. Language Concurrency [Language Concurrency slides]
   6. Concurrency Tools [Concurrency Tools slides]
9. Language Productivity [“Language Productivity” slides]
   1. Programmer Efficiency [Programmer Efficiency slides]
   2. Library Availability [Library Availability slides]
   3. High- vs Low-Level [High- vs Low-Level slides]
   4. Programming Paradigm [Programming Paradigm slides]
   5. Language Features [Language Features slides]
10. Languages: Mixing Languages [“Languages: Mixing Languages” slides]
    1. Foreign Function Calls [Foreign Function Calls slides]
    2. Remote Procedure Calls [Remote Procedure Calls slides]
    3. Summary [Summary slides]
11. Concurrent Programming & Go
12. Goroutines & Channels
13. Go Structs
14. Go Concurrency Patterns
15. Logic Programming & Prolog
16. Languages Matter

Course home page.

Schedule, Fall 2020

Week	Deliverables (*)	Lecture Hour	Lecture Date	First Slide	Video Link
1		1	Sep 10	Intro	1-1 (0:35)
2	Exer 1	2	Sep 15	Functional Programming	2-1 (0:48)
		3	Sep 15	Pattern Matching	2-2 (0:25)
		4	Sep 17	List Comprehensions	2-3 (0:39)
3	Exer 2	5	Sep 22	Tail Recursion	3-1 (0:47)
		6	Sep 22	More List Processing	3-2 (0:38)
		7	Sep 24	Haskell Types	3-3 (0:45)
4	Exer 3	8	Sep 29	Curried Functions	4-1 (0:47)
		9	Sep 29	Controlling Laziness	4-2 (0:47)
		10	Oct 1	Concurrent Progr	4-3 (0:46)
5	Exer 4	11	Oct 6	Monads	5-1 (0:47)
		12	Oct 6	Func Progr Context	5-2 (0:48)
		13	Oct 8	Pipelines	5-3 (0:50)
6	Exer 5, Assign 1	14	Oct 13	Language Implementations	6-1 (0:48)
		15	Oct 13	JITs	6-2 (0:48)
		16	Oct 15	Static/Dynamic Binding	6-3 (0:42)
7	Quiz 1, Exer 6	17	Oct 20	Type Checking	7-1 (0:48)
		18	Oct 20	Review/​Q&A	live stream
		19	Oct 22	Quiz 1
8	Exer 7	20	Oct 27	Garbage Collection	8-1 (0:49)
		21	Oct 27	Coroutines	8-2 (0:50)
		22	Oct 29	Language Productivity	8-3 (0:49)
9	Assign 2	23	Nov 3	RPC
		24	Nov 3
		25	Nov 5
10	Quiz 2, Exer 8	26	Nov 10
		27	Nov 10
		28	Nov 12	Quiz 2
11	Exer 9	29	Nov 17
		30	Nov 17
		31	Nov 19
12	Exer 10, Assign 3	32	Nov 24
		33	Nov 24
		34	Nov 26
13	Quiz 3	35	Dec 1
		36	Dec 1
		37	Dec 3	Quiz 3
14	Project	38	Dec 8
		39	Dec 8

* Check CourSys for the actual due dates and times.