![Algorithm
Step 1: Input N1, N2, N3
Step 2: if (N1>N2) then
if (N1>N3) then
MAX N1
[N1>N2, N1>N3]
else
MAX N3
[N3>N1>N2]
endif
else
if (N2>N3) then
MAX N2
[N2>N1, N2>N3]
else
MAX N3
[N3>N2>N1]
endif
endif
Step 3: Print The largest number is, MAX
惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕
拆](https://image.slidesharecdn.com/session-03-131231015733-phpapp02/85/Algorithm-and-Flowchart-41-320.jpg)
More Related Content
Featured (20)
Algorithm and Flowchart
- 1. 悋擯惘惠 悋惘惠 惆擧惠惘 悋惆惘 愆 惆悋愆擯悋 惠惘悋 惡惘慍 惘愕 拆愆擯悋 悋惺 悋惘 悋愀悋惺悋惠 悋惘悋
- 2. 悋擯惘惠
- 3. 惘愆 忰 愕悧 惡悋 悋愕惠悋惆 悋慍 惘愆悋 惠忰悋 拆 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘悋惷 惘愕 拆
- 4. 擧 惴 惡惘悋 愕 惺 惘忰 忰 愕悧 愀惘悋忰 惆惡悋悋 惴 悋慍 擯悋悋 忰 愕悧 拆 拆 悋 惆惡悋 惘悋 悋擯惘惠 悋惆 拆 惘忰 悋悴惘悋 悋悴惘悋 擧 惡惘悋 惆惘 慍惡悋悋 惡惘悋愕 惘悋悴 拆 拆 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 5. 惠惺惘 悋擯惘惠 悴悋惺悋 悋慍 惆愕惠惘悋惺悋 擧 惡 慍惡悋 惆 拆 拆 悋惡惡 惡 惡惡 惘悋 悴慍悧悋惠 慍 惡惡 惶惘惠 惘忰惡 惡惡 惘忰惡 惡惡 擯悋 悋悴惘悋 愆惆 擧 惆 拆 悽悋惶 )忰 愕悧( 惘悋 惆惡悋 擧惆 愆惘惺 悽悋惠 悛 慍 愆悽惶 惡悋愆惆. 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 6. 悋惆悋 惠惺惘 悋擯惘惠 奄 奄 奄 奄 惴惘 悋慍 慍惡悋 惆: 悛 悋愕惠 擧 悋擯惘惠 惆悋 惡 悋 惶惘惠擧 惘惆 惴惘 愕惆 悋愕惠 悋悴惘悋 擯惘惆惆. 惴惘 悋慍 悴慍悧悋惠 擧悋 悛 悋愕惠 擧 惆惘 愀 悋悴惘悋 悋擯惘惠 悋惺悋惠 悋愆悋悽惠 拆愆 悋惆 惡悋悋惺惓 悋忰惘悋 悋慍 愕惘 惆 悋惶 擯惘惆惆. 惴惘 悋慍 惠惘惠惡 惘悋忰 悛 悋愕惠 擧 惘悋忰 悋悴惘悋 悋擯惘惠 惆 惡 惆 惡悋 惘悋惺悋惠 惠惆 惠悖 悽惘 愆悽惶 愆惆 惡悋愆惆. 惴惘 悋慍 愆惘愀 悽悋惠 拆悋悋 拆悵惘 惡惆 悋擯惘惠 惡悋愆惆 惡惘 忰悋 悋擯惘惠 惡悋惆 惆惘 慍悋 惆悽悋 惠忰惠 愆惘悋愀 悋 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 7. 惘悋忰 惠 悋擯惘惠 1- 惠惺惘 惆 愕悧: 惡悋惆 愕悧 惘悋 惠悴慍 惠忰 擧惘惆 惠悋 擧擧惠惘 悋惡悋 惆惘 悛 悴惆 惆悋愆惠 惡悋愆惆. 2- 惠惺 悋惺悋 悋惶)惠愃惘悋( 惘惆 悋慍 3- 惠惺 惘惆 悽惘悴 愕悧 : )惆悋惆 悋 悋愀悋惺悋惠( 4- 惡惘惘愕 惘悋 忰 悋 悽惠 愕悧 5- 悋惠悽悋惡 擧 惘悋 忰 悋愕惡 6- 悋愆擧悋 慍惆悋 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 8. 惡 慍惡悋 愕悋惆惠惘 拆 悋擯惘惠 惡 擧 愕惘 惆愕惠惘悋惺悋 惡惘悋 忰 擧 拆 愕悧 擯惠 愆惆. 拆 愕悧 惠悋惆 悋慍 惘 惺 惡悋愆惆 拆 愕悋悧 擧悋惘: 悋悽惠惶悋惶 惘 擧悋惘 惡惘悋 擧愕惡 惡悋惠惘 愕惆 愕悋悧 惘慍惘 慍惆擯 擯惘愕悋 愀惘 惠悋 擧 拆惠慍悋 愕悋惘愆 惡惆 拆 拆 惠惷忰 惆悋惆 擯擯 惡愕惠 惡惆 擧愆 惡 擧 擧惆擧 拆悴 愕悋. 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 9. 愆惘悋愀 悋擯惘惠 擧 悋擯惘惠 悋愕惡 慍惡悋 愕悋惆 悴慍悧悋惠 擧悋 愆惘惺 拆悋悋 悋擯惘惠 惠惘惠惡 悋悴悋 惆愕惠惘悋惺悋 拆 悴悋惺 惡惆 悋愕惠悋惆 悋慍 忰惆悋 惆愕惠惘悋惺悋 拆 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 10. 惡悋慍 惠惺惘 悋擯惘惠 惆惘 惆悋 拆惘惆悋慍愆 惆悋惆 悋 惡悋 愕悋悧 惘惡愀 惡 拆惘惆悋慍愆 惆悋惆 愕惘擧悋惘 惆悋惘 愕悋悧 惡悋惆 惡 慍惡悋 惡惘悋悋 惠惘悴 愆惆 拆 悋慍 悛悴悋 擧 悋 惆惘 悋 惺惠 惠悋 惘惆 悵悽惘 拆惘惆悋慍愆 悽惘悴 惆悋惘 惆愕惠惘 悋惺悋 悋擯惘惠 悋 惠悋 忰惆惆 惡 悋 悋惆悋悋惠 拆 悽悋惆 惡惆. 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 11. Algorithmic Representation of Computer Functions Input Store information Given/Result Intermediates/Set Process Read, Get (input command) Storage Get information Arithmetic Repeat instructions Branch conditionals Let (assignment command) Loop If Output Give information Give, Print, Show (output command) 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 12. 惘惆 惆惘愕 惆悋惆拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 13. 悽惘悴 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 14. 惆愕惠惘悋惺 忰悋愕惡悋惠 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 15. 惆愕惠惘悋惺 悋 惘悋惡愀 悋 拆 拆 Relational Operators Operator Description > Greater than < Less than = Equal to Greater than or equal to Less than or equal to Not equal to 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 16. 擧 惓悋 愕悋惆 忰悋愕惡 悋擯 愕 惺惆惆 A B C 0= 愆惘惺 1 = A B C惘悋 惆惘悋惠 擧惆 2= 悴惺 A B C惘悋 忰悋愕惡 擧惆 3= 忰悋惶 惘悋 惡惘 3 惠愕 擧 4= 悋擯 惘悋 悋愆 惡惆 5= 惘拆悋悋 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 17. 愆惘愀 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 18. 愆惘愀 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 19. 惺擯惘悋 悋愕悋 拆 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 20. 擧 惓悋 愕悋惆 惠惺 惡慍惘擯惠惘 惆悋惘 悋 愕 惺惆惆 A B C 0= 愆惘惺 1 = A B C惘悋 惆惘悋惠 擧惆 2 = A惘悋 惆惘 MAX悵悽惘 擧 3= 惆惘 惶惘惠 擧 B悋慍 MAX惡慍惘擯惠惘 悋愕惠 悛擯悋 B惘悋 惆惘 MAX 悵悽惘 擧 4= 惆惘 惶惘惠 擧 C悋慍 MAX惡慍惘擯惠惘 悋愕惠 悛擯悋 C惘悋 惆惘 MAX 悵悽惘 擧 5 =MAX惘悋 悋愆 惡惆 6= 惘拆悋悋 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 21. 忰悋惠 愆悋惠擧 惓悋 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 22. Example Example 1: Write an algorithm to determine a students final grade and indicate whether it is passing or failing. The final grade is calculated as the average of four marks. 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 23. Input a set of 4 marks Calculate their average by summing and dividing by 4 if average is below 50 Print FAIL else Print PASS 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 24. Detailed Algorithm Step 1: Input M1,M2,M3,M4 Step 2: GRADE (M1+M2+M3+M4)/4 Step 3: if (GRADE < 50) then Print FAIL else Print PASS endif 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 25. 惺擯惘悋 愀 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 26. 惆愕惠惘悋惺悋 惠擧惘悋惘 )忰悋( 拆 拆 惡惘悋 忰 愕悋悧 悽惠 惆愕惠惘悋惺悋 擧 惠悋 拆 擧 悋惆 擯惘惠 惡 惠悋 擧悋 愕惠惆 悋 悴惡惘 惡 悋愕惠悋惆 悋慍 惆愕惠惘悋惺悋 惠擧惘悋惘 愕惠 悋 拆 忰悋 悋慍 悋悴慍悋悄 慍惘 惠愆擧 愆惆: 拆 拆 愆悋惘惆 忰 惆悋惘 悋 愆惘愀 忰 惆愕惠惘悋惠 忰 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 27. 惓悋 悋擯惘惠 愀惘悋忰 擧惆 擧 悋惺惆悋惆 愀惡惺 擧擧惠惘 悋慍 05 惘悋 悋愆 惆惆. 愕悧 惆悋惆 惘惆 惆悋惘惆 悋 惺惆惆 愀惡惺 1 悋愕惠 惘 惺惆惆 惡悋 惺惆惆 惡惺惆 擧 悋忰惆 悋悽惠 惆悋惘惆 惠愃惘 N 惘悋 惆惘 惴惘 惡擯惘惆 惆悋惘 擧 惘悋 惆惘 悛 悵悽惘 擧惆. 1. 愆惘惺 2 .1= (N惆悋惘 悋) 3 .N惘悋 悋愆 惡惆 ) )惆愕惠惘悋惠 忰 4 .N + 1= N惘悋 悋愆 惡惆 ) 惆愕惠惘悋惠 忰) 5. 悋擯惘 05< N悛擯悋 惡 惘忰 3 惡惘 )愆惘愀 忰( 6. 惘拆悋悋 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 28. Quiz 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 29. ).Quiz (10 min A悋擯惘惠 惡愕惆 擧 愕惺悋 惺惆惆 愀惡惺 . 拆 拆 惆悽悋.M惘悋 忰悋愕惡 擧惘惆 悋愆 惆惆 B悋擯惘惠 惡愕惆 擧 忰 惆愕惠慍惆 擧悋惘擯惘悋 擧 . 擧悋惘悽悋 惘悋 愀悋惡 愆惘悋愀 慍惘 忰悋愕惡 擧惆 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 30. Answer A 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 31. 1Answer B 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 32. 2 Answer B 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 33. 悋惘 惠
- 34. 惆惘 惆悋 悋惺 愕悋悧 惡 愕悋惆擯 惓悋悋 擧 拆 擯惠 愕惠惆 惡悋 悋慍悋愆 惆愕惠惘悋惺悋 擯愕惠惘惆 愆惆 拆 悋擯惘惠 惡惘悋愕悋 擯悴 愆惆 拆 拆 擧 惘愆 惆 惡惘悋 擧悋惘 悛惆 惡悋 悋 愕悧 惠惘愕 愀惘悋忰 悋惘惠 悋愕惠 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 35. 悋惘惠 愕惠 惠惺惘 惆擧愆惘: 悋惘悋悧 愆悋惠擧 惆惡悋悋 悋慍 拆 悋惆悋悋惠 悛悋 擧 惆惘 擧 惘悋惆 愕悋悽惠 悋 擧 惡惘悋愕 惘悋悋悋 悋惠悋 悋惠惆 拆 拆 拆 : 悋惘悋悧 擯惘悋擧 惆惡悋悋 悋慍 悋惆悋悋惠 惆惘 擧 拆 惴悋 悋愀惺悋惠 悋 擧 惡惘悋 惘悋悋悋 拆 惴悋悋 悋愀惺悋惠: 擯 悋愀惺悋惠 擧 愕惆 惡 惆愕惠 拆 擧悋惘惡惘 悋 惘愕惆 拆 惡惘悋 惘悋悋悋: 惆惡悋悋 悋慍 悋惆悋悋惠 惆惘 擧 惡惘悋 拆 拆 悋忰惆. 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 36. Flowchart Symbols 愆擧 愆惘忰 惡惘悋 愆悋 惆悋惆 愆惘惺 悽悋惠 惺悋惠 忰悋愕惡悋惠 惆悋惘惆 惘惆 悋愀惺悋惠 悽惘悴 惡惘 惘 惶忰 悋愆 悽惘悴 悋愀惺悋惠 惡惘 惘 擧悋愃悵 愕悧悋 惠惶 擯惘 愆惘愀 悋 惆悽悋 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆 惓悋 start stop ca+b d i A,B 001,A,B ?
- 37. Example Step 1: Input M1,M2,M3,M4 Step 2: GRADE (M1+M2+M3+M4)/4 Step 3: if (GRADE <50) then Print FAIL else Print PASS endif START Input M1,M2,M3,M4 GRADE(M1+M2+M3+M4)/4 N IS GRADE<5 0 PRINT PASS Y PRINT FAIL STOP 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 38. Example Write an algorithm that reads two values, determines the largest value and prints the largest value with an identifying message. ALGORITHM Step 1: Input VALUE1, VALUE2 Step 2: if (VALUE1 > VALUE2) then MAX VALUE1 else MAX VALUE2 endif Step 3: Print The largest value is, MAX 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 39. Example START Input VALUE1,VALUE2 Y is VALUE1>VALUE2 MAX VALUE1 N MAX VALUE2 Print The largest value is, MAX STOP 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 40. The Problem Write an algorithm that reads three numbers and prints the value of the largest number. 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 41. Algorithm Step 1: Input N1, N2, N3 Step 2: if (N1>N2) then if (N1>N3) then MAX N1 [N1>N2, N1>N3] else MAX N3 [N3>N1>N2] endif else if (N2>N3) then MAX N2 [N2>N1, N2>N3] else MAX N3 [N3>N2>N1] endif endif Step 3: Print The largest number is, MAX 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 42. Flowchart NO 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 43. 惓悋 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆 悋愕 惆 惆悋惘 AB
- 44. Quiz 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 45. Quiz (10 min.) a) b) Write and algorithm and draw a flowchart to read an employee name (NAME), overtime hours worked (OVERTIME), hours absent (ABSENT) and determine the bonus payment (PAYMENT). 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 46. Bonus Schedule OVERTIME (2/3)*ABSENT Bonus Paid >40 hours >30 but 40 hours >20 but 30 hours >10 but 20 hours 10 hours $50 $40 $30 $20 $10 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 47. Step 1: Input NAME,OVERTIME,ABSENT Step 2: if (OVERTIME(2/3)*ABSENT > 40) then PAYMENT 50 else if (OVERTIME(2/3)*ABSENT > 30) then PAYMENT 40 else if (OVERTIME(2/3)*ABSENT > 20) then PAYMENT 30 else if (OVERTIME(2/3)*ABSENT > 10) then PAYMENT 20 else PAYMENT 10 endif Step 3: Print Bonus for, NAME is $, PAYMENT 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆
- 48. nnaghsh@ut.ac.ir , rasuli9@gmail.com 惆惘愕 惆悋惆惘拆惘惆悋慍 * 惆擧惠惘 悋惆惘 愆 惡惘慍 惘愕 拆