Lectures Resources
3/28 - W1a: Overview, development process, first program
3/30 - W1b: Recursion: Function calls, operators, if statements
4/1 - W1c: Control - if/else, if/else if, switch, iteration
4/4 - W2a: Arrays
4/6 - W2b: Nested loops, multi-d arrays
4/8 - W2c: Types, structs, strings
4/11 - W3a: Pointers 1: dynamically allocated arrays
4/13 - W3b: Pointers 2: parameters, 2-d arrays, pointer arithmetic
END OF MATERIAL FOR EXAM 1
4/15- W3c: Pointers 3: command-line arguments, linked structures
4/18 - W4a: Modifying Linked Lists
4/20 - W4b: Stacks/Queues
4/22 - W4c: Exam 1: basic programs, structs, pointers, arrays, strings
4/25 - W5a: More lists
4/27 - W5b: tagged unions
4/29 - W5c: Trees
5/2 - W6a:
5/4 - W6b: Binary Search Trees
END OF MATERIAL FOR EXAM 2
5/6 - W6c: Heaps
5/9 - W7a: Binary/hex/octal, bitwise ops
5/11 - W7b: bitwise operations
5/13 - W7c: Exam 2: Linked Lists, Trees, Heaps, Advanced Types
5/16 - W8a: sorting
5/18 - W8b: Array-based Trees
5/20 - W8c: Hash Tables
5/23 - W9a: Hash Tables
5/25 - W9b: Graphs
5/27 - W9c: Graphs
END OF MATERIAL FOR EXAM 2
5/30 - W10a: Memorial Day
6/1 - W10b: Exam 3: Complexity, Bases, Bitwise ops, Sorting, Hash Tables, Graphs