Class 46: Hash Tables Lab

Back to Hash Tables, Continued. On to Linked Lists (1).

This outline is also available in PDF.

Held: Monday, 22 November 2010

Summary: We continue our exploration of hash tables.

Related Pages:

EBoard.
Lab: Hash Tables..

Overview:

Unit Tests, Revisited.
malloc and free.
Code Reading.
Lab.

Unit Tests, Revisited

Unit testing code fixed.
More tests added!

Malloc and Free

How do we build a new table?
How do we build a new entry in the table?
Both tasks require us to allocate memory.
The malloc procedure allocates memory.
Good programmers clean up after themselves. When you are done with memory, you should free it with free.

Code Reading

We'll go over the basic ideas of the parts of the code for hash tables.

Lab

Do The lab.

Back to Hash Tables, Continued. On to Linked Lists (1).

[Skip to Body]
Primary: [Front Door] [Schedule] - [Academic Honesty] [Instructions]
Current: [Outline] [EBoard] - [Assignment] [Lab]
Groupings: [EBoards] [Assignments] [Examples] [Exams] [Handouts] [Labs] [Outlines] [Readings]
Related Courses: [CSC195 2003S (Rebelsky)] [CSC161 2009F (Coahran)] [CSC161 2010S (Walker)]
Misc: [SamR] [ISO] [GNU Coding Standards]

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Dec 8 10:57:12 2010.
The source to the document was last modified on Fri Aug 27 07:12:24 2010.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CSC161/2010F/Outlines/outline.46.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu