Class Notes

Notes:

• A working environment
• An Example Assignment
  • strings.cpp our parameter discussion.
  • reader.cpp our parameter discussion.
• Data Types
  • Atomic or Simle Data types
  • String Review
  • A string project
  • Simple User Defined Types
  • Simple vs Structured Data Types
  • Structures
  • A few more Data Types
  • Code for this chapter
• Arrays
  • Introduction
  • Array Basics
  • Intro to Sorting and Searching
  • Code for this chapter
• Compiling with multiple files.
  • Notes
  • Code for this chapter
• Analysis of Algorithms
  • Notes
  • Code for this chapter
• Chapter 12, Object Oriented Programming
  • Introduction to Object Oriented
  • Introduction to Classes
  • HiHo! Cherry-O
  • Implementing HiHo! Cherry-O
  • Finshing Chapter 12
  • Code for this chapter
• Chapter 13, Lists
  • Introduction
  • Code for this chapter.
• Chapter 14, Dynamic Memory
  • Introduction
  • A dynamic array based list class
  • A linked list class
  • Code for this chapter.
• Code from the last day of class, sorry I forgot to press record.

Recordings

• 8/18
• 8/20
• 8/25
• 8/27
• 9/1
• 9/3
• 9/8
• 9/10 (Sorry, I clicked the wrong record button, this is a file on Mirkwood).
• 9/15
• 9/17
• 9/29
• 10/1
• 10/6
• 10/8
• 10/13
• 10/15
• 10/22
• 10/27
• 10/29
• 11/3
• 11/5
• 11/10
• 11/12
• 11/17

Course outline

1. Programming Methodology ✓
   1. Specification
   2. Design ✓
   3. Coding ✓
   4. Testing
   5. Documentation ✓
2. User-defined Data Types
   1. Scalar Types ✓
      1. Enumerated Types. ✓
      2. Sub Ranges
   2. Structured Types
      1. Character Strings ✓
      2. One Dimensional Arrays ✓
      3. Multidimensional Arrays
      4. 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. Recursion 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