Lecture17_dictionary

Lecture17_dictionary - Announcements 5 VoteToday! H2...

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

View Full Document Right Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 1 Announcements Announcements 5 Vote Today! H2 Due Friday 11/5 Midterm 2 Tuesday 11/09/04 7:15-9:15 pm 113 Psychology
Background image of page 1

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 2 Last Lecture Last Lecture 5 Queue ADT Array-based implementation Link node implementation
Background image of page 2
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 3 DictionaryADT DictionaryADT 5 Object add(key,value) Object remove(key) Object getValue(key) or get(key) int size() - returns number of pairs boolean contains(key) - true if key exists Iterator getKeys() - get list of all keys Iterator getValues() - get list of all values
Background image of page 3

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 4 Dictionary Iterators Dictionary Iterators 5 The i th value in the value iterator must correspond to the i th key in the key iterator. keys values
Background image of page 4
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 5 Dictionary Iterators Dictionary Iterators 5 The i th value in the value iterator must correspond to the i th key in the key iterator. keys values
Background image of page 5

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 6 Dictionary Iterators Dictionary Iterators 5 The i th value in the value iterator must correspond to the i th key in the key iterator. keys values
Background image of page 6
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 7 Dictionary Iterators Dictionary Iterators 5 The i th value in the value iterator must correspond to the i th key in the key iterator. keys values
Background image of page 7

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 8 Dictionary Iterators Dictionary Iterators 5 The i th value in the value iterator must correspond to the i th key in the key iterator. keys values
Background image of page 8
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 9 Dictionary Iterators Dictionary Iterators 5 The i th value in the value iterator must correspond to the i th key in the key iterator. keys values
Background image of page 9

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

View Full DocumentRight Arrow Icon
©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 10
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/17/2011 for the course CS 367 taught by Professor Marvinsolomon during the Spring '08 term at Wisconsin.

Page1 / 38

Lecture17_dictionary - Announcements 5 VoteToday! H2...

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

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