Cs 1114 - lecture-8
•Download as PPT, PDF•
0 likes•293 views
The document discusses programming fundamentals and controlled repetition in programs. It explains how to write programs that can repeat a set of instructions a specified number of times to calculate values like the sum of the first n natural numbers or the factorial of a number n. Examples are provided to find the sum of the first 5 numbers, the factorial of 5, and raising a number to a power by repeated multiplication. Controlled repetition allows programmers to instruct computers to perform repetitive tasks without human intervention.
![Consider this Example ,[object Object],Programming Fundamentals | Lecture-8](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
More Related Content
What's hot
What's hot (15)
Viewers also liked
Viewers also liked (13)
Similar to Cs 1114 - lecture-8
Similar to Cs 1114 - lecture-8 (20)
More from Zeeshan Sabir
Recently uploaded
Recently uploaded (20)
Cs 1114 - lecture-8
- 3. Programming Fundamentals | Lecture-8 START STOP sum = 0 sum = sum + 2 sum = sum + 3 sum = sum + 4 sum = sum + 5 DISPLAY sum (sum=1) (sum=3) (sum=6) (sum=10) (sum=15) sum = sum + 1 (sum=0)
- 5. Programming Fundamentals | Lecture-8 What if the numbers are not just 50, they are 1000?
- 7. Is this Correct? Programming Fundamentals | Lecture-8 START sum = 0 sum = sum + _ STOP
- 10. Sum of 1 st 5 natural numbers Programming Fundamentals | Lecture-8 START sum = 0 count = count + 1 STOP count < 5 count = 0 DISPLAY sum Yes No sum = sum + count
- 11. How to Test This? Programming Fundamentals | Lecture-8 count = 0 sum = 0 Repetition-1 Repetition-2 Repetition-3 Repetition-4 Repetition-5 decision (count < 5) 0 < 5 1 < 5 2 < 5 3 < 5 4 < 5 count = count + 1 1 2 3 4 5 sum = sum + count 1 3 6 10 15
- 15. Programming Fundamentals | Lecture-8 START sum = 0 count = count + 1 STOP count < n count = 0 DISPLAY sum Yes No sum = sum + count READ n
- 17. Programming Fundamentals | Lecture-8 START fact = 1 count = count + 1 STOP count < n count = 0 DISPLAY sum Yes No fact = fact * count READ n
- 18. Testing Programming Fundamentals | Lecture-8 count = 0 fact = 1 n = 5 120 = 24 * 5 5 = 4 + 1 4 < 5 Repetition-5 Repetition-1 Repetition-2 Repetition-3 Repetition-4 decision (count < 5) 0 < 5 1 < 5 2 < 5 3 < 5 count = count + 1 1 = 0 + 1 2 = 1 + 1 3 = 2 + 1 4 = 3 + 1 fact = fact * count 1 = 1 * 1 2 = 2 *1 6 = 2 * 3 24 = 6 * 4
- 21. Programming Fundamentals | Lecture-8 BE PREPARED FOR QUIZ IN NEXT LECTURE
Editor's Notes
- * Only a decision box can divide the order or flow of program into two alternative paths