MTH 221 Slingshot Academy / Tutorialrank.Com - PowerPoint PPT Presentation

About This Presentation
Title:

MTH 221 Slingshot Academy / Tutorialrank.Com

Description:

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 – PowerPoint PPT presentation

Number of Views:6
Slides: 11
Provided by: alowozr

less

Transcript and Presenter's Notes

Title: MTH 221 Slingshot Academy / Tutorialrank.Com


1
MTH 221 Slingshot Academy / Tutorialrank.com
For More Tutorials
www.Tutorialrank.com
2
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 1 DQ 1 (UOP Course)
  • MTH 221 Week 1 DQ 2 (UOP Course)
  • 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?
  • 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. 

3
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 1 DQ 3 (UOP Course)
  • MTH 221 Week 1 Individual and Team Assignment
    Selected Textbook Exercises (UOP Course)
  • 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.
  • 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)

4
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 1 Individual Assignment Selected
    Textbook Exercises (UOP Course)
  • MTH 221 Week 2 DQ 1 (UOP Course)
  • Complete the six questions listed below
  •          Ch. 1 of Discrete and Combinatorial
    Mathematics
  • o   Supplementary Exercise 2
  •          Ch. 2 of Discrete and Combinatorial
    Mathematics
  • o   Exercise 2.1, problem 10 p 54
  • o   Exercise 2.2, problem 4 p 66
  • 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

5
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 2 DQ 2 (UOP Course)
  • MTH 221 Week 2 DQ 3 (UOP Course)
  • 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.
  • 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.

6
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 2 DQ 4 (UOP Course)
  • MTH 221 Week 2 Individual and Team Assignment
    Selected Textbook Exercises (UOP Course)
  • 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).
  • 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 

7
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 2 Individual Assignment Selected
    Textbook Exercises (UOP Course)
  • MTH 221 Week 2 Team Assignment Selected Textbook
    Exercises (UOP Course)
  • 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
  • o   Exercise 4.3, problems 4 p 230
  •          Ch. 5 of Discrete and Combinatorial
    Mathematics
  • 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

8
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 3 DQ 1 (UOP Course)
  • MTH 221 Week 3 DQ 2 (UOP Course)
  • 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.
  • 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.

9
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 3 DQ 3 (UOP Course)
  • MTH 221 Week 3 DQ 4 (UOP Course)
  • 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.
  • Disucss how the principle of inclusion and
    exclusion is related to the rules of manipulation
    and simplification of logic predicates from
    chapter 2.

10
MTH 221 Slingshot Academy / Tutorialrank.com
  • MTH 221 Week 3 Individual and Team Assignment
    Selected Textbook Exercises (UOP Course)
  • MTH 221 Week 3 Individual Assignment Selected
    Textbook Exercises (UOP Course)
  • 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.) 
  • 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
  •          Ch. 8
Write a Comment
User Comments (0)
About PowerShow.com