MTH 233 Instant Education/uophelp

1. MTH 233 Course For more course visit www.uophelp.com

2. MTH 233 Course MTH 233 Entire Course MTH 233 Week 1 DQ 1 • MTH 233 Week 1 Individual and Team Assignment Selected Textbook Exercises •  MTH 233 Week 2 Individual and Team Assignment Selected Textbook Exercises •  MTH 233 Week 3 Individual and Team Assignment Selected Textbook Exercises •  MTH 233 Week 4 Individual and Team Assignment Selected Textbook Exercises •  MTH 233 Week 5 Individual and • 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 your method vary according to whether or not n is even or odd?

3. MTH 233 Course MTH 233 Week 1 DQ 2 MTH 233 Week 1 DQ 3 • 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. • p = God is loveq = Love is blindr = Ray Charles is blinds = Ray Charles is God • 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 the recently acquired knowledge.

4. MTH 233 Course MTH 233 Week 1 Individual and Team Assignment Selected Textbook Exercises MTH 233 Week 2 DQ 1 • MTH 233 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 Mathematics • o  Supplementary Exercises 1, 2, 7, 8, 9, 10, 15(a), 18, 24, & 25(a & b) • ·  Ch. 2 of Discrete and • 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

5. MTH 233 Course MTH 233 Week 2 DQ 2 MTH 233 Week 2 DQ 3 • Week 2 DQ2 • 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. • 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 in Ch. 5 regarding functions and their inverses.

6. MTH 233 Course MTH 233 Week 2 DQ 4 MTH 233 Week 2 Individual and Team Assignment Selected Textbook Exercises • 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 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 • MTH 233 Week 2 Individual Assignment and Team Selected Textbook Exercises • 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 233 Course MTH 233 Week 3 DQ 2 MTH 233 Week 4 Course Project Marketing Plan • As part of the Marketing Mix, PRICE, P, is important to the marketer. Yet when we look at price, it is more than just a dollar figure. What does price represent to the consumer? What does price represent to the marketer? • Course Project - Marketing Plan Submission #2 • 3.0 Marketing Strategy • 3.1 Mission • 3.2 Marketing Objectives • 3.3 Financial Objectives • 3.4 Target Markets • This week, your second draft of the Marketing Plan is due for review and feedback. For complete details, click on the

8. MTH 233 Course MTH 233 Week 2 Individual Assignment Selected Textbook Exercises MTH 233 Week 2 Team Assignment Selected Textbook Exercises • 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; p 252 • Exercise 5.7, problem 6; p 293 • 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 • Ch. 5 of -Discrete and Combinatorial Mathematics • Exercise 5.2, problems 27(a & b); p 259

9. MTH 233 Course MTH 233 Week 3 DQ 1 MTH 233 Week 3 DQ 2 • 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. • 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 discuss.

10. MTH 233 Course MTH 233 Week 3 DQ 3 MTH 233 Week 3 DQ 4 • 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 based on conditions for inclusion. • 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.

11. MTH 233 Course MTH 233 Week 3 Individual and Team Assignment Selected Textbook Exercises MTH 233 Week 3 Individual Assignment Selected Textbook Exercises • MTH 233 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 • 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 • Exercise 7.1, problems 6, ; pp 343-344 • Exercise 7.3, problems 6; p 364 • Exercise 7.4, problems 2; p 370 • Ch. 8 • Exercise 8.1, problems 12; p 396

12. MTH 233 Course MTH 233 Week 3 Team Assignment Selected Textbook Exercises MTH 233 Week 4 DQ 1 • 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 • Exercise 8.1, problem 20; p 397 • Exercise 8.2, probles 4; p 401 • 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.

13. MTH 233 Course MTH 233 Week 4 DQ 2 MTH 233 Week 4 DQ 3 • 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. • 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 components a random graph might have if the likelihood of an edge (v1,v2)

14. MTH 233 Course MTH 233 Week 4 DQ 4 MTH 233 Week 4 Individual and Team Assignment Selected Textbook Exercises • 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 had to do in primary school, breaking a natural-language sentence into its components—clauses, subclauses, nouns, verbs, adverbs, adjectives, prepositions, and so on. What might be the • MTH 233 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 Mathematics • o  Exercise 11.1, problems 3, 6, 8, 11, 15, & 16

15. MTH 233 Course MTH 233 Week 5 DQ 1 MTH 233 Week 5 DQ 2 • Week 5 DQ1 • In your own words, discuss examples of at least 3 of the ten laws of  Boolean algebra. • Week 5 DQ2 • With an example, discuss the basic concepts of boolean algebra.

16. MTH 233 Course MTH 233 Week 5 DQ 3 MTH 233 Week 5 Individual and Team Assignment Selected Textbook Exercises • 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 up with at the root of the tree? • MTH 233 Week 5 Individual and Team Assignment Selected Textbook Exercises • Mathematics - Discrete Mathematics • Complete 12 questions below.  • ·  Ch. 15 of Discrete and Combinatorial Mathematics • o  Supplementary Exercises, problems 1, 5, & 6 • ·  Ch. 15 of Discrete and

17. MTH 233 Course MTH 233 Week 5 Learning Team Assignment Research Paper MTH 233 Week 5 Learning Team Assignment Research Paper • MTH 233 Week 5 Learning Team Assignment Research Paper & Presentation • Mathematics - Discrete Mathematics • Submit the final Research Presentation. • ·  Submit the paper and power-point presentation with detailed speaker notes.  • MTH 233 Week 5 Learning Team Assignment Research Paper & Presentation • Mathematics - Discrete Mathematics • Submit the final Research Presentation. • ·  Submit the paper and power-point presentation with detailed speaker notes. 

18. MTH 233 Course For more course visit www.uophelp.com