MTH/221 - week 1 DQ questions

Computer Science
Price: $5 USD

Question description

200-300 words

DQ 1 - Just what is discrete math? To get started, here are links to two videos that might help you answer the question:

Lecture 01 - What is Discrete Mathematics?

After watching one (or both!) of these videos, come back here to summarize what you learned for the rest of the class.  How does it relate to other classes you've taken so far?

DQ2 - An example of an "arranging objects" problem is the password that you used to access your University of Phoenix classroom today. The requirements for a University of Phoenix computer password consists of the following criteria:
  • Must be alphanumeric (include at least one number and at least one letter)
  • Must be between seven and 16 alphanumeric characters
  • Cannot include any special characters (EX: ampersand (&), percent (%), asterisk (*), etc.)
Your readings for this week cover the techniques needed to calculate how many passwords are possible, plus many other counting problems. So, how many passwords are possible? 

Next, if I tell you that my own password consists of six letters and one number, how many possible combinations are there? If you tried to crack open my university access by a "brute force" approach, and each attempt took ten seconds, how long would it take you to exhaust all possibilities?

DQ3- There is an old joke that goes something like this: “If God is love, love is blind, and Ray Charles is blind, then Ray Charles is God.” Explain, in the terms of first-order logic and predicate calculus, why this reasoning is incorrect. If the person who told you this joke was 
your grandmother, how would you respectfully explain this to her?

DQ4- There is an another old joke, commonly attributed to Groucho Marx, which goes something like this: “I don’t want to belong to any club that will accept people like me as a member.” Does this statement fall under the purview of Russell’s paradox, or is there an easy semantic way out? Look up the term fuzzy set theory in a search engine of your choice or the University Library, and see if this theory can offer any insights into this statement.

DQ5 - Consider the problem of how to arrange a group of n people so each person can shake hands with every other person. How might you organize this process? How many times will each person shake hands with someone else? How many handshakes will occur? How must your method vary according to whether or notn is even or odd?

Tutor Answer

(Top Tutor) Daniel C.
School: UCLA
Studypool has helped 1,244,100 students
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1822 tutors are online

Related Computer Science questions


Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors