MTH 221 help Minds Online/newtonhelp.com - PowerPoint PPT Presentation

About This Presentation

Title:

MTH 221 help Minds Online/newtonhelp.com

Description:

For more course tutorials visit uophelp.com is now newtonhelp.com www.newtonhelp.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 – PowerPoint PPT presentation

Number of Views:2

Slides: 33

Provided by: abcdf5

Category: How To, Education & Training

more less

Transcript and Presenter's Notes

Title: MTH 221 help Minds Online/newtonhelp.com

1
MTH 221 help Minds Online/newtonhelp.com

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com

2
MTH 221 Entire Course (New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
MTH 221 Week 1 Individual and Team
Assignment Selected Textbook Exercises
MTH 221 Week 2 Individual and Team Assignment
Selected Textbook Exercises

3
MTH 221 Week 1 DQ 1(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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 Week 1 DQ 2(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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.

5
MTH 221 Week 1 DQ 3(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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 Week 1 Individual and Team Assignment
Selected Textbook Exercises

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Mathematics - Discrete Mathematics
Complete 12 questions below by choosing at least
four from each section.
Ch. 1 of Discrete and Combinatorial Mathematics

7
MTH 221 Week 1 Individual AssignmentSelected
Textbook Exercises(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Complete the six questions listed below
Ch. 1 of Discrete and Combinatorial Mathematics
Supplementary Exercise 2

8
MTH 221 Week 2 DQ 1(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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 so, how did you
do it? If not, why did you not?

9
MTH 221 Week 2 DQ 2(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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.

10
MTH 221 Week 2 DQ 3(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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.

11
MTH 221 Week 2 DQ 4(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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 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?

12
MTH 221 Week 2 Individual and Team Assignment
Selected Textbook Exercises (New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Mathematics - Discrete Mathematics
Complete 12 questions below by choosing at least
three from each section.
Ch. 4 of Discrete and Combinatorial Mathematics

13
MTH 221 Week 2 Individual AssignmentSelected
Textbook Exercises(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Complete the 4 questions below and submit on the
worksheet provided by Deb.
Ch. 4 of Discrete and Combinatorial Mathematics

14
MTH 221 Week 2 Team AssignmentSelected Textbook
Exercises(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Complete the 4 questions below and submit on the
worksheet provided by Deb.
Ch. 4 of Discrete and Combinatorial Mathematics

15
MTH 221 Week 3 DQ 1(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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.

16
MTH 221 Week 3 DQ 2(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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.

17
MTH 221 Week 3 DQ 3(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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.

18
MTH 221 Week 3 DQ 4(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Disucss how the principle of inclusion and
exclusion is related to the rules of manipulation
and simplification of logic predicates from
chapter

19
MTH 221 Week 3 Individual and Team Assignment
Selected Textbook Exercises (New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Mathematics - Discrete Mathematics
Complete 12 questions below by choosing at least
four from each section.
Ch. 7

20
MTH 221 Week 3 Individual AssignmentSelected
Textbook Exercises(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Complete 4 questions below and submit on
the worksheet provided by Deb.
Ch. 7
Exercise 7.1, problems 6, pp 343-344

21
MTH 221 Week 3 Team AssignmentSelected Textbook
Exercises(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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

22
MTH 221 Week 4 DQ 1(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Review section 11.1 of the text and discuss here
at least 2 topics from the section along with one
exercise problem.

23
MTH 221 Week 4 DQ 2(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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.

24
MTH 221 Week 4 DQ 3(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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 the number of
components would depend on the size of the vertex
set V? Explain why or why not.

25
MTH 221 Week 4 DQ 4(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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 the significance of the depth and
breadth of a parse tree relative to the sentence
it represents? If you need to, look up parse tree
and natural language processing on the Internet
to see some examples

26
MTH 221 Week 4 Individual and Team Assignment
Selected Textbook Exercises(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
Mathematics - Discrete Mathematics
Complete 12 questions below by choosing at least
four from each section.
Ch. 11 of Discrete and Combinatorial
Mathematics

27
MTH 221 Week 5 DQ 1

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
In your own words, discuss examples of at
least 3 of the ten laws of Boolean algebra.

28
MTH 221 Week 5 DQ 2

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.com
With an example, discuss the basic concepts of
boolean algebra.

29
MTH 221 Week 5 DQ 3(New)

For more course tutorials visit
Uophelp is now newtonhelp.com
www.newtonhelp.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?

30
MTH 221 Week 5 Individual and Team Assignment
Selected Textbook Exercises(New)