Presentation is loading. Please wait.

Presentation is loading. Please wait.

Def f(x): counter = 0 y = 0; while counter <=x: y += x counter += 1 return(y) assertEqual(f(4),______) What does this do? L OOPS :

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Def f(x): counter = 0 y = 0; while counter <=x: y += x counter += 1 return(y) assertEqual(f(4),______) What does this do? L OOPS :"— Presentation transcript:

1 def f(x): counter = 0 y = 0; while counter <=x: y += x counter += 1 return(y) assertEqual(f(4),______) What does this do? L OOPS :

2 W HILE LOOPS def f(): count = input("Enter a number") total = 0 while count >= 1: total += count count = count -1 return(total) input: asks the user for some form of input – the user should type something in. Whatever the user types in is returned from input. In this case, it is put in the variable count.

3 def ThreeYearOld(): response = "" while response != "Because.": response = input("Why?") print("Oh. Okay.") ThreeYearOld() W HILE L OOP

4 W HILE LOOPS def f(): total = 0 while count >= 1: total += count count = count -1 return(total) What does this calculate?

5 W HILE LOOPS def f(): total = 0 count = 4; while count >= 1: total += count return(total) What does this calculate?

6 RULES : If using an iterator, it must be initialized before we start the loop (outside the loop!) count = 4; while count >= 1:... The loop has to stop. Inside the loop something must change each time so that we hit the stopping condition Like recursion, we must progress toward the stopping condition while count >= 1: total += count count = count -1

7 def f(x): return(x>5) def y(ls): ct = 0 while ((ct < len(ls)) and not(f(ls[ct]))): ct += 1 return(ct) list1 = [3,-1,2,4,8,7,5] assertEqual(y(list1),______)

8 def z(ls): ct = 0 x = 0 while (ct < len(ls)): if ls[ct] > ls[x]: x = ct ct += 1 return(x) list1 = [3,-1,2,4,8,7,5] assertEqual(z(list1),______)

9 def z(ct): x = 0 while (ct >= 0): x += ct ct = ct - 1 return(x) assertEqual(z(5),______) Versus: def z(ct): x = 0 while (ct >= 0): ct = ct - 1 x += ct return(x) assertEqual(z(5),______)

10 def q(ls): ct = 0 while (ct < len(ls)/2): ls[len(ls)-(ct+1)],ls[ct] = ls[ct],ls[len(ls)-(ct + 1)] ct += 1 return(ls) list1 = [3,-1,2,4,8,7,5] assertEqual(q(list1),________________)

11 def q(x,y): ct = 0 while (ct < x): ct2 = 0 while (ct2 < y): print ct + ct2 ct2 += 1 ct += 1 q(4,3)

12 def q(x,y): ct = 0 while (ct < x): ct2 = ct while (ct2 < y): print ct + ct2 ct2 += 1 ct += 1 q(4,3)

13 def q(x): ct = 0 while (ct < x): ct2 = x while (ct2 > ct): print ct + ct2 ct2 -= 1 ct += 1 q(4)

Download ppt "Def f(x): counter = 0 y = 0; while counter <=x: y += x counter += 1 return(y) assertEqual(f(4),______) What does this do? L OOPS :"

Similar presentations

Def f(n): if (n == 0): return else: print(“*”) return f(n-1) f(3)

Def f(n): if (n == 0): return else: print(“*”) return f(n-1) f(3)
CHAPTER 5: Repetition Control Structure. Objectives  To develop algorithms that use DOWHILE and REPEAT.. UNTIL structures  Introduce a pseudocode for.

CHAPTER 5: Repetition Control Structure. Objectives  To develop algorithms that use DOWHILE and REPEAT.. UNTIL structures  Introduce a pseudocode for.
CS0004: Introduction to Programming Repetition – Do Loops.

CS0004: Introduction to Programming Repetition – Do Loops.
Def find_largest(x,y): largest = 0; count = 0; while count < x: rnum = randrange(0,y) if rnum > largest: largest = rnum count +=1 return(largest); print(find_largest(7,50))

Def find_largest(x,y): largest = 0; count = 0; while count < x: rnum = randrange(0,y) if rnum > largest: largest = rnum count +=1 return(largest); print(find_largest(7,50))
Def f(x): counter = 0 y = 0; while counter

