ACSL 2 Review

Pre/Post/In-Fix

100

Convert from in-fix to pre-fix:

A * B + C * D

+ * A B * C D

200

Convert from post-fix to pre-fix:

E B A C + / D - ↑

↑ E - / B + A C D

300

Evaluate the post-fix expression:

2 7 + 3 ↑ 3 4 + 5 - 8 * -

713

400

Evaluate the post-fix expression:

9 7 - 3 4 * 5 - ↑  6 3 / /

64

500

Convert to pre-fix AND post-fix:

(3 - 2) ↑ 6 * (5 + 9 / 3)

Pre: * - 3 2 ↑ 6 + 5 / 9 3

Post: 3 2 - 6 ↑ 5 9 3 / + *

Bit-String Flicking

100

Evaluate:

RCIRC-3 (LSHIFT-2 10110)

00011

200

Evaluate:

((RC-14 (LC-23 01101)) | (LS-1 10011) & (RS-2 10111))

10110

300

Evaluate:

((RS–1 (NOT (LC–1 10110))) OR (NOT (LC–1 (RS–1 01001))))

11111

400

List all 5-bit long values of x that solve the following equation:

(LSHIFT-2 (RCIRC-3 (NOT x))) = 10100

10000
10100
10010
10110

500

List all 6-bit long values of x and y that solve the following equation:

(LCIRC-20 x) & (RCIRC-26 y) = 111110

(101111, 111011)
(101111, 111111)
(111111, 111011)

LISP

100

Evaluate:

CDAR '((apple banana) coconut (durian elderberry fig))

banana

200

CADDAADR '(apple ((banana coconut durian elderberry fig) grape huckleberry))

durian

300

What is the value of z after this line:

(SETQ z (CONS '(red white blue) (CDR '(This is a list))))

((red white blue) is a list)

400

Given the following function definition:

(DEF A (args) (REVERSE (CAR args)))

What is the output of this line:

(A (A '((hello (a b c)) (woof ruff) apple)))

(c b a)

500

Evaluate (pay attention to what is an atom):

(SETQ X '(pencil giraffe revolution drawer))
(SETQ X (CONS '(ADD (MULT 2 3) (DIV 12 4)) X))
(SET 'B (CAR X))
(EVAL 'B)

(ADD (MULT 2 3) (DIV 12 4))