CMPT 125 - Introduction to Computing Science and Programming II - Fall 2019
Course outline:
SFU course outlines
Topics Covered:
- Introduction to C
- Good Coding Style
- Strong typing, Memory model, Pointers
- Arrays, Strings
- Dynamic Memory Allocation
- Scope of variables
- Measuring Performance: Big-O notation
- Divide and Conquer
- Recursion
- Searching, Sorting
- Analyzing Algorithms, Assertions, Invariants, Correctness
- Abstract Data Types, Interfaces
- Stacks, Queues, Linked Lists
- Trees, Traversals
- Formal languages, Finite state automata
- Computability and Complexity
Grading:
- Exams: Midterm - 25%, Final - 50%
- Homework assignments - 20%
- Participation, quizzes - 5%
Exam:
There will be a midterm and a final exam. All exams are cumulative, on
all the material covered thus far.