CS1050301b - Computer Science Foundation Exam May 3, 2001...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science Foundation Exam May 3, 2001 Section I B No Calculators! Name: SSN: In this section of the exam, there are three (3) problems You must do all of them. The weight of each problem in this section is indicated with the problem. The algorithms in this exam are written in a combination of pseudocode and programming language notation. Any algorithms that you are asked to produce should use a syntax that is clear and unambiguous. Partial credit cannot be given unless all work is shown. As always, be complete, yet concise, and above all be neat . Credit cannot be given when your results are unreadable. KEY
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
(4, 10%) Write a recursive procedure, called prob4 , that will correctly sum the number of occurrences of a specified character c , within the first m locations of an array X . You may assume that X is a global array which includes locations that range from 1 to n and is already populated with characters. Assume that m n . You may also assume that the sum s , is initialized to 0. The initial call is
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

CS1050301b - Computer Science Foundation Exam May 3, 2001...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online