EE 221 Sample Programs

Note: examples have been being added and improved after the recorded course took place based on the more recent course teachings.

• Self review of the introductory programing course material
  • All EE102 examples from a recent course
• Quick C++ review, Introduction
  You should be able to follow all of these examples using your knowledge from the first programming course.
  • No comments vs. commented
  • How to use compound if-else and what to avoid
  • More selection statements
  • How long to stay in a loop
  • How to use a for loop and look for a maximum value
  • Repetition statements
  • Passing variables by value and reference
  • Illustration of purposes of using functions
• Introduction to data types
  • Predefined C/C++ types
  • Integer Overflow Problem
    • quick demo   detailed  
  • Floating Point Problems
    • overflow   overflow   underflow   roundoff   undefined  
  • Enumeration for clarity of code
  • Pointers
  • Passing by pointer (C) versus passing by reference (C++)
• Data types: arrays
  • Introduction to 1D arrays (some review, some new features)
    • no arrays
    • hardcoded
    • constants used
    • custom size
    • functions used
    • dynamic (new)
    • look-up table for ranges
  • Passing by pointer (C) versus passing by reference (C++)
  • Dynamic 1D arrays
    • 1D double allocation and deallocation
    • Memory leaks detector/debugger
    • expansion of exisitng 1D array ver. 1 (we will need it later)
    • expansion of exisitng 1D array ver. 2 (we will need it later)
    • passing pointers related to 1D dynamic arrays (optional)
  • Dynamic 2D arrays
    • 2D array allocation and deallocation
    • passing existing 2D dynamic array to functions
    • row expansion in 2D dynamic array (optional)
    • column expansion in 2D dynamic array (optional)
    • passing pointers to 2D dynamic array (optional)
  • Fill a 2D array with numbers according to a pattern (make good exercises that promote desired skills)
    • simple patterns
    • example of an algorithmic fill
  • Investigating index out of range problems (compile and test each example both in "Debug" and "Release" modes)
    • fixed 1D   static 1D   dynamic 1D  
  • Comparion of ways to handle data in 1D and 2D arrays (how do they differ?)
    • double array[]; double array[][maxs]
    • double array[maxs]; double array[maxs][maxs]
    • typedef double array[maxs]; typedef double array[maxs][maxs]
    • struct array {...};
    • double *array; double **array
    • struct array {*..}; (optional for now)
• Data types: structures
  • Simple example with a structure
  • Morse code converter in a structure
  • Examples of structures
  • Union to access data byte by byte
  • Unions in structures (computer science flavour)
  • Referencing to pointer variables within classes or structures (optional for now)
  • Initializing array and structure variables
    • initialize an array
    • use of array of structures for data processing
    • initialize structure and array of pointers to structures
  • Sample exam questions (more to come later)
    • identify complex organization   answer  
• Classes
  • A very simple multifile project and the idea of libraries
  • Timer class - introduction to object oriented programming
    • first class Time - basics, private/public data, constructors, accessing and mutating data:
      Timer.h   Timer.cpp   TimerTest1.cpp  
    • second class Time - private methods, more functionality:
      Timer.h   Timer.cpp   TimerTest2.cpp  
    • third class Time - adding const modifier:
      Timer.h   Timer.cpp   TimerTest3.cpp  
    • fourth class Time - friend functions, overloading operators:
      Timer.h   Timer.cpp   TimerTest4.cpp  
    • fifth class Time - static, volatile and advanced concepts:
      Timer.h   Timer.cpp   TimerTest5.cpp  
  • More OOP Desing Examples, some with embedded system flavor
    • Yet another Timer with more operators (optional, not elaborate and more "CS flavor")
    • Various state machines (you may want to compare with VHDL code in EE201 or EE311)
      • SleepCount
      • ToggleButton
      • RaiseButton
    • PIXel class (with a little too heavy stress on use of operators)
      • PIXel class - basic
      • PIXel class - improved
      • PIXel class - with static const
    • Sample OOP Desing vs. plain arrays and functions (may be too advanced for now. If so, then return to this example close to the end of the semester)
      Task: count occurences of character pairs
      • with three arrays
      • with an array of structures
      • with classes
      • overkilled by operator overloading
    • Partially defined class Rational (optional)
      rational.h   rational.cpp   rtest.cpp   full_test.cpp  
• String class - problem solving with strings, string implementation
  • Low-level: C-style string - \0 terminated char array and <cstring> library:
    • a short program utilizing char array strings
    • library fragments - while loop notation
    • library fragments - for loop notation
    • library fragments - pointer notation
  • Implementation of high-level: An idea for a simple string class:
    cstring.h   cstring.cpp   cstest.cpp  
  • High-level: Introduction to using the <string> library
  • A little more about strings - repetitive tasks with a string
  • A little more about strings - extracting some information
  • Discussion of approaches to extract a particular piece of string
  • Exctract the N-th column
  • Repetitive string processing examples
    count all   erase all   insert all   replace all  
  • More repetitive string processing examples
    count, erase and replace as functions   different approaches to pass a string  
  • Look for repeated lines:
    (simple but real engineering problem reported by Bradley Alumni)
    idea   improved   from file  
• Files and streams
  • Reading using gentline and operator>>
  • Reading from a file
  • Error checking on file reading
  • Recovering from reading errors
  • Text files: read and write - char array version
  • Text files: read and write - string version
  • Processing file data with parsing
    • data file: wifi.txt
    • direct stream parsing
    • parsing with string and stringstream (also homework hint)
    • parsing with char[] and stream
    • parsing with char[] and with atoi or atof
  • Prevent overwriting existing files
  • The idea of configuration files
  • Filename extensions
  • Input and output file names (optional)
  • Use an array to count something in a file (optional)
  • More in depth text file statistics (optional)
  • Now revisit the image processing homework and look at file image_io.cpp
  • Binary file processing:
    • Read the whole file into memory
    • Copy a binary file (shows read and write)
• Lists, array based lists and pointer based lists
  • Fixed-size array-based Lists
    ASList.h   ASList.cpp   ASList simple test application  
  • Dynamic array-based Lists
    ADList.h   ADList.cpp   ADList simple test application  
  • Dynamic array-based Lists - assignment operator variations
  • Testing constructor and destructor behavior
    Run the exmaples below, and then remove copy constructor and/or assignment operator and run them again:
    • without pointers - benign
    • with pointers - may crash
  • Dynamic pointer-based Lists (optional for now, we will return here from chapter 11)
    PSList.h   PSList.cpp   PSList simple test application  
• Stacks
  • The simple textbook Stack and an example of application
    Stack.h   Stack.cpp   Stack test application
  • Three simple Stacks and the same example
    Stack.h   Stack.cpp   Stack test application
  • A Stack of class-objects and the same example
    bracket.h   Stack.h   Stack.cpp   Stack test application
  • Stack of a dynamic size and a simple but thorough testing program
    Dstack.h   Dstack.cpp   Test application  
  • Sample use - MAZE program (analyzing and modification assigned as homework assignment)
    randomwalk.cpp   adapter.h   world.txt   world.h   world.cpp  
    interac.cpp   adapter.h   world.txt   world.h   world.cpp  
    maze_undo_redo.cpp - incomplete example/homework that utilizes two stacks   adapter.h   world.txt   world.h   world.cpp  
  • Stack based on linked list and a simple but thorough testing program (optional for now, we will return here from chapter 11)
    Lstack.h   Lstack.cpp   Test application  
• Queues
  • The simple textbook circular Queue with static array
    Queue.h   Queue.cpp   Queue test
  • A simple efficient circular Queue with static array
    Queue.h   Queue.cpp   Queue test
  • Queue based on linked list and a thorough testing program (optional for now, we will return here from chapter 11)
    Lqueue.h   Lqueue.cpp   Test application  
  • Problem solving with Stacks and Queues (old exam questions)
