1. 11 2. C 3. -11 4. B 5. A recursive function is a repeating function that has an eventually termination point, specified in the function. One example of a recursive function is the Fibonacci Sequence.

1.172 (Octal) 2.null (This is unconvertable because the highest digit in octal is 7, while this number contains an 8. Though if it is 846 decimal to octal then it is 1516, and if it is 746 decimal to octal then it is 486.) 3.100000110 (Binary)

1. 1100010 (binary) 2. 1010 (binary) 3. 13 (octal)

I mean EADB EAEB

EAB EDB

Queue: Q Stack: N

4 1 9 1 0 Bonus: i = indices of 1D array l = side length of the square "made" by the 2D array x = floor(i,l) y = mod(i,l) answer is x,y

1. AC + B 2. A+!BA+C 3. A+B+!C!A 4. 6

Q1: Binary 100111111 Octal 477 Hex 13F Q2: Binary 280 Octal 544 Hex 2805 Q3: 1188

How is the union method used? I think that's the solution to one of the problems.