1. 1100010 (base 2) 2. 1010 (base 2) 3. 13 (base 8)

1. 46 2. https://www.codiva.io/p/4691b42c-747c-43b0-b867-24ddf7fd0edc (still work in progress)

*you noobs need to turn in homework (╯°□°）╯︵ ┻━┻ Prefix/postfix: 1. 58 2. -85 3. 2 Digital electronics: work in progress rip

Graph Theory: 1. 12 paths 2. 1 cycle Bit-String Flicking: *work in progress lol.. will update*

5. AC + !(B XOR A) + !B AC + !(!BA + B!A) + !B (B XOR A = !BA + B!A) AC + B!A + !BA + !B (simplify !(!BA + B!A)) AC + B!A + !B (Absorption law !BA + !B = !B) AC + !A + !B (Absorption law B!A + !B = !A + !B) C + !A + !B (Absorption law AC + !A = C + !A) 6. !(AB+ B XOR C) !C !AB + !(!BC + B!C) !C (B XOR C = !BC + B!C) !A + !B + B!C + !BC!C (DeMorgan's law + simplify !(!BC + B!C)) !A + !B + B!C + 0 (Annihilator law C!C = 0) !A + !B + !C (Identity law + Absorption law !B + B!C = !B + !C) 7. C XOR C !CC + C!C (C XOR C = !CC + C!C) 0 + 0 (Annihilator law + Annihilator law) 0 (Identity law) 8. 4 inputs are true

1. 9 2. 8 3. 00101 4. A 5. !A + !B

Part 1: 1. 27 2. -32 3. / - 1 * 4 3 - + ^ 6 2 * * 2 9 9 / 2 3 Part 2: 1. 10000 2. 01101 3. 10000, 10010, 10100, 10110

1. https://www.codiva.io/p/fa67b394-dd7b-4df0-af39-445de80731a8

Code is attached below: https://www.codiva.io/p/1b100090-de2d-4a46-bfdb-8837ccc2463f

import java.util.*; import java.io.*; class Homework { public static void main(String[] args) { Scanner in = new Scanner(System.in); System.out.println("Enter number for n"); int n = in.nextInt(); recaman(n); } public static void recaman(int n){ int arr[] = new int[n]; arr[0] = 0; System.out.print(arr[0]+" ,"); for(int i = 1; i < n; i++){ int curr = arr[i - 1] - i; int j; for(j = 1; j < i; j++){ if((arr[j] == curr) || curr < 0){ curr = arr[i - 1] + i; break; } } arr[i] = curr; System.out.print(arr[i]+", "); } } }

let “r” be the # of black tiles in each row r = 7 let “c” be the # of black tiles in each column c = 9 let “a1” be the midpoint of the vertical lines let “a2” be the midpoint of the horizontal lines 1. make a single row of 9 black tiles 2. on 9th tile, place down (r-1) black tiles vertically downwards 3. on lowest vertical tile, make a row of (c-1) black tiles 4. on leftmost tile of the lowest horizontal line, place down (r-2) black tiles upwards 5. find a1 and a2 6. for leftmost vertical line, move the midpoint a2 / 2 units to the right 7. for rightmost vertical line, move the midpoint a2 / 2 units to the left 8. for the uppermost horizontal line, move the midpoint a1 / 2 units down 9. for the bottommost horizontal line, move the midpoint a1 / 2 units up 10. find the point where all 4 midpoints overlap into a single midpoint

you write it in pseudocode

1. 1 2. see below class Main { public static void main(String[] args) { int z = 0; int n = 1000; int a = 0; int b = 0; int c = 0; int d = 0; while(n <= 2000){ a = n/1000; b = (n-1000*a)/100; c = (n- 1000*a - 100*b)/10; d = n - 1000*a - 100*b - 10*c; } if(a == d && b == c && a != b){ z++; } n++; System.out.println(z); } }

1. 111111111 2. 11101 3. 1111111100 4. 10110

1a. Binary: 100111111 1b. Octal: 477 1c. Hexadecimal: 13F 2a. 280 2b. 544 2c. 2805 BONUS: 1188

1. let “r” be the # of black tiles in each row; r = 7 2. let “c” be the # of black tiles in each column; c = 9 3. let “a1” be the midpoint of the vertical lines 4. let “a2” be the midpoint of the horizontal lines 5. make a single row of 9 black tiles 6. on 9th tile, place down (r-1) black tiles vertically downwards 7. on lowest vertical tile, make a row of (c-1) black tiles 8. on leftmost tile of the lowest horizontal line, place down (r-2) black tiles upwards 9. find a1 and a2 10. for leftmost vertical line, move the midpoint a2 / 2 units to the right 11. for rightmost vertical line, move the midpoint a2 / 2 units to the left 12. for the uppermost horizontal line, move the midpoint a1 / 2 units down 13. for the bottomost horizontal line, move the midpoint a1 / 2 units up 14. find the point where all 4 midpoints overlap into a single midpoint 15. 1.5 Robot:

1. let “w” be the # of windows. set w = 0 2. make robot go to wall 3. turn until robot can sense wall 4. move the robot around the perimeter of the room with the sensor still facing the perimeter 5. if sense wall, move to next unit 6. if sense window, do (w+1), then continue to move around the perimeter 7. repeat step 4,5 for every unit until you finish the entire perimeter of the room