TECHNICAL QUESTIONS

The constructor of the Hashtable class initializes data members and creates the hashtable. Posted: The constructor of the Hashtable class initializes data members and creates the hashtable. The size of the array of pointers (tablesize) is passed to the constructor when the application declares an instance of the Hashtable class

Creating and using a hashtable in your application is a single-step process[Topic] Hash Table. Posted: Creating and using a hashtable in your application is a two-step process. The first step is to define a user-defined structure similar to the way you defined nodes in a tree or a linked list. The second step is to define a Hashtable class. The Hashtable class declares an instance of the user-defined structure and [...]

Creating and using a hashtable in your application is a single-step process[Topic] Hash Table. Posted: Creating and using a hashtable in your application is a two-step process. The first step is to define a user-defined structure similar to the way you defined nodes in a tree or a linked list. The second step is to define a Hashtable class. The Hashtable class declares an instance of the user-defined structure and [...]

Creating and using a hashtable in your application is a single-step process[Topic] Hash Table. Posted: Creating and using a hashtable in your application is a two-step process. The first step is to define a user-defined structure similar to the way you defined nodes in a tree or a linked list. The second step is to define a Hashtable class. The Hashtable class declares an instance of the user-defined structure [...]

GetSize() function is used to protect the integrity of the Data. Posted: The getSize() member function of the Hashtable class reads the size data member of the Hashtable class and returns its value to the statement that calls the getSize() function. If you gave the application direct access to the size data member, statements within the application could assign an incorrect value to size. By controlling access [...]

The hashString() member function is called by other member functions of the Hashtable class whenever a function needs to convert a ________________ Posted: The hashString() member function is another function called by other member functions of the Hashtable class whenever a function needs to convert a key to a hash number key. The hashString() function requires one argument, a char pointer to the key that is being hashed. The hash number that corresponds to the key is then [...]

An application iterates the hashtable by calling the ______ and ______ member functions. Posted: An application iterates the hashtable by calling the hasNext() and getNextKey() member functions. These two functions are used together with initIterator() to retrieve all the keys from a hashtable

The C++ version of the hashtable application is simpler than the Java version Posted: The Java version of the hashtable application is simpler than the C++ version because the Java version defines the Hashtable class in the Java Collection Classes that are defined in the java.util package

Why are data members of the Hashtable class stored in the private access specifier? Posted: Data members of the Hashtable class are stored in the private access specifier to ensure the integrity of the data. Only member functions can assign and retrieve values of these data members.

A key entered by an application be directly compared to a key in a hashtable. Posted: No. A key entered by the application must be hashed before it can be compared to a key in the hashtable.

How is a key hashed? Posted: A hash key is created by bit shifting a hashed value and then adding to the value bits of a character of the key entered by the application

Hashing results in a hash number that has great significance. Posted: Hashing results in a hash number that has no real significance beyond it being used as the key for an entry.

Why is it necessary to hash? Posted: ashing assures that the format of keys is uniform and unique

Why is it necessary to hash? Posted: Hashing assures that the format of keys is uniform and unique

What is hashing? Posted: Hashing is the technique of scrambling bits of a key into a hash number.

If the depth of a tree is 3 levels, then what is the Size of the Tree? Posted: ou calculate the size of a tree by using the following formula: size = 2 ^ depth If the depth is 3 levels, then the size is 8, as shown here: 8 = 2 ^ 3

leaf node does not have any child nodes. Posted: A leaf node is the last node on a branch and does not have any child nodes

What is a leaf node? Posted: A leaf node is the last node on a branch

What is the purpose of a left child node and a right child node? Posted: he left child node has a key that is less than the key of its parent node. The right child node has a key that is greater than the key of its parent node

A ______ is a component of a node that identifies the node. Posted: A key is a component of a node that identifies the node. An application searches keys to locate a desired node