function examples announcements hog contest rules
play

Function Examples Announcements Hog Contest Rules 3 - PowerPoint PPT Presentation

Aug 22, 2023 •192 likes •1.3k views

Function Examples Announcements Hog Contest Rules 3 cs61a.org/proj/hog_contest Hog Contest Rules Up to two people submit one entry; Max of one entry per person 3 cs61a.org/proj/hog_contest Hog Contest Rules Up to two people submit

  1. Hog Contest Winners Fall 2017 Winners Alex Yu and Tanmay Khattar Spring 2015 Winners James Li Sinho Chewi & Alexander Nguyen Tran Justin Yokota Zhaoxi Li Spring 2018 Winners Stella Tao and Yao Ge Eric James Michaud Ziyu Dong Fall 2015 Winners Xuhui Zhou Micah Carroll & Vasilis Oikonomou Fall 2018 Winners Matthew Wu Rahul Arya Anthony Yeung and Alexander Dai Jonathan Bodine Sumer Kohli and Neelesh Ramachandran Spring 2016 Winners Fall 2019 Winners Michael McDonald and Tianrui Chen Jet Situ and Lucas Schaberg Andrei Kassiantchouk Anthony Han and Hongyi Huang Benjamin Krieges Arthur Pan and Qingyuan Liu Spring 2020 Winners Fall 2016 Winners Cindy Jin and Sunjoon Lee Anny Patino and Christian Vasquez Asana Choudhury and Jenna Wen Michelle Lee and Nicholas Chew 4

  2. Hog Contest Winners Fall 2017 Winners Alex Yu and Tanmay Khattar Spring 2015 Winners James Li Sinho Chewi & Alexander Nguyen Tran Justin Yokota Zhaoxi Li Spring 2018 Winners Stella Tao and Yao Ge Eric James Michaud Ziyu Dong Fall 2015 Winners Xuhui Zhou Micah Carroll & Vasilis Oikonomou Fall 2018 Winners Matthew Wu Rahul Arya Anthony Yeung and Alexander Dai Jonathan Bodine Sumer Kohli and Neelesh Ramachandran Spring 2016 Winners Fall 2019 Winners Michael McDonald and Tianrui Chen Jet Situ and Lucas Schaberg Andrei Kassiantchouk Anthony Han and Hongyi Huang Benjamin Krieges Arthur Pan and Qingyuan Liu Spring 2020 Winners Fall 2016 Winners Andy Dong Cindy Jin and Sunjoon Lee Theodor Sion and Anish Kar Anny Patino and Christian Vasquez Shaun Diem-Lane Asana Choudhury and Jenna Wen Michelle Lee and Nicholas Chew 4

  3. Hog Contest Winners Fall 2017 Winners Alex Yu and Tanmay Khattar Spring 2015 Winners James Li Sinho Chewi & Alexander Nguyen Tran Justin Yokota Zhaoxi Li Spring 2018 Winners Stella Tao and Yao Ge Eric James Michaud Ziyu Dong Fall 2015 Winners Xuhui Zhou Micah Carroll & Vasilis Oikonomou Fall 2018 Winners Matthew Wu Rahul Arya Anthony Yeung and Alexander Dai Jonathan Bodine Sumer Kohli and Neelesh Ramachandran Spring 2016 Winners Fall 2019 Winners Michael McDonald and Tianrui Chen Jet Situ and Lucas Schaberg Andrei Kassiantchouk Anthony Han and Hongyi Huang Benjamin Krieges Arthur Pan and Qingyuan Liu Spring 2020 Winners Fall 2016 Winners Andy Dong Cindy Jin and Sunjoon Lee Theodor Sion and Anish Kar Anny Patino and Christian Vasquez Shaun Diem-Lane Asana Choudhury and Jenna Wen Fall 2020 Winners Michelle Lee and Nicholas Chew 4

  4. Hog Contest Winners Fall 2017 Winners Alex Yu and Tanmay Khattar Spring 2015 Winners Your name could be here FOREVER! James Li Sinho Chewi & Alexander Nguyen Tran Justin Yokota Zhaoxi Li Spring 2018 Winners Stella Tao and Yao Ge Eric James Michaud Ziyu Dong Fall 2015 Winners Xuhui Zhou Micah Carroll & Vasilis Oikonomou Fall 2018 Winners Matthew Wu Rahul Arya Anthony Yeung and Alexander Dai Jonathan Bodine Sumer Kohli and Neelesh Ramachandran Spring 2016 Winners Fall 2019 Winners Michael McDonald and Tianrui Chen Jet Situ and Lucas Schaberg Andrei Kassiantchouk Anthony Han and Hongyi Huang Benjamin Krieges Arthur Pan and Qingyuan Liu Spring 2020 Winners Fall 2016 Winners Andy Dong Cindy Jin and Sunjoon Lee Theodor Sion and Anish Kar Anny Patino and Christian Vasquez Shaun Diem-Lane Asana Choudhury and Jenna Wen Fall 2020 Winners Michelle Lee and Nicholas Chew 4

  5. Describing Functions

  6. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): k = 1 while k < n: if likes(n): print(k) k = k + 2 mystery1 prints ______ less than n ______ . 6

  7. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): One approach: k = 1 while k < n: if likes(n): print(k) k = k + 2 mystery1 prints ______ less than n ______ . 6

  8. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): One approach: k = 1 1. Read the code while k < n: if likes(n): print(k) k = k + 2 mystery1 prints ______ less than n ______ . 6

  9. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): One approach: k = 1 1. Read the code while k < n: 2. Read the description options if likes(n): print(k) k = k + 2 mystery1 prints ______ less than n ______ . 6

  10. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): One approach: k = 1 1. Read the code while k < n: 2. Read the description options if likes(n): 3. Consider an example print(k) k = k + 2 mystery1 prints ______ less than n ______ . 6

  11. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): One approach: k = 1 1. Read the code while k < n: 2. Read the description options if likes(n): 3. Consider an example print(k) k = k + 2 mystery1 prints ______ less than n ______ . mystery1 prints all odd numbers less than n that George likes. 6

  12. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): likes = is_prime One approach: n = 8 k = 1 1. Read the code while k < n: 2. Read the description options if likes(n): 3. Consider an example print(k) k = k + 2 mystery1 prints ______ less than n ______ . mystery1 prints all odd numbers less than n that George likes. 6

  13. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): likes = is_prime One approach: n = 8 k = 1 1. Read the code while k < n: 2. Read the description options if likes(n): 3. Consider an example print(k) k = k + 2 mystery1 prints ______ less than n ______ . mystery1 prints all odd numbers less than n that George likes. 6

  14. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): likes = is_prime One approach: n = 8 k = 1 1. Read the code while k < n: 2. Read the description options if likes(n): 3. Consider an example print(k) k = k + 2 all odd numbers mystery1 prints ______ less than n ______ . mystery1 prints all odd numbers less than n that George likes. 6

  15. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery1(n): likes = is_prime One approach: n = 8 k = 1 1. Read the code while k < n: 2. Read the description options if likes(n): 3. Consider an example print(k) k = k + 2 all odd numbers but only if George likes n mystery1 prints ______ less than n ______ . mystery1 prints all odd numbers less than n that George likes. 6

  16. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery2(n): One approach: i, j, k = 0, None, None 1. Read the code while i < n: 2. Read the description options if likes(i): 3. Consider an example if j != None and (k == None or i - j < k): k = i - j j = i i = i + 1 return k mystery 2 returns ______ or returns None if ______ . 7

  17. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery2(n): One approach: i, j, k = 0, None, None 1. Read the code while i < n: 2. Read the description options if likes(i): 3. Consider an example if j != None and (k == None or i - j < k): k = i - j j = i i = i + 1 return k the smallest difference between two positive integers below n that George likes mystery 2 returns ______ or returns None if ______ . 7

  18. Boolean Favorites def likes(n): """Returns whether George Boole likes the non-negative integer n.""" ... def mystery2(n): One approach: i, j, k = 0, None, None 1. Read the code while i < n: 2. Read the description options if likes(i): 3. Consider an example if j != None and (k == None or i - j < k): k = i - j j = i i = i + 1 return k the smallest difference between There are no two two positive integers below n such integers that George likes mystery 2 returns ______ or returns None if ______ . 7

  19. Generating Environment Diagram

  20. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  21. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  22. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  23. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  24. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  25. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  26. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  27. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  28. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  29. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop ______ flip(____)(3) 9

  30. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) 9

  31. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) 9

  32. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1) 9

  33. A Day at the Beach def flip(flop): if ______: ______ flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1) 9

  34. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1) 9

  35. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1) 9

  36. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1) 9

  37. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1) 9

  38. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1) 9

  39. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  40. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  41. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  42. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  43. A Day at the Beach def flip(flop): not true for flop == 1 if ______: ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  44. A Day at the Beach def flip(flop): not true for flop == 1 if ______: true for flop == 3 ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  45. A Day at the Beach def flip(flop): not true for flop == 1 flop>2 if ______: true for flop == 3 ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  46. A Day at the Beach def flip(flop): not true for flop == 1 flop>2 if ______: true for flop == 3 return None ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  47. A Day at the Beach def flip(flop): not true for flop == 1 flop>2 if ______: true for flop == 3 return None ______ lambda flip: 3 flip = ______ return flip def flop(flip): return flop flip, flop = flop, flip ______ flip(____)(3) flop(1)(2) 9

  48. Implementing Functions

  49. Implementing a Function def remove(n, digit): """Return all digits of non-negative N that are not DIGIT, for some non-negative DIGIT less than 10. >>> remove(231, 3) 21 >>> remove(243132, 2) 4313 """ kept, digits = 0, 0 while ________________________________: n, last = n // 10, n % 10 if _______________________________: kept = _______________________ digits = _____________________ return _______________________________ 11

  50. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some non-negative DIGIT less than 10. >>> remove(231, 3) 21 >>> remove(243132, 2) 4313 """ kept, digits = 0, 0 while ________________________________: n, last = n // 10, n % 10 if _______________________________: kept = _______________________ digits = _____________________ return _______________________________ 11

  51. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) 21 >>> remove(243132, 2) 4313 """ kept, digits = 0, 0 while ________________________________: n, last = n // 10, n % 10 if _______________________________: kept = _______________________ digits = _____________________ return _______________________________ 11

  52. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) 4313 """ kept, digits = 0, 0 while ________________________________: n, last = n // 10, n % 10 if _______________________________: kept = _______________________ digits = _____________________ return _______________________________ 11

  53. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. while ________________________________: n, last = n // 10, n % 10 if _______________________________: kept = _______________________ digits = _____________________ return _______________________________ 11

  54. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 if _______________________________: kept = _______________________ digits = _____________________ return _______________________________ 11

  55. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 Write code to compute the result if _______________________________: kept = _______________________ digits = _____________________ return _______________________________ 11

  56. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 Write code to compute the result if _______________________________: Did you really return the right thing? kept = _______________________ digits = _____________________ return _______________________________ 11

  57. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 Write code to compute the result if _______________________________: Did you really return the right thing? kept = _______________________ digits = _____________________ Check your solution with the other examples return _______________________________ 11

  58. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 Write code to compute the result if _______________________________: Did you really return the right thing? kept = _______________________ digits = _____________________ Check your solution with the other examples return _______________________________ 11

  59. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 Write code to compute the result if _______________________________: Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples return _______________________________ 11

  60. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 Write code to compute the result if _______________________________: Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples return _______________________________ 11

  61. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples return _______________________________ 11

  62. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  63. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: kept + last Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  64. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: 10* kept + last Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  65. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: 10* kept + last Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  66. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: 10* kept + last *10 Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  67. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. 1 >>> remove(231, 3) Read the template 21 + 20 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR 21 kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: 10* kept + last *10 Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  68. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. 1 >>> remove(231, 3) Read the template 21 + 20 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR 21 kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: 10* kept + last *10 Did you really return the right thing? kept = _______________________ digits + 1 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  69. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. 1 >>> remove(231, 3) Read the template 21 + 20 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR 21 kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: **digits 10* kept + last *10 Did you really return the right thing? kept = _______________________ digits + 1 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  70. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 4 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. 1 >>> remove(231, 3) Read the template 21 + 20 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR 21 kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: **digits 10* kept + last *10 Did you really return the right thing? kept = _______________________ digits + 1 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  71. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 4 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. 1 >>> remove(231, 3) Read the template 21 + 20 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR 21 kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: **digits 10* kept + last *10 Did you really return the right thing? kept = _______________________ digits + 1 231 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  72. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 4 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. 1 1 >>> remove(231, 3) Read the template 21 + 20 + 30 >>> remove(243132, 2) Implement without the template, then change 4313 + 200 your implementation to match the template. """ OR 21 231 kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: **digits 10* kept + last *10 Did you really return the right thing? kept = _______________________ digits + 1 231 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 11

  73. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: kept + last Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 12

  74. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: kept + last /10 Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept return _______________________________ 12

  75. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: kept + last /10 Did you really return the right thing? kept = _______________________ 21 digits = _____________________ Check your solution with the other examples kept * 10 return _______________________________ 12

  76. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: kept + last /10 Did you really return the right thing? kept = _______________________ digits + 1 21 digits = _____________________ Check your solution with the other examples kept * 10 return _______________________________ 12

  77. Implementing a Function def remove(n, digit): Read the description """Return all digits of non-negative N that are not DIGIT, for some 231 3 Verify the examples & pick a simple one non-negative DIGIT less than 10. >>> remove(231, 3) Read the template 21 >>> remove(243132, 2) Implement without the template, then change 4313 your implementation to match the template. """ OR kept, digits = 0, 0 If the template is helpful, use it. n > 0 while ________________________________: Annotate names with values from your chosen example n, last = n // 10, n % 10 last != digit Write code to compute the result if _______________________________: kept + last /10 Did you really return the right thing? kept = _______________________ digits + 1 21 digits = _____________________ Check your solution with the other examples kept * 10 ** (digits-1) return _______________________________ 12

