Skip to main content

ADSL Assignment 5

Assignment No: 5

Implement all the functions of a dictionary (ADT) using hashing.
Data: Set of (key, value) pairs, Keys are mapped to values, Keys must be comparable, Keys must be unique
Standard Operations: Insert (key, value), Find (key), Delete (key)

 https://drive.google.com/open?id=1-LhAduxW8orbQkUrBZrqeY8f1m7IU7Kv

Comments

Post a Comment

Popular posts from this blog

ADSL Assignment 2

Assignment 2: Beginning with an empty binary search tree, Construct binary search tree by inserting the values in the order given. After constructing a binary tree - i. Insert new node ii. Find number of nodes in longest path iii. Minimum data value found in the tree iv. Change a tree so that the roles of the left and right pointers are swapped at every node v. Search a value https://drive.google.com/open?id=1aQlBrpYlQAJVVgPIujXfjCCmconcY_L0
Post a Comment
Read more