Projects

[ Home | Contents | Search | Post |  Next | Previous | Up ]

Dictionary using hash tables
Project Details

Contact: CTO
Project_Contact:
Other_Contact:
Project_Office: US
Application_type: Desktop
Work_type: Development
Further_Contractors: Required
Travel_yes_no:
No_of_contractors_required:
Project_start: Start right now
Deadline_for_completion: nov 25 2003
Estimate: tbd
esttype: man/day
My_preliminary_budget_USD: 100
Travel: Not_required
EXPERIENCE: I need substantial support and input from the developer
Non_Disclosure_Agreement: Not_required
Fees_kept_in_Escrow: Not_required
Source:
Date: 15 Nov 2003
Time: 08:23 PM

Project_Description

A Dictionary ADT supports the following operations:

insert (x) insert object x into the dictionary.

delete (x) delete object x from the dictionary.

find (x) find object x in the dictionary.

Implement the Dictionary ADT using a a hash table.

Comments