Hey, you have 5 seconds to show me some god tier books for CS.

File: Smart dog.gif (2MB, 370x319px) Image search: [Google]

2MB, 370x319px

>>52510901
We have 7 colors of the rainbow and 100 numbers, each color can be associated with a number between 0 to 100 or 1 to 100.

For example (BLUE, 48)

How many bits do we need to represent all possible combinations?

For 7 colors we need 2^3=8
But for the 100 numbers do we need 2^7=128 (which encompasses 100).

Do we need 128 + 8 bits?
Do we need 128 bits alone because 128-100-7=21 extra bits
Do we need less than that?

Thank you.

File: 61XTb78EclL._SX377_BO1,204,203,200_.jpg (64KB, 379x499px) Image search: [Google]

64KB, 379x499px

P-please! don't hurt me!

>>52510918
thats a smart doug

File: 51KtjG+Ne1L._SX437_BO1,204,203,200_.jpg (37KB, 439x500px) Image search: [Google]

37KB, 439x500px

4 U

>>52510918

wouldn't you just need 128 bits, unless you're combining them both in which cause you'd need 707 which would then have to be 1024 bits.

>>52511243
Someone else told me I would need 10bits because

I can get 7 different colours combined with 100 different numbers for a total of 700 combinations
700<2^10 so I would need 10 bits to include them all.

>>52511288

oh my bad, I meant 10 bits. but if it's 0 to 100 then
it's 101 * 7 which is 707. But yeah it's 10 bits

File: Clrs3.jpg (50KB, 420x475px) Image search: [Google]

50KB, 420x475px

*teleports behind you*

Back off!

>>52511390
I'd fuck your big o, if you know what I mean

>>52511390
This is the most important CS book you will read. Really the only undergrad algorithms book that teaches things properly.