CS 202 Fall 2013 > Notes for Thursday, September 5, 2013 |
CS 202 Fall 2013
Notes for Thursday, September 5, 2013
Course Overview
Major topics.
- CS 201 Recap (Ch 1–12)
- Very quick.
- Classes (Ch 13–14)
- Encapsulating data and code together, in the form of an object: “smart data”.
- Object-Oriented Programming (Ch 15)
- In Object-Oriented Programming (OOP), we define a common interface for a group of classes. Being able to use an object in one of these classes without knowing its type. This allows for new capabilities to be added to a program while leaving most of the program (including the part that uses these new capabilities!) completely unchanged. We will take some time on this topic.
- Generic Programming & Data Structures (Ch 16–19)
- Generic programming
is programming without specifying types.
For example
vector
is written without specifying the type of an item. When we declare avector
, we must specify.[C++]
vector<double> dv; // Each item in vector dv has type double
- Recursion (Ch 19)
- Recursion happens when a function calls itself. We do this when we can solve a problem by solving a smaller problem of the same kind, along with a bit of extra work.
Chapter 20, on Binary Trees, will not be covered. We leave this material for CS 311 (Data Structures & Algorithms).
CS 201 Recap
Some important terminology.
- Build
- Preprocess/preprocessor
- Compile/compiler
- Link/linker
- Load/loader
- Ahead-of-time (AOT) compilation
- Just-in-time (JIT) compilation
- Source code
- Object code
- Executable
- Type
- Variable
- Expression
- Literal
- Operator
- Flow of control
- Loop
- Iteration
CS 202 Fall 2013: Notes for Thursday, September 5, 2013 /
Updated: 6 Sep 2013 /
Glenn G. Chappell