problem 1:
What do you understand by the term Linear Probing? prepare down a C++ program which gives the data members and constructors for hash table class which uses linear probing.
problem 2:
prepare down the C++ program which gives the technique search of the hash table.
problem 3:
Illustrate a class called binarySearchTree to represent the Binary search tree. Extend this class by adding the public technique outputInRange (Low, High) that outputs, in ascending order of key, all components in the binary search tree whose key lies between Low and High. Use recursion and avoid entering sub trees which can’t possibly hold any elements with keys in desired range.
problem 4:
Illustrate briefly about KMP algorithm with an illustration.
problem 5:
Illustrate out the merits and demerits of Tries.