Miscellaneous Handouts

• Course Coding Conventions

Lecture Handouts

• Course Overview
• Topic 1: Introduction to C
• Topic 2: C Recursion
• Topic 3: C Types (problems)
• Topic 4: C Pointers (problems)
• Topic 5: C Arrays (problems)
• Topic 6: C Dynamic Allocation (problems)
• Topic 7: Lists and Vectors (problems)
• Topic 8: Complexity Analysis (problems)
• Topic 9: Sorting Algorithms (problems)
• Topic 10: Abstract Data Types (no problems)
• Topic 11: Transition to C++ (no problems)
• Topic 12: Object-Oriented Programming (pp1-32, pp32-55, new p41, problems)
• Topic 13: Generic Programming (problems)

Section Handouts

(Date listed is for the Thursday section.)
• 1/22 - Section 1: Remote Access, Git, and Linux : see Tutorials 0, 1, 2 below (slides on Canvas)
• 1/29 - Section 2: Compiling and Running C Programs (slides on Canvas)
• 2/5   - Section 3: C Debugging, Testing, Formatting
• 2/19 - Section 4: State Diagrams (Pointers, Arrays, Dynamic Memory Allocation)
• 2/26 - Section 5: Linear and Binary Search (pp8-9 from Topic 8),
                              Coding with structs, malloc, and free (github)
• 3/5, Section 7: Sorting Lab
• 3/12, Section: Profiling (github, slides on Canvas)
• 4/16 Section: Object-Oriented Programming Lab, Dynamic Polymorphism Lab, handout

Programming Assignment Handouts

• Coding Conventions
• PA1: Math Functions
• PA2: List and Vector Data Structures
• PA3: Sorting Algorithms
• PA4: Handwriting Recognition System – Linear vs. Binary Search

Tutorial Handouts

• Tutorial 0: Remote Access to ecelinux
• Tutorial 1: Linux Command Line Basics
• Tutorial 2: Using Git