Answer:
wait is that a test if it is cheating
Step-by-step explanation:
well the first one go on the bottom 2 row secound one first row third first row but it is in happpy i am not reall good at math XD third last row forth very happy fifth on unhappy sixth very unhappy seven very unhappy eight on very happy i think i got it i did this before i just don't rembear but i tried
Answer:
a=6 b=12
Step-by-step explanation:
i think i could be wrong
Answer:
1. c
2. h
3. f
4. e
5. g
6. c
7. b
8. a
Step-by-step explanation:
I can go more in depth if you'd like!
Problem A
Usually the number of bits in a byte is 8 or 16 or 32 and recently 64. You don't have to write a formula to restrict it to this number of bits. You are not asked to do so. The general formula is 2^n - 1 for the problem of Millie and her golden keys. Somehow the system can be made to choose the right number of bits. Apple IIe s for example, used 8 bits and there was a location that told the processor that fact.
2^n - 1 <<<<< Answer
Problem B
In this case n = 4
2^n - 1 = 2^4 - 1 = 16 - 1 = 15
Millie can collect 15 keys <<<<<< Answer
Answer:
Oh naw i can't help you with that one man but thanks for the points 63567Step-by-step explanation:
b 674 then38743 then 8391
