Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Problem Solving Method by Roxanne Deang 43053 views
- Improving the Quality and Efficienc... by Gihan Wikramanayake 796 views
- Mathematics and computer science by Patricia Mellin 1657 views
- 1 introduction to problem solving a... by Rheigh Henley Cal... 10465 views
- Computer graphics by Aman Yadav 202 views
- Introduction to problem solving in C by Diwakar Pratap Si... 13649 views

6,106 views

Published on

Published in:
Education

No Downloads

Total views

6,106

On SlideShare

0

From Embeds

0

Number of Embeds

2

Shares

0

Downloads

78

Comments

0

Likes

3

No embeds

No notes for slide

- 1. Problem Solving in mathematics and computer science<br /> Team 4<br /> Chapter 13 <br /> Reading in Mathematics<br />Team members:<br />Lishu Liu<br />Yun Zhang<br />ProsunjitBiswas<br />Tahmina Ahmed<br />
- 2. How ideas and relationships are expressed in mathematics?<br />Ideas and relationships are expressed through notations, symbols, numbers and formulas.<br />Symbol: =,<,>,+,-,*,/ etc.<br />Number: 1,2,3,0.1,1/2,logn etc.<br />Formula: ex. y = x+2 <br />
- 3. Thought pattern in mathematics<br />The three patterns are:<br /> Process<br />Problem solving<br />Comparison and contrast<br />
- 4. The kissing problem<br />
- 5. Problem solving in mathematics- step1<br />Define the problem<br />Everyone must kiss each other.<br />We define one kiss as occurring when two people kiss each other, any number of times.<br />Q: How many kisses will occur if we have n people? <br />
- 6. Problem solving in mathematics- step2<br />Try to solvethe problem for simple cases<br />
- 7. Problem solving in mathematics- step3<br />Look for a pattern or clue<br />n=2: 1 kiss <br /> n=1: 0 kiss <br />3<br />1<br />2<br />3<br />1<br />4<br />2<br />n=4: 3+2+1 kisses<br />n=3: 2+1 kisses <br />
- 8. Problem solving in mathematics- step3 (continuing…)<br />n = 5, kisses = 4 + 3 + 2 + 1<br />n = 6, kisses = 5 + 4 + 3 + 2 +1<br />n= 7, kisses = 6 + 5 + 4 + 3 + 2 + 1<br />So, what can be the pattern for the kissing problem?<br />
- 9. Problem solving in mathematics- step4<br />Guess and check<br />What if we have n people?<br />?<br />
- 10. Problem solving in mathematics- step5<br />Use knowledge to solve the problem and extend the solution <br />Kisses = (n-1) + (n-2) + … + 1<br />
- 11. Problem solving in mathematics- step6<br />Try to find a better solution <br />Kisses = (n-1) + (n-2) + … + 1 <br /> = (n + n + … + n) – (1 + 2 + … + (n-1))<br /> = n(n-1) – n(n-1)/2<br /> = n(n-1)/2<br />(n-(n-1))<br />(n-1) factors<br />(n-1) factors<br />(n-1) factors<br />
- 12. Summarizing steps in mathematics<br />Flow chart<br />
- 13. Problem solving in computer science - step1<br />Define the problem<br />Everyone must kiss each other.<br />We define one kiss as occurring when two people kiss each other, any number of times.<br />Q: For N number of People how many kisses there will be ?<br />
- 14. Problem solving in computer science - step2<br />Get sample input and output for simple cases<br />Define input 1, 2, 3, 4 …<br /> | | | |<br />Define output 0, 1, 3, 6 …<br />
- 15. Problem solving in computer science - step3<br />Construct logic with the pattern<br />For first two input<br />So, We can assume that for n people n -1 kisses.<br />n=1: 0 kiss n=2 : 1 kiss<br />
- 16. Problem solving in computer science - step3<br />We consider more input & output to justify our guess(kiss=n-1).<br /> n=1: 0 kiss n=2: 1 kiss<br /> n=3: 2 kisses n=4: 3 kisses<br />But this time we are indeed wrong. So, need to improve our guess.<br />
- 17. Problem solving in computer science - step4<br />We will improve our solution through trial & error.<br />what will happen if we cannot reach the exact solution ?<br />
- 18. Problem solving in computer science – step4<br />So, we will construct & justify our logic using mathematical formula. <br />Kisses = n (n-1) / 2 <br />
- 19. Problem solving in computer science - step5<br />Now we have the solution<br />Now its time to code !<br />FIND NO OF KISSES( N) <br /> KISS=N(N-1)/2<br />RETURN KISS<br />
- 20. Problem solving in computer science - step6<br />Problem solved!<br />Why do we really need a computer to solve the problem?<br />
- 21. Summarizing steps in computer science<br />Flow chart<br />
- 22. Mathematics vs. Computer Science<br />
- 23. Historical relation between mathematics & computer science<br />Donald Knuth (Professor of Stanford)<br />-- Father of Analysis of Algorithm<br />Graduated in Mathematics (Case Institute of Tech.)<br />PhD in Mathematics (Caltech)<br />
- 24. Acknowledgement<br />
- 25. Questions?<br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment