Skill/Topic: Hash TableA) TrueB) FalseExplanation: The hashed key retrieves entries

noverino

 Profile Answers by noverino Questions by noverino

• Feb 23rd, 2007

B) FalseHashtable not always need value, it could contain only key/keys. Example, we use hashtable to keep unique value, then we only need the key/keys right.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: Hashing results in a hash number that has no real significance beyond it being used as the key for an entry.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 19th, 2012

The hash number resulted from hashing is used as the key for an entry.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) 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

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Mar 26th, 2012

A hash variable can be created the same way as an array variable.The simplest method is to create an empty hash object and fill it with key/value pairs. Arrays use numeric indexes, from 0 to array.length - 1, hashes use meaningful indexes, normally strings or symbols.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: No. A key entered by the application must be hashed before it can be compared to a key in the hashtable.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

False.
The key entered must be hashed before an application compares it with the hash key table.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) Bit Shifting

shiney roshia

• Nov 28th, 2006

Ans:modulo division method In this the key to be stored is divided by a no 'n' and the result is the index in which it is to be stored

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) private access specifierB) Public access specifierC) common access specifier

swati patil

• May 21st, 2007

private access specifier

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) 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.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 29th, 2012

The data members of the hashtable class stored in the priVATe access specifier as members can be used by the class itself or by friends.It ensure data integrity.If the members are declared as private then only mamber functions can assign and retrive values.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) False

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Mar 26th, 2012

True, hashing is performed at bit level by using a hash function. A hash function is any function that can convert data to either a number or an alphanumeric code.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: 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

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 14th, 2012

The hash table applications of java are simpler then c++ because java defines a class in java collection class called HASHTABLE class which is present in the java.util package.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) Hashtable , HashMap class

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

Hashmap and hashtable are the classes which the Java.Util package contains to work with hashtables.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) hasNext() and getNextKey()Explanation: 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

swati patil

• May 21st, 2007

HasNext(0 and next()

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) False

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Mar 26th, 2012

True,the hasnext() function determines if there is another entry in the hashtable based on the current state of the iterator.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: 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 to size to...

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 14th, 2012

True,GetSize() function is used to protect the integrity of the Data by controlling the access to the size parameter, such that only the function members of the hashtable can access the size parameter.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: 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

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 19th, 2012

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

Answer Question  Select Best Answer

mswaroop

 Profile Answers by mswaroop Questions by mswaroop

• Sep 5th, 2007

Suppose we read a sentence using scanf e.g. "My name is ABC" in a string.Printing this string using a printf statement prints "My".Go for another successive scanf.It...

Answer Question  Select Best Answer

What is the difference between structure and union?

bhushanpatil31

 Profile Answers by bhushanpatil31 Questions by bhushanpatil31

• Apr 6th, 2014

Memory is allocated cumulatively for all members of structure while in case of union, memory for largest element only is allocated

Answer Question  Select Best Answer

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Jul 16th, 2012

A class which implements an interface implements its methods.When we obtain a reference to a ResultSet then we are getting an instance of a class that implements the ResultSet interface.Hence class provides concrete implementations of all of the ResultSet methods.

Answer Question  Select Best Answer

What is Polymorphic Data Type? Give example

gurjot911

 Profile Answers by gurjot911 Questions by gurjot911

• Mar 5th, 2009

Polymorphic data type is implemented using generic pointers that stores a byte address and not the type of data stored in that memory address. so a polymorphic data type can take on any type of value ...

Answer Question  Select Best Answer

Explain how recursive algorithm is converted into recurrence relation with example.

riteshja88

 Profile Answers by riteshja88 Questions by riteshja88

• Feb 27th, 2009

Say we want to represent the following recursionint recurse(int a){ ? ? ? return a+recurse(a-1);}x={x|x=a(a+1)/2} for all a

Answer Question  Select Best Answer

Explain how performance of algorithm is analysed?

samik mukherjee

 Profile Answers by samik mukherjee Questions by samik mukherjee

• Jul 1st, 2008

The performance of an algorithm is analysed by the time complexity as well as its space complexity though both the complexities are trafe-offs between them. If time complexity increases then space com...

Answer Question  Select Best Answer