MTH 221 Education on your terms / tutorialrank.com

1
MTH 221 Education on your terms/tutorialrank.com
2
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 1 DQ 1 (UOP Course)
For more course tutorials visit
www.tutorialrank.com 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 not n is even or
odd?
3
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 1 DQ 2 (UOP Course)
For more course tutorials visit
www.tutorialrank.com 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.  p God is love
4
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 1 DQ 3 (UOP Course) For
more course tutorials visit www.tutorialrank.com
Relate one of the topics from this week's
material to a situation in your professional or
personal life and discuss how you would solve the
issue with the recently acquired knowledge.
5
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 1 Individual and Team Assignment
Selected Textbook Exercises (UOP Course)
For more course tutorials visit
www.tutorialrank.com Mathematics - Discrete
Mathematics Complete 12 questions below by
choosing at least four from each section.    Ch.
1 of Discrete and Combinatorial Mathematics
6
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 1 Individual Assignment Selected
Textbook Exercises (UOP Course)
For more course tutorials visit
www.tutorialrank.com Complete the six questions
listed below          Ch. 1 of Discrete and
Combinatorial Mathematics o   Supplementary
Exercise 2          Ch. 2 of Discrete and
Combinatorial
7
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 2 DQ 1 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Describe a situation in
your professional or personal life when
recursion, or at least the principle of
recursion, played a role in accomplishing a task,
such as a large chore that could be decomposed
into smaller chunks that were easier to handle
separately, but still had the semb
8
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 2 DQ 2 (UOP Course)
For more course tutorials visit
www.tutorialrank.com   Describe a favorite
recreational activity in terms of its iterative
components, such as solving a crossword or Sudoku
puzzle or playing a game of chess or backgammon.

9
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 2 DQ 3 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Using a search engine of
your choice, look up the term one-way function.
This concept arises in cryptography. Explain this
concept in your own words, using the terms
learned in Ch. 5 regarding functions and their
10
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 2 DQ 4 (UOP Course)
For more course tutorials visit
www.tutorialrank.com A common result in the
analysis of  sorting algorithms is that
for nelements, the best average-case behavior of
any sort algorithmbased solely on
comparisonsis O(n logn). How might a sort
algorithm beat this average-case behavior based
on additional prior knowledge of the data
elements? What sort of speed-up might you
anticipate for such an algorithm? In other words,
does it suddenly become O(n), O(n log n) or
something
11
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 2 Individual and Team Assignment
Selected Textbook Exercises (UOP Course)
For more course tutorials visit
www.tutorialrank.com Mathematics - Discrete
Mathematics Complete 12 questions below by
choosing at least three from each section.  
 Ch. 4 of Discrete and Combinatorial
Mathematics    o  Exercise 4.1, problems 4, 7,
18 
12
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 2 Individual Assignment Selected
Textbook Exercises (UOP Course)
For more course tutorials visit
www.tutorialrank.com Complete the 4 questions
below and submit on the worksheet provided by
Deb.          Ch. 4 of Discrete and
Combinatorial Mathematics o   Exercise 4.1,
problems 4 p 208
13
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 2 Team Assignment Selected Textbook
Exercises (UOP Course) For more course
tutorials visit www.tutorialrank.com Complete
the 4 questions below and submit on the worksheet
provided by Deb.          Ch. 4 of Discrete and
Combinatorial Mathematics o   Exercise 4.1,
problem 18 p 209 o   Exercise 4.5, problems 2 p
241
14
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 3 DQ 1 (UOP Course)
For more course tutorials visit
www.tutorialrank.com In week 2 we reviewed
relations between sets.  We will continue that
topic this week too.  With definitions and
examples discuss at least 3 different types of
relations.
15
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 3 DQ 2 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Read through sections 7.2
and 7.3 for topics on 0-1 matrices, directed
graphs and partial orders.  Pick any of the
topics (definitions and theorems) that was not
already covered by your fellow students and
present your
16
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 3 DQ 3 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Read through section
8.1-8.2 and discuss your findings.  Sections 8.1
and 8.2 illustrate the principle of inclusion and
exclusion based on conditions for inclusion.
17
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 3 DQ 4 (UOP Course)
For more course tutorials visit
www.tutorialrank.com isucss how the principle of
inclusion and exclusion is related to the rules
of manipulation and simplification of logic
predicates from chapter 2.
18
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 3 Individual and Team Assignment
Selected Textbook Exercises (UOP Course)
For more course tutorials visit
www.tutorialrank.com Mathematics - Discrete
Mathematics Complete 12 questions below by
choosing at least four from each section.  
 Ch. 7  o  Exercise 7.1, problems 5, 6, 9,
