| Course Information | Syllabus | Lectures | Assignments | Exams |
| Tutorial 05 - October 2 |
Dynamic memory allocation
Measuring performance of a program
Notes: [cmpt125-lab05.zip]
|
| Week 05 - October 2 |
Measuring performance of algorithms
Big-O notation
Search algorithms
Video: [YouTube link - TBD]
Slides: [cmpt125-week05.zip]
|
| Tutorial 04 - September 23-25 |
Binary representation of integers and floats
Notes: [cmpt125-lab04.zip]
|
| Week 04 - September 23-25 |
enum/typedef/struct
2-d arrays
Returning structs Pointers to functions Quine program
Pseudo-code
Recursion
- Fibonacci sequence
- Merge sort
- Flood fill algorithm
Measuring performance of algorithms
Video with the last two topics: [YouTube link]
Slides: [cmpt125-week04.zip]
|
| Tutorial 03 - September 16-18 |
file I/O
Notes: [cmpt125-lab03.zip]
|
| Week 03 - September 16-18 |
Strings
Initializing arrays and strings
scanf()
Return values and conditions
Global variables
Static variables Macros Type casting Memory allocation Execution stack Video with the last two topics: [YouTube link]
Slides: [cmpt125-week03.zip]
|
| Tutorial 02 - September 9-11 |
Passing arguments to main()
Redirecting stdin and stdout
Reading letters from input and calculating the frequencies
Notes: [cmpt125-lab02.zip]
|
| Week 02 - September 9-11 |
Data vs address
Pointers and references
Arrays
Constant variables
Strings
Slides: [cmpt125-week02.zip]
|
| Tutorial 01 - September 4 |
Basic commands in Linux
Configuring Visual Studio Code
Writing hello_world.c
Running/Debugging using VScode
Compile in terminal using gcc
Notes: [cmpt125-lab01.zip]
|
| Week 01 - September 4 |
Introduction to C
Variables and strong typing
Data vs address
Slides: [cmpt125-week01.zip]
|