ENSC 251 Software Design and Analysis for Engineers |
Lecture Sets
WARNING: The following handouts do *not* represent a
complete record of what you need to know for this
course. Work will be done in class on the board for
which you will be responsible, and these notes will
not be posted. If you miss a class, you will need
to get the notes from someone.
Available Lecture Sets:
- Sep 9th: Lecture Set 0 [Introduction]
- Sep 9th: Lecture Set 1 [Programming Paradigms and Creating Custom Data Types] [**UPDATED: Sep 13, 2015]
- Sep 14th: Lecture Set 2 [Constructors, ADTs, and Inheritance]
- Sep 21st: Lecture Set 3 [Friend Functions, Constant Parameters, and Overloading Functions]
- Sep 21st: Lecture Set 4 [Arrays, Classes, Dynamic Memory, Testing & Debugging]
- Sep 28th: Lecture Set 5 [Separate Compilation and Namespaces]
- Oct 5th: Lecture Set 6 [Linked Lists, Nodes, Stacks, and Queues]
- Oct 5th: Lecture Set 7 [Recursion]
- Oct 19th: Lecture Set 8 [Inheritance (Part II)]
- Oct 27th: Lecture Set 9 [Exception Handling]
- Nov 2nd: Lecture Set 10 [Templates and Test Results]
- Nov 2nd: Lecture Set 11 [The Standard Template Library (STL)] [Updated with review questions.] Nov 3rd, 2015
- Nov 9th: In-class notes introducing [Set Notation and Theory (including practice problems)].
- Nov 16th: In-class notes introducing [Well Ordering Principle and Mathematical Induction]. Additional examples/sample problems to try for mathematical induction can be found here and here.
- Nov 16th: In-class notes introducing [Principles of Strong Mathematical Induction].
- Dec 2nd: Guest Lecture by Sylvia Lee and Maria Kaardal [How Simba does Software].
[Course Home Page]