MTH 221 Competitive Success--snaptutorial.com

1
MTH 221 Competitive Success/snaptutorial.com
2
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Entire Course For more classes
visit www.snaptutorial.com   MTH 221 Week 1
Individual and Team Assignment Selected Textbook
Exercises   MTH 221 Week 2 Individual and Team
Assignment Selected Textbook Exercises   MTH 221
Week 3 Individual and Team Assignment Selected
Textbook Exercises  
3
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 1 DQ 1 For more classes
visit www.snaptutorial.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?
4
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 1 DQ 2 For more classes
visit www.snaptutorial.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 q
Love is blind r Ray Charles is blind
5
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 1 DQ 3 For more classes
visit www.snaptutorial.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.  
6
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 1 Individual and Team Assignment
Selected Textbook Exercises For more classes
visit www.snaptutorial.com   Mathematics -
Discrete Mathematics   Complete 12 questions
below by choosing at least four from each
section.   Ch. 1 of Discrete and
Combinatorial Mathematics   o Supplementary
Exercises 1, 2, 7, 8, 9, 10, 15(a), 18, 24,
25(a b)  
7
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 1 Individual Assignment Selected
Textbook Exercises For more classes
visit www.snaptutorial.com   Complete the six
questions listed below   Ch. 1 of Discrete
and Combinatorial Mathematics   Supplementary
Exercise 2 Ch. 2 of Discrete and
Combinatorial Mathematics
8
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 1 Individual Assignment Selected
Textbook Exercises For more classes
visit www.snaptutorial.com   Complete the six
questions listed below   Ch. 1 of Discrete
and Combinatorial Mathematics   Supplementary
Exercise 2 Ch. 2 of Discrete and
Combinatorial Mathematics
9
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 2 DQ 1 For more classes
visit www.snaptutorial.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 semblance of the
overall task. Did you track the completion of
this task in any way to ensure that no pieces
were left undone, much like an algorithm keeps
placeholders to trace a way back from a recursive
trajectory? If
10
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 2 DQ 2 For more classes
visit www.snaptutorial.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.
Also, mention any recursive elements that occur.
 
11
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 2 DQ 3 For more classes
visit www.snaptutorial.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 inverses.  
12
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 2 DQ 4 For more classes
visit www.snaptutorial.com   A common result in
the analysis of sorting algorithms is that for n
elements, the best average-case behavior of any
sort algorithmbased solely on comparisonsis O(n
log n). 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 similar?  
13
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 2 Individual and Team Assignment
Selected Textbook Exercises For more classes
visit www.snaptutorial.com   Mathematics -
Discrete Mathematics   Complete 12 questions
below by choosing at least three from each
section.   Ch. 4 of Discrete and Combinatorial
Mathematics  
14
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 2 Individual Assignment Selected
Textbook Exercises For more classes
visit www.snaptutorial.com   Complete the 4
questions below and submit on the worksheet
provided by Deb.   Ch. 4 of Discrete and
Combinatorial Mathematics Exercise 4.1,
problems 4 p 208
15
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 2 Team AssignmentSelected Textbook
Exercises For more classes visit www.snaptutoria
l.com   Complete the 4 questions below and submit
on the worksheet provided by Deb.   Ch. 4 of
Discrete and Combinatorial Mathematics
Exercise 4.1, problem 18 p 209 Exercise 4.5,
problems 2 p 241
16
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 3 DQ 1 For more classes
visit www.snaptutorial.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.    
17
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 3 DQ 2 For more classes
visit www.snaptutorial.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 understanding. Please provide
examples as you discuss.
18
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 3 DQ 3 For more classes
visit www.snaptutorial.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.
 
19
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 3 DQ 4 For more classes
visit www.snaptutorial.com   Discuss how the
principle of inclusion and exclusion is related
to the rules of manipulation and simplification
of logic predicates from chapter 2.  
20
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 3 Individual and Team Assignment
Selected Textbook Exercises For more classes
visit www.snaptutorial.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
21
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 3 Individual AssignmentSelected
Textbook Exercises For more classes
visit www.snaptutorial.com   Complete 4 questions
below and submit on the worksheet provided by
Deb.   Ch. 7 Exercise 7.1, problems 6,
pp 343-344 Exercise 7.3, problems 6 p 364
Exercise 7.4, problems 2 p 370
22
MTH 221 Competitive Success/snaptutorial.com
  MTH 221 Week 3 Team Assignment Selected
Textbook Exercises For more classes
visit www.snaptutorial.com   Complete the 4
questions below and submit on the worksheet
provided by Deb.   Ch. 7 Exercise 7.2,
problems 2 14 (Develop the algorithm only, not
the computer code.) pp 354 Ch. 8
23
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 4 DQ 1 For more classes
visit www.snaptutorial.com   Review section 11.1
of the text and discuss here at least 2 topics
from the section along with one exercise problem.
 
24
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 4 DQ 2 For more classes
visit www.snaptutorial.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.  
25
MTH 221 Competitive Success/snaptutorial.com
  MTH 221 Week 4 DQ 3 For more classes
visit www.snaptutorial.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) being in the set E is 50. Do you
think
26
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 4 DQ 4 For more classes
visit www.snaptutorial.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
27
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 4 Individual and Team Assignment
Selected Textbook Exercises For more classes
visit www.snaptutorial.com   Mathematics -
Discrete Mathematics   Complete 12 questions
below by choosing at least four from each
section.   Ch. 11 of Discrete and
Combinatorial Mathematics  
28
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 4 Individual Assignment Selected
Textbook Exercises For more classes
visit www.snaptutorial.com   Complete 4 questions
below and submit on the sheet provided by Deb.  
Ch. 11 of Discrete and Combinatorial
Mathematics Exercise 11.2, problems 12 p
529 Exercise 11.3, problems 20 p 538 Ch.
12 of Discrete and Combinatorial Mathematics
29
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 4 Team AssignmentSelected Textbook
Exercises For more classes visit www.snaptutoria
l.com   Complete 4 questions below and submit on
the sheet provided by Deb.   Ch. 11 of
Discrete and Combinatorial Mathematics
Exercise 11.4, problem 24 pp 554-555
30
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 5 DQ 1 For more classes
visit www.snaptutorial.com   In your own words,
discuss examples of at least 3 of the ten laws of
Boolean algebra.    
31
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 5 DQ 2 For more classes
visit www.snaptutorial.com   With an example,
discuss the basic concepts of boolean algebra.
32
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 5 DQ 3 For more classes
visit www.snaptutorial.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 end up with at the root of the tree?  
33
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 5 Individual and Team Assignment
Selected Textbook Exercises For more classes
visit www.snaptutorial.com   Mathematics -
Discrete Mathematics   Complete 12 questions
below.   Ch. 15 of Discrete and Combinatorial
Mathematics   o Supplementary Exercises,
problems 1, 5, 6
34
MTH 221 Competitive Success/snaptutorial.com
MTH 221 Week 5 Learning Team Assignment Research
Paper Presentation For more classes
visit www.snaptutorial.com   Mathematics -
Discrete Mathematics   Submit the final Research
Presentation.  
35
MTH 221 Competitive Success/snaptutorial.com