CSC 121: Computer Science I, Spring 2005

Final Exam Topics

Variables

1. Scope
2. Lifetime
3. Local
4. Fields
5. Parameters

Classes and Objects

Selection Statements

1. If statements
2. If-else statements
3. If-else if statements
4. Switch statements

Repetitive Statements

1. While loops
2. For loops

Methods

1. Accessors
2. Mutators
3. External calls
4. Internal calls
5. Signatures
6. Constructors

Arrays

1. One-dimensional
2. Two-dimensional

ArrayLists

Stacks

Queues

File Input/Output

Classic algorithms (a few examples follow)

1. Sorting: Bubble Sort or Selection ("mystery") Sort
2. Finding max or min values
3. Finding the average
4. Interchanging values of variables

Basic understanding of our theme areas

1. Graphics
2. GUIs
3. Simulation
4. Intelligent Systems: Handwriting Recognition
5. Databases
6. Applets (Java on the Web)

Miscellaneous

1. Random numbers
2. Printing to the terminal
3. Evaluation of expressions:
   1. Arithmetic (+, -, *, /, %)
   2. Boolean (&&, ||, !)
   3. Logical (<, >, <=, >=, !=, ==)
4. Assignment
5. Data Types

Exam Format

• Writing methods and/or classes section
• Explaining what source code accomplishes or giving the output of a section of source code
• Short and medium answer section

DePauw University , Computer Science Department , Spring 2005
Maintained by Brian Howard ( bhoward@depauw.edu ). Last updated