Lectures Textbook Section On-Line Resources
1/6 - W1a: Overview, development process, first program 1.3-1.5, 2.1-2.5, 2.8, 12.1-12.3 C Intro, handout,
C Reference
1/8 - W1b: Function calls, operators, 3.1-3.5 Functions, handout
1/10 - W1c: Recursion, If statement 4.1-4.3, 9.1-9.3 Simple Conditionals, Recursion,
1/13 - W2a: Control - if/else, if/else if, switch, 4.4, 4.7-4.9 Complex Conditionals,
1/15 - W2b: Iteration 5.1-5.10 Loops Notes, Tutorial
1/17 - W2c: Arrays 7.1-7.4 Arrays
1/20 - W3a: Martin Luther King, Jr
1/22 - W3b: Pointers 1: functions, in, out parameters 6.1-6.5, 7.5 ******** Video, Sec 1, Sec 2: pgs1-9, 17-22
1/24 - W3c: Strings 8.1-8.4 Strings
END OF MATERIAL FOR EXAM 1
1/27- W4a: File processing 7.8-7.9, 8.5, 12.7 Files
1/29 - W4b: Pointers 2: Arrays of pointers, command-line args, 8.5, 12.7
1/31 - W4c: Structs Chap 10
2/3 - W5a: Pointers 3: Dynamic memory allocation, Linked Structures 13.1-13.4 Memory: pgs 24-31 Linked list basics
2/5 - W5b: Exam 1: conditionals, loops, basic pointers, arrays, strings
2/7 - W5c: Modifying Linked Lists
2/10 - W6a: Stacks/Queues 13.5,13.6
2/12 - W6b: More lists 13.7
2/14 - W6c: College Break
2/17 - W7a: Trees 13.8 Binary Trees
2/19 - W7b: Binary Search Trees
END OF MATERIAL FOR EXAM 2
2/21 - W7c: Heaps
2/24 - W8a: Binary/hex/octal, Bitwise ops
2/26 - W8b: Bitwise operations
2/28 - W8c: Exam 2: Linked Lists, Trees,
3/2 - W9a: Hash Tables
3/4 - W9b: Hash Tables
3/6 - W9c: Sorting
3/9 - W10a: Sorting
3/11 - W10b: Array-based Structures
END OF MATERIAL FOR FINAL EXAM
3/13 - W10c: College Reading Period
Final Exam: Complexity, Bases, Bitwise ops, Sorting, Heaps, Hash Tables Date and time according to the UChicago Final Exam Schedule. You must go to the date of your final exam.