Oh yeah, something that I should be mentioning is that you should be putting the answer here so you can verify if it's right or not. I didn't make that clear, that's my bad. Anyways: 1. 35233 2. 234

Answer Key:

1. D this was actually bitstring flicking and not computer number systems so i'll add the computer number systems portion into the next hw 1. C 2. E

1. 3797 2. 3

1. 2. 3 3.

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

If you've come here on to find why class hasn't started yet, I actually don't know; I think Tyler forgot that there is class today If Tyler still doesn't realize that there is class today, I'll post the slides to the lesson if they exist, with some probably optional homework Have a good week, Davey

Answer Key: 1 & 2: 3 & 4: I'm still crunching out the truth table(I've just been locked in a room with no desk) so when I'm done with that I'll post it here Thanks!

1. honestly it really doesn't matter as long as it makes sense. 2. 9 3. 45 4. 176

1. 01011 2. 00000 3. 01111 4. *1111 (01111 or 11111)

1. 01111 2. 01000 3. 01101 4. 10110 Sorry for the decently late answer key

Sorry for the late response 1. 3 2. 30 3. 4 4.

1. 5 2. 1

1. Take for example a chess board, with a 8 by 8 2D array. 2. len(string) is for finding the length of strings 3. loop through every position of the array and print it out 4. 12 5. 34

1. 15 2. C 3. E

1. 11 2. C(11) 3. -11 4. C(9) 5. A recursive function is a function that defines it directly or indirectly until it reaches a base case.

Forgot to mention, please join the LoL Discord Server for pings about when to join, homework help, and other! https://discord.gg/DZkqSmUq

Note: In this case, question 5 basically means "What is a recursive function?"

Homework Answers: 1. 172(octal) 2. Null(8 in octal, can't be converted) This should teach you to not copy-paste the top comment's answer 3. 100000101(binary)