Algorithms and OOD (CSC 207 2014F) : Outlines
Primary: [Front Door] [Schedule] - [Academic Honesty] [Disabilities] [Email] - [Learning Outcomes] [FAQ] [Teaching & Learning] [Grading] [Rubric] - [Calendar]
Current: [Assignment] [EBoard] [Lab] [Outline] [Reading]
Sections: [Assignments] [EBoards] [Examples] [Handouts] [Labs] [Outlines] [Readings]
Reference: [Student-Curated Resources] [Java 8 API] [Java 8 Tutorials] [Code Conventions]
Related Courses: [CSC 152 2006S (Rebelsky)] [CSC 207 2014S (Rebelsky)] [CSC 207 2014F (Walker)] [CSC 207 2011S (Weinman)]
Misc: [Submit Questions] - [SamR] [Glimmer Labs] [CS@Grinnell] [Grinnell] - [Issue Tracker (Course)] [Issue Tracker (Textbook)]
Held: Wednesday, 12 November 2014
Back to Outline 39 - Priority Queues and their Basic Implementation. On to Outline 41 - Implementing Dictionaries.
Summary
We consider an important ADT, the Dictionary (also called Map, Table, Hash, and Associative Array). Dictionaries are collections of values that can be indexed by some kind of value (not necessarily integers between 0 and size-1).
Related Pages
Overview
Administrivia
Not discussed, but left over from a previous semester for historical reasons.
Dictionary<K,V>, and made it an
abstract class.Map<K,V>.put by adding to the front of the
linked list (or the back of the array).get by searching the linked list or array.set for an element already in the
array?