Recommend

Function Examples Announcements Hog Contest Rules Up to two people submit one entry; Fall

Function Examples Announcements Hog Contest Rules Up to two people submit one entry; Fall

Function Examples Announcements Hog Contest Rules Up to two people submit one entry; Fall 2011 Winners Max of one entry per person Kaylee Mann Your score is the number of entries Yan Duan &amp; Ziming Li Brian Prike &amp; Zhenghao

401 views • 14 slides
Announcements 61A Lecture 7 Hog Contest Rules Hog Contest Winners Your name could be here

Announcements 61A Lecture 7 Hog Contest Rules Hog Contest Winners Your name could be here

Announcements 61A Lecture 7 Hog Contest Rules Hog Contest Winners Your name could be here FOREVER! Up to two people submit one entry; Fall 2011 Winners Max of one entry per person Spring 2015 Winners Kaylee Mann Slight rule

414 views • 3 slides
CS61A Lecture #38: Conclusion Announcements: Homework 11 will be judging the contest.

CS61A Lecture #38: Conclusion Announcements: Homework 11 will be judging the contest.

CS61A Lecture #38: Conclusion Announcements: Homework 11 will be judging the contest. Due next Friday. Contest submissions due next Tuesday at midnight. Submit your contest.scm file and Scheme project files (updated if needed) as

