# Discrete Mathematics : Baisc Counting Problems

May 19th, 2015
Studypool Tutor
Price: \$10 USD

Tutor description

Product Rule: If you have P that can be broken down into , ; there are ways to do and to do . P can be done in • different ways. Each bit = 0 is 1 • 00/01 = 2 ways for (1st bit) • 10/11 = 2 ways for (2nd bit)

Word Count: 293
Showing Page: 1/3
Discrete MathematicsCounting ProblemsBasicsProduct RuleSum RulePrinciple of inclusion / exclusionProduct Rule:If you have P that can be broken down into , ; there are ways to do and to do . P can be done in different ways.Each bit = 0 is 100/01 = 2 ways for (1st bit)10/11 = 2 ways for (2nd bit)Sum Rule:If there are ways to do and there are ways to do , and and acnnot be done at the same, then the number of ways to do either or is + .A student has to select a project from either () with 8 projects or with 15 projects.Set a variable name by selecting either 1 or 2 alphanumeric characters (26 letters, 10 digits), upper case and lower case are not distinguished. How many variable names=Task 1) First digitTask 2) Second digit selecting have with 2 characters selecting a name with 1 character ways waysHow many Spring

## Review from student

Studypool Student
" Solid work, thanks. "

1827 tutors are online

### Other Documents

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