| Aug 29 |
How to succeed in CS 101
Lecture 1: printf, scanf, int variables |
Week1 → hello*, it goes to 11*, how many tacos?, What day is it? |
2.4, 2.5 |
| Aug 31 |
Lecture 1: printf, scanf, int variables |
Week1 → hello*, it goes to 11*, how many tacos?, What day is it? |
2.4, 2.5 |
| Sept 5 |
Lecture 2: More data types, expressions
Chapter 3 through The Modulus Operator
Lecture 3: More about variables and expressions
Chapter 3, Integer and Floating-Point Conversions to end of chapter |
Week2 → hamster years *, F to C*, Mmmm, piece of candy!*, Cost of lunch, quarters, radius of circle *, divvy up the rice* |
3.6, 3.9 |
| Sept 7 |
Lecture 4: Conditions and decisions
Chapter 5 through Nested if Statements
Lecture 5: If/else if/else statements, random numbers
Chapter 5, The else if Construct |
Week2 → Basic Double Coupon*, Simple Filter*, Restaurant check calculator*, Bank Balance*, make change
Week2 → Triple Coupon*, member discount*, Complex Filter*, grading, Smallest of 3, happy birthday, Median of three |
5.2 |
| Sept 12 |
Conditions/decisions design activity |
— |
— |
| Sept 14 |
Lecture 6: For loops, loop recipes
Chapter 4, through The for Statement |
Week3 → bananana*, Eeeeeeek*, countdown*, keep doubling*, dice rolls |
4.2 |
| Sept 19 |
Loops design activity
Lecture 7: While loops, coding style
Chapter 4, The while Statement |
Week4 → Check Input*, squares*, day numbers* |
4.11 |
| Sept 21 |
Lecture 8: Nested loops, char data types
Chapter 4, Nested for Loops |
Week4 → 111222333444*, multiplication table*, which and how many? |
— |
| Sept 26 |
Exam 1 Review |
Exam1Review → fleems, buy 3, get 1 free, plus four, triangle counting, First digit, Perfect Number |
|
| Sept 28 |
Exam 1 |
|
|
| Oct 3 |
Lecture 10: Arrays
Chapter 6 through Initializing Arrays |
Week6 → Array Scanner*, Pair sums*, Exceeded Amount, weighted average, Not like the others |
6.4, 6.7 |
| Oct 5 |
Lecture 10: Arrays cont. |
|
|
| Oct 10 |
Lecture 11: Multidimensional arrays
Chapter 6, Multidimensional Arrays |
Week7 → tic-tac-toe check*, Magic Squares |
— |
| Oct 12 |
Lecture 12: Functions, top-down design
Chapter 7 through Automatic Variables |
Week7 → PrintSum*, Deep Thought*, Find Primes |
— |
| Oct 17 |
Lecture 13: Functions that return a value
Chapter 7 through Checking Function Arguments |
Week8 → SumBetween*, MaxOfThree*, feetToMeters*, inRange*, ContainersNeeded, WeeklyPay, diamond, check_if_armstrong |
7.7 |
| Oct 19 |
Lecture 13: Functions that return a value cont. |
|
|
| Oct 24 |
Exam 2 Review |
|
|
| Oct 26 |
Exam 2 |
|
|
| Oct 31 |
Lecture 14: Arrays and functions
Chapter 7 through Multidimensional Variable-Length Arrays and Functions |
Week10 → ArraySum*, IsAscending*, countOdd*, Min Array Entry |
— |
| Nov 2 |
Lecture 15: Pointers, reference parameters
Chapter 10 through Using Pointers in Expressions |
Week10 → AddEmUp* |
— |
| Nov 7 |
Lecture 16: Struct types
Chapter 8, through Using Structures in Expressions
Lecture 17: Using structs with functions
Chapter 8, through Initializing Structures |
Week11 → find_midpoint* |
— |
| Nov 9 |
Lecture 18: Pointers to structures
Chapter 10, Working with Pointers and Structures |
Week11 → area of Rectangle*, quadrant* |
— |
| Nov 14 |
Lecture 19: Composition
Chapter 8, Structures Containing Structures |
— |
— |
| Nov 16 |
Lecture 19: Composition cont. |
— |
— |
| Nov 28 |
Lecture 20: Arrays of structures
Chapter 8, Arrays of Structures |
— |
— |
| Nov 30 |
Lecture 20: Arrays of structures cont. |
— |
— |
| Dec 5 |
Exam 3 review |
|
|
| Dec 7 |
Exam 3 |
|
|
) are challenge problems. They are harder than the normal CloudCoder exercises; completing them demonstrates significant mastery of the course topics. You should definitely try to complete these!
