CMSC 131 Spring 2005 Quiz 3 Worksheet
The third Quiz of the course will be on Wednesday, Feb 16 during your lab (discussion)
session. The following list provides more information about the quiz:
• You will have 25 minutes to complete the quiz.
• It will be a written quiz (not using any computer).
• It will be closed-book, closed-notes, and no calculator is allowed.
• Answers must be neat and legible. We recommend that you use pencil and eraser.
• The quiz will be based on the exercises you will find below. The quiz will ask
you to write pseudocode for a particular problem.
• We have provided last semester’s quiz solution at the end. Take a look at it so
you get an idea of the pseudocode we expect.
The following exercises include the material to be covered in Quiz #3. Solutions to these
exercises will not be provided, but you are welcome to discuss your solutions with TAs
and instructors during office hours. Keep in mind that in the following exercises you are
being asked to provide only pseudocode.
1. Write pseudocode for a program that computes the number of digits in an integer.
For example, for the integer 1776 the program will return 4.
2. Write pseudocode for a program that computes the average of a set of values after
the highest and lowest scores have been removed.
3. Write pseudocode for a program that reads a sequence of integer values and
determines whether it is a decreasing sequence. A decreasing sequence is one
where each value is greater than or equal to the next element in the sequence. The
program will first read the number of values to process followed by the values in
the sequence. The program will print the message "Decreasing" for a decreasing
sequence and "Non-Decreasing" otherwise. For example, here are two
decreasing sequences:
90 87 30 0 -1 -2
110 4 0 -20
The following are non-decreasing sequences:
90 100 20 4
30 24 -2 -1 8 9
