After this module, students will be able to:

• Decompose a problem written in English into a set of simpler sub-problems.
• Implement a C function that manipulates a linked structure implemented using node structures.
• Explain how complexity is related to run-time.
• Predict the result of running a recursive function written in C.

Module Structure

• Designing Programs (4 videos, 0 exercises)
  • Discover (4 videos, 0 exercises)
    • Designing Programs Video 1: The Tic-Tac-Toe Game Problem
    • Designing Programs Video 2: Outlining a Solution
    • Designing Programs Video 3: A Function to Check the Board
    • Designing Programs Video 4: Finishing Up
• Useful C Features (2 videos, 2 exercises)
  • Discover (2 videos, 2 exercises)
    • Useful C Features Video 1: Typedef
      • Transcript
      • typedef_example.c (Example code)
    • Useful C Features Video 2: Macros
      • Transcript
      • macro_example.c (Example code)
• Function Pointers (2 videos, 2 exercises)
  • Discover (2 videos, 2 exercises)
    • Function Pointers Video 1: Introducing Function Pointers
      • Transcript
      • compare_sorts.c (Initial version)
      • compare_sorts.c (Final version for this video)
      • sorts.c (Code needed to compile examples.)
    • Function Pointers Video 2: Extending the Worked Example
      • Transcript
      • compare_sorts.c (Final version for this video)
      • sorts.c (Supporting Code)
• Compiling (4 videos, 10 exercises)
  • Discover (4 videos, 10 exercises)
    • Compiling Video 1: The Compiler Toolchain
      • Transcript
    • Compiling Video 2: Header Files
      • Transcript
      • compare_sorts.c (Example code at end of Video 2)
      • sorts.c (Example code at end of Video 2)
      • sorts.h (Example code at end of Video 2)
    • Compiling Video 3: Header File Variables
      • Transcript
      • compare_sorts.c (Example code at end of Video 3)
      • sorts.c (Example code at end of Video 3)
      • sorts.h (Example code at end of Video 3)
    • Compiling Video 4: Makefiles
      • Transcript
      • Makefile
• Exercises about Makefiles (0 videos, 6 exercises)
  • Exercises About Makefile (0 videos, 6 exercises)
• The C Preprocessor (2 videos, 3 exercises)
  • Discover (2 videos, 3 exercises)
    • The C Preprocessor Video 1: Simple Macros and Header Files
      • Transcript
      • ex0.c (Example code)
      • ex1.c (Example code)
      • ex1-b.c (Example code)
      • ex2.c (Example code)
      • ex3.c (Example code)
      • ex4.c (Example code)
      • ex5.c (Example code)
      • ex6.c (Example code)
      • ex7.c (Example code)
    • The C Preprocessor Video 2: Function-like Macros
      • Transcript
      • vm.c (Example code)
      • greater.c (Example code)
• Linked Structures and Iteration (7 videos, 4 exercises)
  • Discover (4 videos, 2 exercises)
    • Linked Structures Video 1: Introduction
      • Transcript
    • Linked Structures Video 2: Traversing a List
      • Transcript
      • traverse.c (Example code)
    • Linked Structures Video 3: Insertion into the Middle of a List
      • Transcript
      • insert.c (Example code)
    • Linked Structures Video 4: Testing Insertion
      • Transcript
      • insert.c (Example code)
  • Rehearse (3 videos, 2 exercises)
    • Doubly-Linked Lists Solution (Insert)
    • Implementing a Stack Solution
    • Doubly-Linked Lists Solution (Delete)
• Intro to Complexity (3 videos, 0 exercises)
  • Discover (3 videos, 0 exercises)
    • Introduction to Complexity Video 1: Analyzing Program Performance
      • Transcript
      • complexities.c (Example code)
      • compare_lin-quad.c (Example code)
    • Introduction to Complexity Video 2: Complexity Classes
      • Transcript
      • complexities.c (Example code)
      • compare_lin-lin.c (Example code)
      • compare_constant-lin.c (Example code)
    • Introduction to Complexity Video 3: Complexity of Sorting (A Worked Example)
      • Transcript
      • sorts.c (Example code)
      • compare_sorts.c (Example code)
• Recursive Functions (3 videos, 0 exercises)
  • Discover (3 videos, 0 exercises)
    • Recursive Functions Video 1: Introducing Recursive Thinking
      • Transcript
      • printchars.c (Example code)
    • Recursive Functions Video 2: Implementing a Recursive Algorithm
      • Transcript
      • backwards.c (Example code)
    • Recursive Functions Video 3: Generating n-bit Codes (A Worked Example)
      • Transcript
      • binstrs.c (Example code)