1 / 32

MTH 221 Focus Dreams/uophelp.com

MTH 221 Week 1 Individual and Team Assignment Selected Textbook Exercises<br><br>MTH 221 Week 2 Individual and Team Assignment Selected Textbook Exercises<br><br>MTH 221 Week 3 Individual and Team Assignment Selected Textbook Exercises<br><br>MTH 221 Week 4 Individual and Team Assignment Selected Textbook Exercises<br>

bluebell539
Download Presentation

MTH 221 Focus Dreams/uophelp.com

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MTH 221 Focus Dreams/uophelp.com For more course tutorials visit www.uophelp.com

  2. MTH 221 Entire Course (New) For more course tutorials visit www.uophelp.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 Week 1 DQ 1 For more course tutorials visit www.uophelp.com • Week 1 DQ1 • 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

  4. MTH 221 Week 1 DQ 2 For more course tutorials visit www.uophelp.com • Week 1 DQ2 • 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 For more course tutorials visit www.uophelp.com • Week 1 DQ3 • 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

  6. MTH 221 Week 1 Individual and Team Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.com • MTH 221 Week 1 Individual and Team Assignment Selected Textbook Exercises • Mathematics - Discrete Mathematics • Complete 12 questions below by choosing at least four from each section.  • ·  Ch. 1 of Discrete and Combinatorial

  7. MTH 221 Week 1 Individual AssignmentSelected Textbook Exercises(New) For more course tutorials visit www.uophelp.com • Complete the six questions listed below: • Ch. 1 of Discrete and Combinatorial Mathematics

  8. MTH 221 Week 2 DQ 1 For more course tutorials visit www.uophelp.com • Week 2 DQ1 • 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

  9. MTH 221 Week 2 DQ 2 For more course tutorials visit www.uophelp.com • Week 2 DQ2 • Describe a favorite recreational activity in terms of its iterative components, such as solving a crossword or Sudoku puzzle or playing

  10. MTH 221 Week 2 DQ 3 For more course tutorials visit www.uophelp.com • Week 2 DQ3 • 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

  11. MTH 221 Week 2 DQ 4 For more course tutorials visit www.uophelp.com • Week 2 DQ4 • A common result in the analysis of sorting algorithms is that for n elements, the best average-case behavior of any sort algorithm—based solely on comparisons—is O(n log n). How might a sort algorithm beat this average-case behavior based on

  12. MTH 221 Week 2 Individual and Team Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.com • MTH 221 Week 2 Individual Assignment and Team Selected Textbook Exercises • Mathematics - Discrete Mathematics • Complete 12 questions

  13. MTH 221 Week 2 Individual Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.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 • Exercise 4.3, problems 4; p 230 • Ch. 5 of Discrete and Combinatorial Mathematics • Exercise 5.1, problem 8

  14. MTH 221 Week 2 Team Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.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;

  15. MTH 221 Week 3 DQ 1 For more course tutorials visit www.uophelp.com • Week 3 DQ1 • 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 For more course tutorials visit www.uophelp.com • Week 3 DQ2 • 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

  17. MTH 221 Week 3 DQ 3 For more course tutorials visit www.uophelp.com • Week 3 DQ3 • Read through section 8.1-8.2 and discuss your findings.  • Sections 8.1 and 8.2 illustrate the principle of inclusion and exclusion

  18. MTH 221 Week 3 DQ 4 For more course tutorials visit www.uophelp.com • Week 3 DQ4 • Disucss how the principle of inclusion and exclusion is related to the rules of manipulation and simplification of logic predicates from chapter 2.

  19. MTH 221 Week 3 Individual and Team Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.com • MTH 221 Week 3 Individual and Team Assignment Selected Textbook Exercises • Mathematics - Discrete Mathematics • Complete 12 questions below by choosing at least four from each section.  • ·  Ch. 7

  20. MTH 221 Week 3 Individual Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.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

  21. MTH 221 Week 3 Team Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.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

  22. MTH 221 Week 4 DQ 1 For more course tutorials visit www.uophelp.com • Week 4 DQ1 • 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 For more course tutorials visit www.uophelp.com • Week 4 DQ2 • 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 For more course tutorials visit www.uophelp.com • Week 4 DQ3 • 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

  25. MTH 221 Week 4 DQ 4 For more course tutorials visit www.uophelp.com • Week 4 DQ4 • 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

  26. MTH 221 Week 4 Individual and Team Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.com • MTH 221 Week 4 Individual and Team Assignment Selected Textbook Exercises • Mathematics - Discrete Mathematics • Complete 12 questions below by choosing at least four from each section.  • ·  Ch. 11 of Discrete and Combinatorial

  27. MTH 221 Week 5 DQ 1 For more course tutorials visit www.uophelp.com • Week 5 DQ1 • 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 www.uophelp.com • Week 5 DQ2 • With an example, discuss the basic concepts of boolean algebra.

  29. MTH 221 Week 5 DQ 3 For more course tutorials visit www.uophelp.com • Week 5 DQ3 • 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

  30. MTH 221 Week 5 Individual and Team Assignment Selected Textbook Exercises For more course tutorials visit www.uophelp.com • MTH 221 Week 5 Individual and Team Assignment Selected Textbook Exercises • Mathematics - Discrete Mathematics • Complete 12 questions below.  • ·  Ch. 15 of Discrete and Combinatorial Mathematics

  31. MTH 221 Week 5 Learning Team Assignment Research Paper & Presentation For more course tutorials visit www.uophelp.com • MTH 221 Week 5 Learning Team Assignment Research Paper & Presentation • Mathematics - Discrete Mathematics • Submit the final Research Presentation.

  32. MTH 221 Focus Dreams/uophelp.com For more course tutorials visit www.uophelp.com

More Related