What is Hashing in Data structures and why is it used. What the criteria for Hashing and explain some of them.
Explanation of OOP principles-Data Abstraction.-Data Encapsulation-Inheritance-Polymorphism-Dynamic Binding.-Reduction of Errors.
Latest Answer : One function of a friend is to help you move your stuff across town. Another is to pick you up when your car breaks down. ...
4.Is the following code an Example of Dynamic Binding Explain? class Base{Public:virtual Bool Dosomething()------------------};class Derived1: public Base{Public:Bool Dosomething();---------------------------------};class Derived2: public Base{Public:Bool Dosomething();---------------------------------};void main(){Derived1 derived1;Derived2 derived2;::process(derived1);::process(derived2);}::Process(Base& Object){Object.Dosomething();}What will happen if in the above code in the base class
Answered by Vikas Saxena on 2005-05-12 06:22:10: Hashing is a method to store data in an array so that storing, searching, inserting and deleting data is fast .For this every record needs an unique key.
Latest Answer : Hashing is a method to store data in an array so that storing, searching, inserting and deleting data is fast .For this every record needs an unique key. The basic idea is not to search for the correct position of a record with comparisons but to ...
