CS:1210 Exam 2 Announcement
Exam 2 for CS:1210 "Computer Science I: Fundamentals" will be held on Apr 3rd (Friday) from 6:30 pm to 8:30 pm
in W10 PBB (Papajohn Business Building).
During the exam you can use any written material you bring, including lecture notes, Python programs,
Python documentation, etc.
Make sure you bring everything that you feel you will need to the exam because you will not be allowed to share
or borrow material with classmates during the exam.
You will have to turn off and remove from your vicinity all electronic devices including
cell phones, lap tops, calculators, dictionaries, etc.
The exam is worth 100 points, which is 10% of your final grade. Here is a brief description
of the structure of the exam.
There are 4 problems in the exam.
The first two problems are worth 20 points each and the last two problems are worth 30 points each.
For each problem, points are equally divided among multiple parts of a problem.
- Problem 1. You will be given some number of expressions and asked to evaluate these and write down
their value and type.
- Problem 2. You will be given 2 programs and asked to write down the output produced
by each of these programs. These programs will involve all of the Python we have studied this semester,
but the focus will be on list and string operations.
- Problem 3. You will be given 2 problems and for each you will be given a partially completed
program. You will have to "fill in the blanks" and complete each program in order to solve the given
problem.
- Problem 4. You will be given 2 programming problems and asked to write Python code to solve these problems.
Your code will be no longer than 10 lines long for each of the problems.
The primary (but, not exclusive) focus of the exam will be material covered
after Exam 1. This includes:
- Introduction to sequence types: lists and strings. Operations, functions,
and methods common to lists and strings.
- Reading from files.
- Lists as mutable objects. Operations that modify lists in-place.
- Selection sort.
- Binary search. Analysis of running time of binary search.
- Generating lists. The range type. List and string slicing.
- String operations.
- List comprehensions.
Please pay close attention to all the code I posted on the course website, including
homework solutions.