Scribd
Upload
15 views2 pages

American Computer Science League Classroom Division 2007 - 2008 Contest #1

The document is a set of problems from the American Computer Science League Contest for the 2007-2008 academic year, focusing on topics such as recursive functions, computer number systems, and programming evaluation. It includes tasks like converting hexadecimal to octal, evaluating expressions, and determining values after executing a program. The problems are designed for the Classroom Division and cover various computational concepts.

Uploaded by

CK
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
15 views2 pages

American Computer Science League Classroom Division 2007 - 2008 Contest #1

The document is a set of problems from the American Computer Science League Contest for the 2007-2008 academic year, focusing on topics such as recursive functions, computer number systems, and programming evaluation. It includes tasks like converting hexadecimal to octal, evaluating expressions, and determining values after executing a program. The problems are designed for the Classroom Division and cover various computational concepts.

Uploaded by

CK
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

ACSL

2007 - 2008 American Computer Science League Contest #1


Classroom Division

1. Recursive Functions
Find

2. Recursive Functions
[x] = greatest integer less than or equal to x

Find , given:

3. Computer Number Systems

Convert 2A3B416 to octal.

4. Computer Number Systems

Express, in binary, the difference between the largest and smallest


numbers: 2068, 11111112, 8416, 125

5. What Does This Program Do?


What are the final values of A, B, C, D, and E after this program is A=
run?
A = 4: B = 3: C = 12: D = 2: E = 6
IF C/E > A/D THEN A = D ELSE C = E B=
IF (A>B) AND (C>E) THEN B = C ELSE D = A
IF A + B = C THEN E = 2 * A ELSE A = B + C
A = C – D: B = E – A: C = B – E: D = C – A: E = B – D C=
IF (A>0) OR (B<0) THEN B = A*B ELSE A = 2 * A
IF (E + D < C) AND (D < B) THEN C = D – A ELSE D = 2*E
PRINT A,B,C,D,E D=
END ACSL
E=
2007 - 2008 American Computer Science League Contest #1
Classroom Division

6. Recursive Functions
Find (32), given:

7. Recursive Functions

If (1) = 8 and (n+1) = 2* (n) – 4, find (5).

8. Computer Number Systems


Which of the following octal numbers has the most 1’s in its
binary representation?

A) 1555558 B) 1333378 C) 1455478 D) 1564648 E) 1714428

9. Computer Number Systems


Evaluate and express the answer in binary:

2438 + 9116 – 8216 / 11012

10. LISP
Evaluate the following expression:

(ADD (ADD 3 4)(SUB 5 2)(MULT 3 2)(EXP 2 3))

You might also like