The basic, intermediate, and advanced tags are more related to the complexity of the general topic than the specific questions in each section (i.e. there might be tough questions in a basic section and easy questions in the advanced section).

---

Basics
1. An introductory quiz (given in the fall of 2011)
2. Lots of basic early programming
3. Basic output and computation
4. Examining basic data types
5. Practice with selection (if/else, switch)
6. Quiz on functions (pdf, given in the fall of 2011, uses cout/cin instead of printf/scanf)
7. Practice with loops (for, while, do while)
8. Practice programming questions
9. Practice with reference parameters

   ---

   Intermediate
10. Practice with null terminated strings and command line arguments
11. Practice with file io
12. Practice with structs
13. Practice with algorithms
14. Practice with abstract data types

    ---

    Advanced
15. Arrays and pointers as parameters
16. Structs part 2
17. Practice with resizing arrays
18. Practice with recursion
19. Practice with two-dimensional arrays
20. Practice with linked lists
21. Pre-final practice quiz (misc. topics)

More programming practice

• Write a program that prints the multiplication tables through 20 * 20.

• Write a program that lets the user choose a positive integer, N, and then computes the sum of all integers from 1 to N.

• Write a program that displays all the leap years from the year 1900 to the year 2100 (do it by computing if it is a leap year: i.e. the year is either divisible by 400 OR it is divisible by 4 but not 100).

• Write a program that reads values written in roman numerals and displays the corresponding base-10 integer value.

• Write a program that reads an integer and displays the equivalent value in full works, e.g. 1207 becomes "one thousand two hundred seven".

• Write a program that reads an integer value and displays it backwards, e.g. if the user enters 3018 the program would then print out 8103.

• Write a program that reads an N-character word and prints the corresponding phone number, using 2 for ABC, 3 for DEF, 4 for GHI, 5 for JKL, 6 for MNO, 7 for PRS, 8 for TUV, 9 for WXY (cannot translate words containing Q or Z).

• Write a program that computes all prime numbers less than 1000.

• Write a program that displays all the fibonacci numbers less than 1000.

• Write a program that calculates what day of the week each year starts on for 1900 through 2100.

• Write a program that lets the user type in english text and produces as output the corresponding morse code.

• Calculate lottery odds: if a lottery allows you to pick M numbers out of N, what are your chances your numbers will be the exact set drawn? What are the chances all but one of your numbers will be drawn? What about all but two? (Research "N choose M" if you don't know where to start.)

• Write a program that reads in the source code of a C++ program, and determines if all the curly brackets line up correctly (i.e. there are no mismatched/unmatched brackets).

  For a first draft you may want to ignore all other kinds of brackets, and assume there are no brackets placed inside text or comments. If you're feeling ambitious afterwards, see if you can adapt your solution to handle those cases too. (Research "matching brackets" if you don't know where to start.)

• Write a program that lets two players play tic tac toe against each other (taking turns using the same keyboard).

  Next, replace one of the players with an AI opponent that plays optimally.

  Finally, write a "Suicide Tic Tac Toe" game, where the objective is to force the other person to get three in a row. (First tackle the player-vs-player version, then work on an AI.)