Class Notes

Notes:

• C++ strings
  • Notes
  • I found this article Here Are 5 Reasons Why You Might Suck at Programming interesting. Probably worth a quick review.
• Arrays
  • Introduction
  • A Potential Design for HW2A
  • Placing Code in Multiple Files
    • Example Code
  • Talk about dos2unix and \r\n
  • Program 2 notes
  • Problems with Arrays
    • Example Code
  • Sorting and Searching
    • Example Code
  • Multi Dimensional Arrays
    • Example Code
• Notes on Test 1
• Classes
  • Introduction
    • Some Example Code
  • Overloading functions and operators.
    • Some Example Code
  • A design problem
  • Some OO Terms
• A Few Notes on Codebocks
  • The Code from this session.
• Getting started back
• Homework 4 Ideas
  • Code March 23 and Homework 4.
• Test 2 Review
  • Class Review
  • Algorithms
  • A Recording of the session in the second class.
• A Static Array Class
  • Some Example Code
• Dynamic Memory
  • Intro to Stack, Heap and Pointers
    • A Recording of the second class
  • Pointers
    • Recording of the second class
    • Some Example Code
  • Member Functions Required for Classes with Dynamic Memory
    • A Recording of the second class
  • The Dynamic Array
    • A recording of the second class
    • Some Example Code
• Stacks/Queues/Lists
  • Overview
  • Basis for Dynamic Implementation of List, Stack and Queue
  • A simple list implementation
    • A recording of the second class
    • Example Code
  • A quick look at GDB
  • Maintaining an ordered list.
    • Example Code
• Recursion
  • Introduction
  • Binary Search and Merge Sort
  • Example Code
• Simple User Defined Types
  • typedef (Covered in 2d Arrays)
  • enum
• Programming Methodology (An all semester activity)

Course outline

1. Programming Methodology
   1. Specification
   2. Design
   3. Coding
   4. Testing
   5. Documentation
2. User-defined Data Types
   1. Scalar Types
      1. Enumeratted Types.
      2. Sub Ranges
   2. Structured Types
      1. Character Strings
      2. Single and Multidimensional Arrays
      3. Records.
3. Data Structures
   1. Lists
      1. Static Array Implementation
      2. Dynamic Array Implementations
      3. Linked List Implementations
   2. Stacks
   3. Queues
4. Searching
   1. Sequential Search
   2. Binary Search
   3. Analysis of Searching Algorithm using Big-O Notation
5. Sorting
   1. N-Squared Sort, Selection Sort
   2. External Sorting, Merging of Files.
6. Recursion
   1. Examples of Recursive Algorithms.
   2. Recurion as a Programming Technique
   3. Cost of Recursion (Memory and Time Requirements)
   4. Efficiency Tradeoffs between Recursion and Iteration
7. Abstract Data Types and Object Oriented Programming
   1. Attributes and Methods
   2. Encapsulation and Abstraction
   3. Introduction to UML and Object Oriented Programming