Computer Science with Applications 1 & 2

Send us feedback!

If you like any particular exercise, or don't like it, think it's too easy, too hard, or its difficulty is mis-classified, please let us know. Even if you just attempt an exercise, you can let us know, so we can get a feel of how many people actually try them.

Exercises:

These are ungraded exercises designed to help you absorb and practice the concepts learned in class and needed on (graded) assignments. You are not required to turn them in, but feel free to ask course staff if you have trouble with them.

Exercise 0 (Week 1)

Exercises from the book:

As with the exercises above, you need not turn in the following exercises, but you can ask course staff if the exercises give you difficulty. All of these exercises will give you practice, but some will introduce you to techniques or ideas we may not have time to cover in class.

Note that many of the exercises refer to programs within the chapter. You can either copy these directly from the book into a text file, or you can download them from the booksite.

The exercises are marked as follows:

* - Important
C - Classic
! - Interesting
!! - Cool
Exercises are also classified as either "Quick" or "In-depth". Quick ones should have very short solutions that don't require too much thought, just understanding of the material. But don't be scared by the in-depth ones -- none of them should require more than 20 lines of code.

Some extensions of the exercises are also suggested, and are numbered, for example "1.2.27X".

  Section 1.2: Built-in Types of Data (Week 1)
  Section 1.3: Conditionals and Loops (Weeks 1 & 2)
  Section 1.4: Arrays (Week 2)
  Section 2.3: Recursion (Week 3)

Practice for Midterm

Note that these exercises come with no guarantee of any kind. (For example, we don't guarantee that if you can do these then you'll do well on the midterm.) However, we think these may serve as useful practice problems that shouldn't take you too long.

Practice for Final

Note that these exercises come with no guarantee of any kind. (For example, we don't guarantee that if you can do these then you'll do well on the final exam.) However, we think these may serve as useful practice problems that shouldn't take you too long. All the practice exercises for the midterm will make good practice exercises for the final, in adddition to those below. The exercises below that are marked with a P are also good Python exercises. NOTE: the numbering of these exercises is as they appear on the booksite, not necessarily in the physical book. Each section below is linked to the corresponding page of the booksite (scroll down that page to get to the exercises):