Also voting for Shravya S

I vote Ian for president

1.D 2.B 3.D

1. D 2. C 3. not sure

1. 3750.4 2. 3

1. 2. 3 {A,B}, {B,C,D}, {C,D} 3.

1.01*1(11*00*0 | 00*11*01)1*1 2.A,B,D 3.B,F,G(not sure)

1. E 2. A,B,E,O 3. T

1. 1 2. (0,1,0) (0,1,1) (1,1,0) 3. 1 (1,1,0) 4. (0,0,0) (0,0,1) (0,1,1) (1,1,0) (1,1,1) 5. A B C D Result(True/False) 0 0 0 0 1 0 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1

1. (DEF me (args) (CAR(args))) 2. 9 3. 45 4. 176

1. 01111 2.01000 3.01101 4.10110

1. 3 4-1=3) 2. 30(27-(-3)=30) 3. 4(1+3=4) 4. ^***s-sa-sb-sc /12

1. 5 (a=16,b=4,c=4,d=2,e=4,f=6) 2. 1(is pythagorean theorem)

1. Draw a map 2. Finds the length of a string 3. Use empty array and loop 4. 19-7=12 5. 34

1. 15 , 1->3->6->10->15 2. C(-8), -3 -> -8 -> -3 -> -8 -> -3 -> -8 -> -3 -> -8 3. E, should be 5 -> 2 -> -1 -> -4 -> -7 -> -10 -> -13 -> -16 -> -19 ->-17->-15

1. 11 , goes 9->13->17->14->11 2. C(11) goes 11->10->9->10->11(i think) 3. -11, goes 2->-14->-18->-19->-15->-11 4. C(9) goes 4->7->10->9->8->7->10->9 5. A recursive function is like an if and elif function in Python.

1. 172 (octal ) 2. 550(base 10) 3. 100000101 (binary)

1. 1100010 2. 1010 3. 13