585 views • 12 slides
Announcements Project 4 due tonight HW7 due Wednesday Contest 2 is out, due 4/7 CS 188:

Announcements Project 4 due tonight HW7 due Wednesday Contest 2 is out, due 4/7 CS 188:

Announcements Project 4 due tonight HW7 due Wednesday Contest 2 is out, due 4/7 CS 188: Artificial Intelligence Decision Networks and Value of Perfect Information Instructors: Sergey Levine and Anca Dragan University of California,

467 views • 27 slides
Rules presentation Version 9 June 2017 IJF RULES 2017-2020 Duration of contest Men and women

Rules presentation Version 9 June 2017 IJF RULES 2017-2020 Duration of contest Men and women

Adaptation of the Judo refereeing rules for the next 2017-2020 Olympic Cycle Rules presentation Version 9 June 2017 IJF RULES 2017-2020 Duration of contest Men and women four (4) minutes. 2 IJF RULES 2017-2020 Evaluation of the points

648 views • 47 slides
Subject line contest Subject line contest Examples of subject lines Meet The Guy We Gave $2000

Subject line contest Subject line contest Examples of subject lines Meet The Guy We Gave $2000

Subject line contest Subject line contest Examples of subject lines Meet The Guy We Gave $2000 To Write This Sentence at MarketingSherpa Email Summit 2014 Life has many regrets. Dont let this be one. Learn to write compelling subject lines

683 views • 26 slides
CS 61A Lecture 11 Wednesday, February 18 Announcements 2 Announcements Optional Hog Contest

CS 61A Lecture 11 Wednesday, February 18 Announcements 2 Announcements Optional Hog Contest

CS 61A Lecture 11 Wednesday, February 18 Announcements 2 Announcements Optional Hog Contest due Wednesday 2/18 @ 11:59pm 2 Announcements Optional Hog Contest due Wednesday 2/18 @ 11:59pm Homework 3 due Thursday 2/19 @ 11:59pm 2

1.31k views • 77 slides
Announcements Trees Congratulations to the Winners of the Hog Strategy Contest 1st Place with 146

Announcements Trees Congratulations to the Winners of the Hog Strategy Contest 1st Place with 146

Announcements Trees Congratulations to the Winners of the Hog Strategy Contest 1st Place with 146 wins : &quot;A submission scores a match point each time it has an expected win A five-way tie for first place! rate strictly above

203 views • 3 slides
Trees Announcements Congratulations to the Winners of the Hog Strategy Contest 1st Place with 146

Trees Announcements Congratulations to the Winners of the Hog Strategy Contest 1st Place with 146

Trees Announcements Congratulations to the Winners of the Hog Strategy Contest 1st Place with 146 wins : &quot;A submission scores a match point each time it has an expected win A five-way tie for first place! rate strictly above

