### Create an Account

Need completed for final exam submission by 11/15/2013.

I can supply the textbook (online/electronic version) as well as all lecture notes referenced in exam.

Will need to electronically submit on or before 11/15/2013. If you are interested please contact me, original work only and needs to be detailed.

Document Preview:

1. (15 points) (a) How many bit strings of length 6 are there? Explain. (b) How many bit strings of length 6 are there which begin with a 0 and end with a 1? Explain. (c) How many bit strings of length 6 are there which contain at most 3 ones? Be careful with this one. Explain. (See your notes, week 10 and the text exercises.) (d) How many bit strings of length 6 are palindromes? 2.(10 points) Text, page 405, number 2. Explain. Text, page 406, number 36. Explain 3. (10 points). Text, page 414, number 26. Explain. (10 points) Use the Binomial Theorem to write the expansion of (x + y) 6? Write the coefficient of the term x2y4z5 expansion of (x + y + z) 11. See example 12 in your notes of week 10 5. Study pages 1-4 of the notes for week 11. Let A = {a, b, c, d}, and let R be the relation defined on A by the following matrix: MR = (a) (10 pts.) Describe R by listing the ordered pairs in R and draw the digraph of this relation. (b) (15 pts.) (Note this is similar to exercise 7 page 630. Which of the properties: reflexive, antisymmetric and transitive are true for the given relation? Begin your discussion by defining each term in general first and then how the definition relates to this specific example. (c) (5 pts.) Is this relation a partial order? Explain. If this relation is a partial order, draw its Hasse diagram. 6. (10 points) Note, this is similar to number 25, page 631). Consider the following Hasse diagram of a partial ordering relation R on a set A: (a) List the ordered pairs that belong to the relation. Keep in mind that a Hasse diagram is a graph of a partial ordering relation so it satisfies the three properties listed in number 5 part (b). (b) Find the (Boolean) matrix of the relation. 7. (15 points) Before you do this problem study the example at the end of the exam, as well as the notes in weeks 12 and 13. Assume the Boolean matrix below is MR and that MR represents the relation R where R...

Apr 25 2020 View more View Less Subscribe To Get Solution