Overview
The problems below are taken from CS 102 exams (CS 102 is the pre-requisite for CS 103). If you have significant struggles in completing these problems, please consider dropping CS 103 and take CS 102 to give you the best chance of succeeding in your CS advisers. The problems are ranked in terms of difficulty.
Basic
- Volume - Compute the volume of various shape using basic expression, math library functions, and input/output (
cin/cout) commands.
Intermediate
- Duplicates - Use loops and conditionals to determine if duplicates exist in a sequence of numbers.
- Function ID - Analyze function code and determine how to call them to produces the desired array data
Cumulative
- Within - Use arrays, loops, conditionals, and potentially functions to determine whether an x-,y-point is within a certain distance of other points.
- Cart - Implement an online-shopping cart by filling in missing parts of the provided code.
- Anagram - Tracing problem requires you to understand what various functions do and then use them appropriate to determine if one string is an anagram of another.