637 views • 21 slides
Announcements Department coin design contest deadline - IT420: Database Management and

Announcements Department coin design contest deadline - IT420: Database Management and

Announcements Department coin design contest deadline - IT420: Database Management and February 6 Organization 6-week exam Monday, February 12 Lab 4 SQL SQL Server: Normalization ALTER TABLE tname ADD COLUMN newCol

307 views • 6 slides
Design Contest Kick-off Department of Mechanical Engineering The University of Arkansas Design

Design Contest Kick-off Department of Mechanical Engineering The University of Arkansas Design

Solar Design Contest Solarize UARK Campus Design Contest Kick-off Department of Mechanical Engineering The University of Arkansas Design Contest Kick-off Agenda Agenda Introduction Participation Rules and Instructions

650 views • 23 slides
Announcements CS 188: Artificial Intelligence On-going: contest (optional and FUN!) Spring

Announcements CS 188: Artificial Intelligence On-going: contest (optional and FUN!) Spring

Announcements CS 188: Artificial Intelligence On-going: contest (optional and FUN!) Spring 2010 Remaining lectures: Today: Machine Learning: Nearest Neighbors, Kernels Lecture 22: Nearest Neighbors, Kernels Wednesday: Machine

108 views • 6 slides
Announcements Project 2 Mini-Contest (Optional) Ends Sunday 9/30 Homework 5 Released,

Announcements Project 2 Mini-Contest (Optional) Ends Sunday 9/30 Homework 5 Released,

Announcements Project 2 Mini-Contest (Optional) Ends Sunday 9/30 Homework 5 Released, due Monday 10/1 at 11:59pm. Project 3: RL Released, due Friday 10/5 at 4:00pm. CS 188: Artificial Intelligence Reinforcement Learning II

615 views • 42 slides
So the last will be the first Ruud H. Koning Manon Grevinga april 2018 1 / 32 Rules Theory: a

So the last will be the first Ruud H. Koning Manon Grevinga april 2018 1 / 32 Rules Theory: a

Rules Theory: a contest model Data Results So the last will be the first Ruud H. Koning Manon Grevinga april 2018 1 / 32 Rules Theory: a contest model Data Results Introduction Sport fans value the uncertainty of the outcome of a

729 views • 52 slides
FFA Soils Presentation Summer 2015 Ag Contest - Slope Ag Contest - Landform Ag Contest

FFA Soils Presentation Summer 2015 Ag Contest - Slope Ag Contest - Landform Ag Contest

