Discrete Mathematics Answers

Questions: 3 903

Answers by our Experts: 3 464

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

7. Which of the following statement is not a member of set X?

X = {tiger, lion, puma, cheetah, leopard, cougar, ocelot}

 

A. cougar

B. bobcat

C. puma

D. Tiger

 

8. What type of set is H?

 

A. Empty

B. Finite

C. Infinite

D. None of the above.

 

9. Which of the ff. sets are finite?

A. {vowels}

B. {days of the week}

C. {primary colors}

D. All of the above.

 

10. Which of the ff. sets is equal to set P?

P = {Monday, Tuesday, Wednesday, Thursday, Friday}

 

A. W = {Thursday, Friday, Saturday, Sunday, Monday}

B. X = {Tuesday, Wednesday, Thursday, Friday, Saturday}

C. Y = {Thursday, Friday, Monday, Tuesday, Wednesday}

D. All of the Above.

 

II - Truth Table (Make a truth table for the given expression.) 10pts each.

11. (~p∧q) ∨ (p∧~q)

12. (~p∧q) ∨ (~p∨q)

 

III - Set Analysis.

Consider the counting numbers {1,2,3,4,5,6,7,8,9}.

Let A={1,3,5,7,9}, B={2,4,6,8}, C={3,5}

 

13. Find A union B. {A∪B}

14. Find A complement. {A’}

15. Find B intersect C. B∩C}


Select the statement that is the negation of “All summer days are muggy.”

 

A. All muggy days are summer.

B. Some summer days are muggy.

C. Some summer days are not muggy.

D. No summer days are muggy.


Concept of Mathematical induction to find out “Five” real world scenarios implementing the concept. Describe the details of those scenarios with respect to induction. Also give the mathematical proof of each described scenario.


Demonstrate how the concept of sequences discussed can be applied to the following situations. 

 

a) Metro buses scenario. 

b) Diet plan for a diabetic patient. 

c) Timetable followed by students in university.


A. Let p and q be propositions



p: 4 is a rational number



q: 3 is an irrational number.




Express each of these propositions as an English sentence:



1. ¬p =




Experience with C++ or Java is required


If X has n elements , how many elements does the power set of X have?


Prove that an undirected graph possesses an Eulerian circuit if and only if it is connected and its vertices are all of even degree.


Prove that an undirected graph possesses an Eulerian circuit if and only if it is connected and its vertices are all of even degree.





What is the cardinality of each of these sets? a) {a} b) {{a}} c) {a, {a}} d) {a, {a}, {a, {a}}}

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS