Class Notes

A note on my notes

These are for my benefit. They tell me what to talk about in class. They are by no means a substitute for:

1. Attending class.
2. Reading the book
3. Taking your own notes.

• Chapter 1 Overview of Programming
  • What is programming?
  • A complete example.
  • A note on resources
  • Code for this chapter
• New class conditions.
• Chapter 2 C++ Syntax and Semantics
  • Documenting Code
  • Syntax, Data Types and Declarations
  • Executable Statements
  • Some Example Programs
  • Code for this chapter
• Chapter 3 Numeric Types
  • Integer Types
  • Integer Operations
  • A Problem
  • Floating Point Types
  • More Math
  • Some More Functions
  • Formatting Output
  • Code for this chapter
• Chapter 5 Conditions, Logical Expressions, and Selection Control Structures
  • The Boolean Data type
  • Flow of Control
  • If/Else statements
  • If statements
  • Nested If statements
  • Some Clean-Up and Testing
  • Some Extra Problems
  • The Switch Statement
  • Code for this chapter
• Chapter 6 Looping
  • Intro to Looping
  • Intro to More Looping
  • For and While-Do loops
  • Files
  • Code for this chapter
• Chapter 8 Functions
  • Introduction to Functions
  • An Example
  • A Note on Finals
  • Variables and Parameters
  • Code for this chapter
• Chapter 9 Scope, Lifetime and More on Functions

Class Recordings

• 8/25
• 8/27
• 8/30
• 9/1
• 9/3
• 9/8
• 9/10
• 9/13
• 9/15
• 9/20
• 9/22
• 9/24
• 9/27
• 9/29
• 10/1
• 10/4
• 10/5
• 10/11
• 10/15
• 10/18
• 10/20
• 10/22
• 10/25
• 10/17
• 10/29
• 11/3
• 11/5
• 11/8
• 11/10
• 11/15
• 11/17
• 11/19
• 11/22
• 11/29
• 12/1
• 12/3

The syllabus for this course contains the following topics

1. Problem Solving and Algorithm Development
   1. Strategies for Problem Solving
      1. Problem decomposition (divide and Conquer)
      2. Solution by analogy
      3. Solving a special case of a general problem
      4. Generalizing a specific solution
   2. Problem Analysis
      1. Understanding the problem
      2. Identifying the input data
      3. Describing the output representation
   3. Algorithm Representation
      1. Pseudocode
      2. Graphical Techniques
   4. Algorithm Verification
      1. Desk checking techniques
      2. Test data
2. Program Development - Methods and Style
   1. Design
      1. Procedural abstraction
      2. Data abstraction
      3. Top-down design and step wise refinement
      4. Information hiding
      5. Top-down vs bottom-up design
   2. Coding
      1. Use of structured control statements.
      2. Programming style
         1. Proper indentation
         2. Choice of appropriate names
   3. Program Correctness
      1. Generation of test data
      2. Debugging techniques
         1. Output statements
         2. Use of stubs and drivers.
      3. Top-down vs bottom-up testing
   4. Documentation
      1. Self documenting code
      2. Internal program comments
3. Data Types
   1. Scalar Data Types
      1. Primitive data types
         1. Integer
         2. Float and double
         3. Boolean
         4. Character
      2. Arithmetic, Boolean and relational operations
   2. Structures Data Types
      1. Strings
      2. Streams
4. Program Structures
   1. Control Structures
      1. Sequential structure
      2. Iterative structures
      3. Conditional execution structures
   2. Subprograms
      1. Functions
      2. Parameters
      3. Scope of identifiers