Def f(x): counter = 0 y = 0; while counter
Programming Seminar 2009 Night 1. Review: Last Time We covered variables, for loops, functions, modules, and how programming isn’t math – Actually, we.

Programming Seminar 2009 Night 1. Review: Last Time We covered variables, for loops, functions, modules, and how programming isn’t math – Actually, we.
True BASIC Ch. 6 Practice Questions. What is the output? PRINT X LET X = -1 PRINT X FOR X = 4 TO 5 STEP 2 PRINT X NEXT X PRINT X END.

True BASIC Ch. 6 Practice Questions. What is the output? PRINT X LET X = -1 PRINT X FOR X = 4 TO 5 STEP 2 PRINT X NEXT X PRINT X END.
ITERATIVE CONSTRUCTS: DOLIST Dolist is an iterative construct (a loop statement) consisting of a variable declaration and a body The body states what happens.

ITERATIVE CONSTRUCTS: DOLIST Dolist is an iterative construct (a loop statement) consisting of a variable declaration and a body The body states what happens.
Imperative programming public int factorial (int N){ int F = 1; for(X=N; X>1; X-- ){ F= F*X; } return F; } Functional programming (defun factorial(N) (cond.

Imperative programming public int factorial (int N){ int F = 1; for(X=N; X>1; X-- ){ F= F*X; } return F; } Functional programming (defun factorial(N) (cond.
Python November 18, Unit 7. So Far We can get user input We can create variables We can convert values from one type to another using functions We can.

Python November 18, Unit 7. So Far We can get user input We can create variables We can convert values from one type to another using functions We can.
Repetition. Examples When is repetition necessary/useful?

Repetition. Examples When is repetition necessary/useful?
CHAPTER 2 ANALYSIS OF ALGORITHMS Part 2. 2 Running time of Basic operations Basic operations do not depend on the size of input, their running time is.

CHAPTER 2 ANALYSIS OF ALGORITHMS Part 2. 2 Running time of Basic operations Basic operations do not depend on the size of input, their running time is.
Recursion. Sum a list of numbers Iterative def sum(L): total = 0 for i in L: total += i return total Recursive def sum(L): if len(L) == 0: return 0 else:

Recursion. Sum a list of numbers Iterative def sum(L): total = 0 for i in L: total += i return total Recursive def sum(L): if len(L) == 0: return 0 else:
Nested Loops. Nesting Control Structures One if statement inside another one An if statement inside a loop A loop inside an if statement Control structures.

Nested Loops. Nesting Control Structures One if statement inside another one An if statement inside a loop A loop inside an if statement Control structures.
Python – Part 4 Conditionals and Recursion. Modulus Operator Yields the remainder when first operand is divided by the second. >>>remainder=7%3 >>>print.

Python – Part 4 Conditionals and Recursion. Modulus Operator Yields the remainder when first operand is divided by the second. >>>remainder=7%3 >>>print.
1. Definition and General Structure 2. Small Example 1 3. Simplified Structure 4. Short Additional Examples 5. Full Example 2 6. Common Error The for loop.

1. Definition and General Structure 2. Small Example 1 3. Simplified Structure 4. Short Additional Examples 5. Full Example 2 6. Common Error The for loop.
Logic Structure - focus on looping Please use speaker notes for additional information!

Logic Structure - focus on looping Please use speaker notes for additional information!
PPT3. Quick function:  Write a function that checks to see if a number is even or not.  What TYPE does this return?

PPT3. Quick function:  Write a function that checks to see if a number is even or not.  What TYPE does this return?
Python Repetition. We use repetition to prevent typing the same code out many times and to make our code more efficient. FOR is used when you know how.

Python Repetition. We use repetition to prevent typing the same code out many times and to make our code more efficient. FOR is used when you know how.
Lecture 4 Looping. Building on the foundation Now that we know a little about  cout  cin  math operators  boolean operators  making decisions using.

Lecture 4 Looping. Building on the foundation Now that we know a little about  cout  cin  math operators  boolean operators  making decisions using.

Similar presentations

Ads by Google