14  o  Exercise 7.2, problems 2, 9, 14 (Develop
the algorithm only, not the computer code.)  o
 Exercise 7.3, problems 1
19
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 3 Individual Assignment Selected
Textbook Exercises (UOP Course)
For more course tutorials visit
www.tutorialrank.com Complete 4 questions below
and submit on the worksheet provided by
Deb.          Ch. 7 o   Exercise 7.1, problems
6, pp 343-344 o   Exercise 7.3, problems 6 p
364 o   Exercise 7.4, problems 2 p 370
20
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 3 Team Assignment Selected Textbook
Exercises (UOP Course) For more
course tutorials visit www.tutorialrank.com Compl
ete the 4 questions below and submit on the
worksheet provided by Deb.          Ch. 7 o  
Exercise 7.2, problems 2 14 (Develop the
algorithm only, not the computer code.) pp
354          Ch. 8
21
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 4 DQ 1 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Review section 11.1 of the
text and discuss here at least 2 topics from
the section along with one exercise problem.
22
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 4 DQ 2 (UOP Course)
For more course tutorials visit
www.tutorialrank.com   Review sections 11.2-11.4
of the text and discuss topics (that were not
already covered by your colleagues) from
the section. Don't forget the examples.
23
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 4 DQ 3 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Random graphs are a
fascinating subject of applied and theoretical
research. These can be generated with a fixed
vertex set V and edges added to the edge
set E based on some probability model, such as a
coin flip. Speculate on how many connected
components a random graph might have if the
likelihood of an edge (v1,v2)
24
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 4 DQ 4 (UOP Course) For more course
tutorials visit www.tutorialrank.com Trees occur
in various venues in computer science decision
trees in algorithms, search trees, and so on. In
linguistics, one encounters trees as well,
typically as parse trees, which are essentially
sentence diagrams, such as those you might have
had to do in primary school, breaking a
natural-language sentence into its
componentsclauses, subclauses, nouns, verbs,
adverbs, adjectives, prepositions, and so on.
What might be
25
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 4 Individual and Team Assignment
Selected Textbook Exercises (UOP Course) For
more course tutorials visit www.tutorialrank.com M
athematics - Discrete Mathematics Complete 12
questions below by choosing at least four from
each section.    Ch. 11 of Discrete and
Combinatorial Mathematics o  Exercise 11.1,
problems 3, 6, 8, 11, 15, 16   Ch. 11 of
Discrete and Combinatorial Mathematics
26
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 4 Individual Assignment Selected
Textbook Exercises (UOP Course) For more course
tutorials visit www.tutorialrank.com   Complete 4
questions below and submit on the sheet provided
by Deb.          Ch. 11 of Discrete and
Combinatorial Mathematics o   Exercise 11.2,
problems 12 p 529
27
MTH 221 Education on your terms/ tutorialrank.com
  MTH 221 Week 4 Team Assignment Selected
Textbook Exercises (UOP Course) For more course
tutorials visit www.tutorialrank.com Complete 4
questions below and submit on the sheet provided
by Deb.          Ch. 11 of Discrete and
Combinatorial Mathematics o   Exercise 11.4,
problem 24 pp 554-555
28
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 5 DQ 1 (UOP Course) For more course
tutorials visit www.tutorialrank.com In your own
words, discuss examples of at least 3 of the
ten laws of  Boolean algebra.
29
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 5 DQ 2 (UOP Course) For more course
tutorials visit www.tutorialrank.com With an
example, discuss the basic concepts of boolean
algebra.
30
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 5 DQ 3 (UOP Course) For more course
tutorials visit www.tutorialrank.com How does the
reduction of Boolean expressions to simpler forms
resemble the traversal of a tree, from the Week
Four material? What sort of Boolean expression
would you
31
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 5 Individual and Team Assignment
Selected Textbook Exercises (UOP Course) For more
course tutorials visit www.tutorialrank.com Mathem
atics - Discrete Mathematics Complete 12
questions below.    Ch. 15 of Discrete and
Combinatorial Mathematics o  Supplementary
Exercises, problems 1, 5, 6
32
MTH 221 Education on your terms/ tutorialrank.com
MTH 221 Week 5 Learning Team Assignment Research
Paper and Presentation (UOP Course)   For more
course tutorials visit www.tutorialrank.com Mathem
atics - Discrete Mathematics Submit the final
Research Presentation.
33
MTH 221 Education on your terms/ tutorialrank.com