# MTH/221 - week 1 DQ questions

*label*Computer Science

*timer*Asked: Oct 13th, 2013

**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:

http://mathvids.com/lesson/mathhelp/609-lecture-1-what-is-discrete-math

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?

- 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.)

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

*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.

*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 not

*n*is even or odd?