Class 39 — Monday November 23

I know that you know that

Programming basics — You achieved this semester — Bask in the success


Look both ways


Agenda


Final


Thanks to the TAs for making the course successful

Katherine Brickley Ann Hoang Rachel McNamara MaryJeanine Seaman
Ryan Green Hallie Khoung Jimmy Njuguna Jacob St. Martin
Nadia Hassan Kevin Luk


Want to be a TA for CS 1112


Test problem solving process

  • Initialize accumulator
  • total = 0 for summation
  • product = 1 for product
  • values = [] for list
  • mappings = {} for dictionary
  • Loop to update accumulator

for value in sequence :

  ...

n = len( sequence )

for i in range( 0, n ) :

  value = sequence[ i ]

  ...

  sequence[ i ] = ...

for x in range( 0, width ) :

  for y in range( 0, height ) :

  spot = (x, y )

  ...

for row in dataset :

  for value in row :

  ...

result = True

for v in values :

  if v does not have the property

  result = False

  break

result = False

for v in values :

  if v has the property

  result = True

  break

result = values[ 0 ]

for v in values :

  if v is better than the result

  result = v


Other patterns




Realizations



nbr = int( v )

nbrs = []

for v in s :

  nbr = int( v )

  nbrs.append( nbr )



Truisms

  • random.seed()
  • random.randrange()
  • random.choice()

Final thought

what about bob? 39 steps wikimedia


 


  © 2020 Jim Cohoon   Resources from previous semesters are available.