FFA Soils Presentation Summer 2015 Ag Contest - Slope Ag Contest - Landform Ag Contest Texture, Surface Soil Texture Relative proportion of sand, silt and clay in a soil sample Does not include organic matter Soil Separates

1.84k views • 74 slides
Team Bruddwood Adam Brehm, Thomas Cudd, and Scott Hagewood Contest Rules The goal of this game

Team Bruddwood Adam Brehm, Thomas Cudd, and Scott Hagewood Contest Rules The goal of this game

Request for Proposal Project #1 Team Bruddwood Adam Brehm, Thomas Cudd, and Scott Hagewood Contest Rules The goal of this game is for a robot to make its way through an arena, locate the opponents flag, and bring it back to its base. The

402 views • 3 slides
YOUNG ELEPHANT CONTEST THE YOUNG ELEPHANT CONTEST The 1st contest devoted to the Young Event

YOUNG ELEPHANT CONTEST THE YOUNG ELEPHANT CONTEST The 1st contest devoted to the Young Event

Presents YOUNG ELEPHANT CONTEST THE YOUNG ELEPHANT CONTEST The 1st contest devoted to the Young Event professionals (&lt; 28 y.old) will take place during the EuBEA Festival, the International Festival of Events and Live Communication, Seville

185 views • 3 slides
FFA Soils Presentation Summer 2015 Urban Contest - Slope Urban Contest - Landform Urban Contest

FFA Soils Presentation Summer 2015 Urban Contest - Slope Urban Contest - Landform Urban Contest

FFA Soils Presentation Summer 2015 Urban Contest - Slope Urban Contest - Landform Urban Contest Flood Hazard/Soil Stability Slippage/Subsidence The vast majority of soil conditions in Ohio are typically stable. However, some areas of the

936 views • 71 slides
WERC Environmental Design Contest Planning and What to Expect 1 The Contest what it is and

WERC Environmental Design Contest Planning and What to Expect 1 The Contest what it is and

WERC Environmental Design Contest Planning and What to Expect 1 The Contest what it is and what it isnt This is an environmental engineering contest, NOT a science fair project The Design Contest focus is to mimic the engineering

332 views • 17 slides
61A Lecture 31 Recursive art contest entries will be due Monday 12/2 @ 11:59pm (After

61A Lecture 31 Recursive art contest entries will be due Monday 12/2 @ 11:59pm (After

Announcements Project 4 due Thursday 11/21 @ 11:59pm. Extra reader office hours in 405 Soda this week. ! Wednesday: 5:30pm-7pm ! Thursday: 5:30pm-7pm Homework 10 due Tuesday 11/26 @ 11:59pm. 61A Lecture 31 Recursive art contest

150 views • 4 slides
CONTEST 2020 RULES Entry Fee : $5.00 per individual. Make check payable to University of

CONTEST 2020 RULES Entry Fee : $5.00 per individual. Make check payable to University of

ILLINOIS 4-H INDIVIDUAL &amp; TEAM PRESENTATION CONTEST 2020 RULES Entry Fee : $5.00 per individual. Make check payable to University of Illinois. Entry Due to County Extension Office and also Debra Hagstrom at hagstrom@illinois.edu on: March 20

478 views • 4 slides
4-H Table Setting Official Contest Guide Description of Contest Through participation in this

4-H Table Setting Official Contest Guide Description of Contest Through participation in this

4-H Table Setting Official Contest Guide Description of Contest Through participation in this contest, youth will learn valuable life skills in the areas of meal preparation either formal or informal meal etiquette, menu preparation, use

339 views • 3 slides
Announcements Recursion Recursive Functions Definition : A function is called recursive if the

Announcements Recursion Recursive Functions Definition : A function is called recursive if the

Announcements Recursion Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly Implication : Executing the body of a recursive function may require applying that

398 views • 3 slides
the Subsequent Right to Contest Coverage Insurer and Policyholder Perspectives on the Loss or

the Subsequent Right to Contest Coverage Insurer and Policyholder Perspectives on the Loss or

Presenting a live 90-minute webinar with interactive Q&amp;A Insurer's Breach of Duty to Defend: Navigating Divergent Court Rules on the Subsequent Right to Contest Coverage Insurer and Policyholder Perspectives on the Loss or Preservation of

687 views • 53 slides

More recommend