Agenda Announcements Structure APT Membership and for loops - - PowerPoint PPT Presentation

agenda
SMART_READER_LITE
LIVE PREVIEW

Agenda Announcements Structure APT Membership and for loops - - PowerPoint PPT Presentation

Agenda Announcements Structure APT Membership and for loops 1/14/2013 CompSci101 Peter Lorensen 1 Variable Type High level Value Modules Functions( ) Functions( ) Datastructures code Variables (String) Datastructures List


slide-1
SLIDE 1

Agenda

  • Announcements
  • Structure
  • APT Membership and for loops

1/14/2013 CompSci101 Peter Lorensen 1

slide-2
SLIDE 2

High level Modules Functions( ) code

1/14/2013 CompSci101 Peter Lorensen 2

Functions( ) Variables Datastructures Control structures Variable Type Value Datastructures (String) List Set Tuple Dictionary Control structures If For loop While loop (Exceptions)

slide-3
SLIDE 3

Objects – a teaser

1/14/2013 CompSci101 Peter Lorensen 3

def load_lines(filename): lines = [] f = open(filename) for line in f.readlines(): line = line.strip() lines.append(line) return lines

file.read([size]) Read at most size bytes from the file (less if… file.readlines([sizehint]) Read until EOF using readline() and return a list… file.seek(offset[, whence]) Set the file’s current position, like stdio‘s fseek()… file.write(str) Write a string to the file. There is no return… ......... ........

File Object

slide-4
SLIDE 4

1/14/2013 CompSci101 Peter Lorensen 4

APT MemberShip

slide-5
SLIDE 5

APT MemberShip

1/14/2013 CompSci101 Peter Lorensen 5

def whosDishonest(club1, club2, club3): guilty = set() # Empty set to be returned """ Making a list of clubs converted to sets""" allClubs = [ set(club1), set(club2), set(club3)] for redIndx in range( len( allClubs) ): for greenIndx in range(redIndx, len( allClubs)): common = allClubs[redIndx] & allClubs[greenIndx] guilty = guilty.union( common ) for redIndx in range( len( allClubs) ): for greenIndx in range(redIndx+1, len( allClubs)): common = allClubs[redIndx] & allClubs[greenIndx] guilty = guilty.union( common ) for redIndx in range( len( allClubs) ): for greenIndx in range(redIndx, len( allClubs)-1): common = allClubs[redIndx] & allClubs[greenIndx] guilty = guilty.union( common ) return list( guilty ).sort()# Converting to list and sorting

A B C

slide-6
SLIDE 6

Shafi Goldwasser

  • RCS professor of computer science at

MIT – Twice Godel Prize winner – Grace Murray Hopper Award – National Academy – Co-inventor of zero-knowledge proof protocols How do you convince someone that you know [a secret] without revealing the knowledge?

  • Honesty and Privacy

1/14/2013 CompSci101 Peter Lorensen 6

Work on what you like, what feels right, I now of no

  • ther way to end up

doing creative

slide-7
SLIDE 7

Turing Award

  • Given by the Association

for Computing Machinery (ACM)

1/14/2013 CompSci101 Peter Lorensen 7

  • Given to "an individual selected for contributions of a

technical nature made to the computing community".

  • "The contributions should be of lasting and major

technical importance to the computer field“.

  • The Turing Award is recognized as the "highest

distinction in Computer science“ and "Nobel Prize of computing".

slide-8
SLIDE 8

Silvio Micali

  • Professor of computer science at MIT

– Godel Prize winner – Fellow of the IACR – Co-inventor of zero-knowledge proof protocols How do you convince someone that you know [a secret] without revealing the knowledge?

1/14/2013 CompSci101 Peter Lorensen 8