• Templates, Standard Containers and Generic Algorithms
  • Function overloading case study  
  • How to create a function template - absolute value case study
    • overloaded function
    • test version
    • final version
    • incorrect approach
  • More template examples
    • swap template
    • min and max value
  • Templates and arrays
    • 1D array of T
    • T that is a 1D array
    • 2D array of T and its limits
    • T that is a 2D array
    • Using T from an array to declare local variables
    • Initialize local T variables
    • Initialize local T variables from outside
  • Non-obvious template examples
    • passing data types in explicit way
  • Class tempates - Stack example
    • Stackt.h library
    • simple test
    • strightforward utilization
    • sophisticated utilization
    • by the way... the stack template technology was already used in your maze homework
  • Class tempates - Additional Stack examples (optional)
    • Stackt.h library
    • HTML Parser data structures
    • HTML Parser main program
  • stack<T>, queue<T> and string as as class templates - no need for new examples, vector<T> - will look at how to use it
  • Class tempates - simplified Vector example (no insert or erase functionality)
    Vectort.h library   check if it works  
  • vector<T>
    • declaring a ready to use vector
    • declaring an empty vector and resizing it
    • declaring an empty vector and growing it by appending data
    • passing vectors to functions
    • investigate size vs. capacity
  • vector<T> 2D
    • declaring a ready to use 2D vector
    • growing a 2D vector by reading data one by one
    • declaring an empty and then resizing a 2D vector
  • Introduction to vector<T> and iterators (iterators discussed much further in chapter 11)
    • iterators for sequential access
    • iterators and modifying a data collection
    • passing iterators to functions
  • Disable harmless truncated debug info warnings (for old Visual Studio 6)
  • Peek quickly into some more STL containers
    • <deque> - together: stack, queue, and iterator access through it, but no [index]
    • <map> as look-up table
    • <map> for counting occurrences
    • <set>
    • <multiset>
    • <valarray> (important)
    • <valarray> (disappointment)
  • Examples of STL use from other EE course (optional)
    • AMA_Map class:   AMA_Map.h   AMA_Map.cpp   sample map data
• Algorithms (10.5 and notes) and their Complexity (10.4)
  • Standard algorithms - universal function templates for data collections
    • count
    • find
    • replace
    • max_element
    • partial_sum
    • equals
    • find_adjacent
    • for_each (sample use)
  • How to use <algorithm> with C-style arrays
  • More examples of using iterators (old exam questions)
  • How to use with 2D data structures (optional)
  • Example of using a vector to count words in a text file
  • Recursive functions
    • Introduction
      factorial   factorial analysis  
    • Techniques
      factorial   Fibonacci   int power   base converter (reversing)  
    • Reversing printout
      base converter (reversing)   base converter   improved converter  
    • Puzzles
      question 1   question 2  
  • Evaluating algorithm complexity - utility programs for lab experiments
    (in)acurate runtime estimation   comparison of runtime ratios  
  • Evaluating algorithm complexity - evaluate the complexity of all past programs
• Linked List - Full Functionality Doubly-linked Linked List like one introduced in Chapter 6.4-5 and fully described in Chapter 11.3
  • Linked lists discussed in earlier chapters of the textbook
    • Dynamic pointer-based Lists from chapter 6
      PSList.h   PSList.cpp   PSList simple test application  
    • Stack based on linked list from chapter 7
      Lstack.h   Lstack.cpp   Test application  
    • Queue based on linked list from chapter 8
      Lqueue.h   Lqueue.cpp   Test application  
  • A simplified bidirectional linked list (in template notation) - see Chapters 6.4 and then 11.3
    sList.h library   test program  
  • An example of sorted unique binary tree concept (in template notation)
    butree.h library   test program  
• Searching (only 12.1) and Sorting (only 13.1 and 13.3)
  • Simple but slow for high data volume sorting algorithms
    • selection sort variations: see homework  
    • bubble sort   variations:   bubble-insertion sort   2-way bubble sort  
    • insertion sort variations: see homework  
  • Quicksort - example of complex but quick for high data volume
    quick sort   quick sort investigation  
  • Merge Sort Algorithm
  • sorting of structures and classes
  • Run real time sorting simulation
  • Binary Search Algorithm
  • Search for the second maximum value
• Inheritance
  • The idea of inheritance
  • Virtual inheritance
  • Bounded stack - inheritance
    • Bounded stack (non-template class based on non-template class)
      stack.h   stack.cpp   bstack.h   bstack.cpp   test.cpp  
    • Class template based on class template
      stack.h   bstackt.h   test.cpp  
    • Class template based on dynamic class template
      dstackt.h   bdstackt.h   test.cpp  
    • Non-template class based on dynamic class template
      dstackt.h   bdstacknt.h   test.cpp  
    • Class template based on STL class template (textbook version)
      bstackt.h   test1.cpp   test2.cpp  
  • Bounded stack - adaptor
    • Non-template class adaptor to STL class template
      bstacka.h   testa.cpp   (not inheritance)  
    • Class template adaptor to STL class template
      bstacka.h   testa.cpp   (not inheritance)  
  • Debug stack (non-template based on template parent)
    bstackt.h   test2.cpp  
  • Two modified list examples
    • always sorted list
    • better counted list
  • Testing constructors, destructor and assignment operator behavior in inherited classes
    • without and with virtual functions

Source code listings were prepared using Code2HTML, courtesy of Peter Palfrader.