[Cse321] PS5 - some clarifications

Previous message: Venkatesan Guruswami: "[Cse321] Missing book"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

venkat@cs.washington.edu

Here are some clarifications on some of the couting problems on problem
set 5.

1(b) : Necklaces are round and not a linear string. And you have to use
ALL n beads in the necklace.

1(c): There was some confusion on what distinct truth tables meant. An
equivalent way to think of this question is to think of how many
distinct Boolean functions exist on n variables x_1,x_2,..,x_n.

1(d): A hand with no diamonds and no hearts obviously counts as a hand
that has an equal number of diamonds and hearts, so don't forget to
count those!

1(e): Firstly, the either-or is an inclusive OR (as we will always
intend in this class). That is, a string that has both 5 consecutive 0's
and 5 consecutive 1's must be counted. Secondly, strings that have more
than 5 consecutive 0's (or 1's) must also be counted.

-- Venkat

_______________________________________________
Cse321 mailing list
Cse321@cs.washington.edu
http://mailman.cs.washington.edu/mailman/listinfo/cse321