CS 101: Schedule
This page lists the reading assignments, CloudCoder exercises, and recommended textbook exercises.
Make sure that you do the readings and CloudCoder exercises for each class before you come to class! Please note that the CloudCoder exercises are very important for learning the material.
- The CloudCoder exercises marked with an asterisk (*) are required: make sure you complete these before the class for which they are assigned. The exercises not marked with an asterisk are optional, but we strongly recommend that you do them.
- The CloudCoder exercises marked with a gold star (
) 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!
The textbook exercises are optional, but are a very good way to get extra practice.
Date | Readings/Topic | CloudCoder exercises | Textbook exercises |
---|---|---|---|
Aug 23 Week 1 | 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 |
Week 1 | Lecture 2: More data types, expressions Chapter 3 through The Modulus Operator |
Week2 → hamster years *, F to C*, Mmmm, piece of candy!*, Cost of lunch | 3.6, 3.9 |
Aug 30 Week 2 | Lecture 3: More about variables and expressions Chapter 3, Integer and Floating-Point Conversions to end of chapter |
Week2 → quarters, radius of circle *, Divvy up the rice* | 3.6, 3.9 |
Week 2 | Lecture 4: Conditions and decisions Chapter 5 through Nested if Statements |
Week3 → Basic Double Coupon*, Simple Filter*, Restaurant check calculator*, Bank Balance*, make change | 5.2 |
Sep 6 Week 3 | Lecture 5: If/else if/else statements, random numbers Chapter 5, The else if Construct |
Week3 → Triple Coupon*, member discount*, Complex Filter*, grading, Smallest of 3, happy birthday, Median of three![]() |
5.2 |
Week 3 | Lecture 6: For loops, loop recipes Chapter 4, through The for Statement |
Week4 → bananana*, Eeeeeeek*, countdown*, keep doubling*, dice rolls![]() |
4.2 |
Sep 13 Week 4 | Lecture 7: While loops, coding style Chapter 4, The while Statement |
Week5 → Check Input*, squares*, day numbers* | 4.11 |
Sep 20 Week 5 | Lecture 8: Nested loops, char data types Chapter 4, Nested for Loops |
Week5 → 111222333444*, multiplication table*, which and how many?![]() |
— |
Week 5 | Exam 1 Review | Exam1Review → fleems, plus four, triangle counting, First digit, Perfect Number![]() |
|
Sep 27 Week 6 | Exam 1 | ||
Week 6 | Lecture 10: Arrays Chapter 6 through Initializing Arrays |
Week8 → Array Scanner*, Pair sums*, Exceeded Amount, weighted average, Not like the others![]() |
6.4, 6.7 |
Oct 4 Week 7 | Lecture 10: Arrays cont. | ||
Week 7 | Lecture 11: Multidimensional arrays Chapter 6, Multidimensional Arrays |
Week9 → tic-tac-toe check*, Magic Squares | — |
Oct 11 Week 8 | Lecture 12: Functions, top-down design Chapter 7 through Automatic Variables |
Week9 → PrintSum*, Deep Thought*, Find Primes![]() |
— |
Week 8 | Lecture 13: Functions that return a value Chapter 7 through Checking Function Arguments |
Week10 → SumBetween*, MaxOfThree*, feetToMeters*, inRange*, ContainersNeeded, WeeklyPay, diamond![]() ![]() |
7.7 |
Oct 25 Week 10 | Exam 2 Review | ||
Oct 25 Week 10 | Exam 2 | ||
Nov 1 Week 11 | Lecture 16: Struct types Chapter 8, through Using Structures in Expressions |
Week12 → find_midpoint* | — |
Week 11 | Lecture 17: Using structs with functions Chapter 8, through Initializing Structures |
Week12 → find_midpoint* | — |
Nov 8 Week 12 | Lecture 15: Pointers, reference parameters Chapter 10 through Using Pointers in Expressions |
Week13 → AddEmUp*, area of Rectangle*, quadrant* | — |
Week 12 | Lecture 18: Pointers to structures Chapter 10, Working with Pointers and Structures Lecture 19: Composition Chapter 8, Structures Containing Structures |
Week13 → AddEmUp*, area of Rectangle*, quadrant* | — |
Nov 15 Week 13 | Lecture 14: Arrays and functions Chapter 7 through Multidimensional Variable-Length Arrays and Functions |
Week15 → ArraySum*, IsAscending*, countOdd*, Min Array Entry | — |
Week 13 | Lecture 20: Arrays of structures Chapter 8, Arrays of Structures |
— | — |
Nov 22 Week 14 | Lecture 20: Arrays of structures Chapter 8, Arrays of Structures |
— | — |
Nov 24 - 28 Week 14 | No Classes - Thanksgiving Holidays | ||
Nov 29 Week 14 | Exam 3 Review | ||
Thu, Dec 2 | Midterm Exam 3 for Section 103 | ||
Fri, Dec 3 | Midterm Exam 3 for Section 101 & 102 | ||
Thu, Dec 09 | Final Exam for Section 103 @ 10:15 AM - 12:15 PM | ||
Fri, Dec 10 | Final Exam for Section 101 @ 8:00 AM - 10:00 AM | ||
Fri, Dec 10 | Final Exam for Section 102 @ 10:15 AM - 12:15 PM |