cps6-111101Handout

cps6-111101Handout - items return (key,value) pairs...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CompSci 6 Introduction to Computer Science November 1, 2011 Prof. Rodger Announcements • No Reading for next time, no RQ • Apt-04 out, due Thursday • Today – Writing Dictionaries/maps – Solving one apt EmailsCourse Dictionaries/Maps • Dictionaries/maps are another way of organizing data • Keys and Values – Each key maps to a value – Some keys can map to the same value – Can change the value a key maps to Example • Each student could be mapped to their favorite ice cream flavor
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Implementing a Dictionary/Map Keys map to values • Create Empty dictionary somemap = {} • Put in a key and its value somemap[“Forbes”] = “Strawberry” • Get a value for a dictionary value = somemap[“Forbes”] OR value = somemap.get(“Forbes”, “default”) • Change a value for a dictionary somemap[“Forbes’] = “Chocolate” More on using a Dictionary/Map • Get all the keys – listKeys = somemap.keys() • Get all the values – listValues = somemap.values() • Other methods – clear – empty dictionary
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: items return (key,value) pairs Iteritems return (key,value) pairs more efficiently update update with another dictionary Change Astrachans value somemap[Astrachan] = Coffee Mocha Value could be a set or list Back to Popular Name Problem: Given a list of names, determine the most popular first name and print that name with all of its last names. Input: Names are always two words, names are in a file. If multiple names are on the same line they are separated by a : Output: Most popular first name, followed by a :, followed by corresponding last names separated by a blank Now use a dictionary/map We will write three maps for practice First name to count of corresponding last names First name to list of corresponding last names First name to set of corresponding last names Which map is most useful to solve this problem? Compare Using two parallel lists? Using one dictionary/map...
View Full Document

Page1 / 3

cps6-111101Handout - items return (key,value) pairs...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online