MTH 221 Enhance teaching/tutorialrank.com

1
MTH 221 Enhance teaching/ tutorialrank.com
2
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 1 DQ 1 (UOP Course) For more course
tutorials visit www.tutorialrank.com Tutorial
Purchased 1 Times, Rating No rating     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
3
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 1 DQ 2 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 1
Times, Rating A   There is an old joke that
goes something like this If God is love, love
is blind, and Ray Charles is blind, then
4
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 1 DQ 2 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 1
Times, Rating A   There is an old joke that
goes something like this If God is love, love
is blind, and Ray Charles is blind, then
5
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 1 Individual and Team Assignment
Selected Textbook Exercises (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 3
Times, Rating A   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)
6
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 1 Individual Assignment Selected
Textbook Exercises (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased2 Times,
Rating No rating   Complete the six questions
listed below          Ch. 1 of Discrete and
Combinatorial Mathematics o   Supplementary
Exercise 2
7
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 2 DQ 1 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 0
Times, Rating No rating   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
8
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 2 DQ 2 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 1
Times, Rating B   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.
9
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 2 DQ 3 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 0
Times, Rating No rating 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.  
10
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 2 DQ 4 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 1
Times, Rating A   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 similar?
11
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 2 Individual and Team Assignment
Selected Textbook Exercises (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 3
Times, RatingA 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 Enhance teaching/ tutorialrank.com
MTH 221 Week 2 Individual Assignment Selected
Textbook Exercises (UOP Course)
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 3Times,
Rating A   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 Enhance teaching/ tutorialrank.com
MTH 221 Week 2 Team Assignment Selected Textbook
Exercises (UOP Course)   For
more course tutorials visit www.tutorialrank.com
Tutorial Purchased 2 Times, Rating
B   Complete the 4 questions below and submit on
the worksheet provided by Deb.
14
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 3 DQ 1 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased0 Times,
Rating No rating   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 Enhance teaching/ tutorialrank.com
MTH 221 Week 3 DQ 2 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 2
Times, Rating A 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 Enhance teaching/ tutorialrank.com
MTH 221 Week 3 DQ 3 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased0 Times,
Rating No rating   Read through section 8.1-8.2
and discuss your findings. 
17
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 3 DQ 4 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 1
Times, Rating No rating Disucss 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 Enhance teaching/ tutorialrank.com
MTH 221 Week 3 Individual and Team Assignment
Selected Textbook Exercises (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 3
Times, Rating A Mathematics - Discrete
Mathematics Complete 12 questions below by
choosing at least four from each section.  
 Ch. 7  o  o  Exercise 7.4, problems 1, 2, 7, 8 
19
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 3 Individual Assignment Selected
Textbook Exercises (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 1
Times, Rating No rating   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
20
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 3 Team Assignment Selected Textbook
Exercises (UOP Course)   For
more course tutorials visit www.tutorialrank.com
Tutorial Purchased 4 Times, Rating B   Complete
the 4 questions below and submit on the worksheet
provided by Deb.
21
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 4 DQ 1 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased0 Times,
Rating No rating   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 Enhance teaching/ tutorialrank.com
MTH 221 Week 4 DQ 2 (UOP Course)  
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 1
Times, Rating No rating   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 Enhance teaching/ tutorialrank.com
MTH 221 Week 4 DQ 3 (UOP Course)
For more course tutorials visit
www.tutorialrank.com Tutorial Purchased 2
Times, Rating B   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
24
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 4 DQ 4 (UOP Course) For more
course tutorials visit www.tutorialrank.com Tutori
al Purchased 0 Times, Rating No rating   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 the
25
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 4 Individual and Team Assignment
Selected Textbook Exercises (UOP Course) For
more course tutorials visit www.tutorialrank.com T
utorial Purchased 4 Times, Rating
B Mathematics - Discrete Mathematics Complete 12
questions below by choosing at least four from
each section.    Ch. 11 of Discrete and
Combinatorial Mathematics o  
26
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 4 Individual Assignment Selected
Textbook Exercises (UOP Course)   For more
course tutorials visit www.tutorialrank.com Tutori
al Purchased 0 Times, Rating No
rating   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 Enhance teaching/ tutorialrank.com
MTH 221 Week 4 Team Assignment Selected Textbook
Exercises (UOP Course) For more course
tutorials visit www.tutorialrank.com Tutorial
Purchased 2 Times, Rating No rating 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 o   Exercise 11.6, problem
10 p 572
28
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 5 DQ 1 (UOP Course)   For more
course tutorials visit www.tutorialrank.com Tutori
al Purchased 0 Times, Rating No rating In your
own words, discuss examples of at least 3 of the
ten laws of  Boolean algebra.
29
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 5 DQ 2 (UOP Course)   For more
course tutorials visit www.tutorialrank.com Tutori
al Purchased 1 Times, Rating No rating   With
an example, discuss the basic concepts of boolean
algebra.
30
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 5 DQ 3 (UOP Course) For more
course tutorials visit www.tutorialrank.com Tutori
al Purchased 2 Times, Rating B   How does the
reduction of Boolean expressions to simpler forms
resemble the traversal of a tree, from the Week
31
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 5 Individual and Team Assignment
Selected Textbook Exercises (UOP Course)   For
more course tutorials visit www.tutorialrank.com T
utorial Purchased 4 Times, Rating
A   Mathematics - Discrete Mathematics
32
MTH 221 Enhance teaching/ tutorialrank.com
MTH 221 Week 5 Learning Team Assignment Research
Paper and Presentation (UOP Course)   For more
course tutorials visit www.tutorialrank.com Tutori
al Purchased 3 Times, Rating A Mathematics -
Discrete Mathematics Submit the final Research
Presentation.     Submit the paper and
power-point presentation with detailed speaker
notes.   
33
MTH 221 Enhance teaching/ tutorialrank.com
aa