Data Structure C++ - 1. Describe a mechanism to access the telephone customer records by telephone #. Assume that we have a huge data in hand, say a million records or so. Choose a data structure (or) a combination of da ...
tree structure search and update; what is big omega for depth x? - In a binary tree the search is log (x) and the update is x where x is teh depth of the tree. Is this correct? In tree like structure (tree structure) what is the maximum number of access for record up ...
Heap algorithm implementation - Please look at question number 4 on the pdf attachment on the sample final exam.
Thanks
Design a hashed file - Design a hashed file of words that could be used as a spell checker. What would you use as a hash function? Would your choice of a hash function depend on the language from which the words are chosen ...