-
Why are data members of the Hashtable class stored in the private access specifier?
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
- 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.
-
Hashing is performed at Bit level.
Skill/Topic: Hash TableA) TrueB) False
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.
-
The C++ version of the hashtable application is simpler than the Java version.
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
- 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.
-
The java.util package contains two classes that are designed to work with hashtables. They are _______ and _________.
Skill/Topic: Hash TableA) Hashtable , HashMap class
Sandhya.Kishan
- May 8th, 2012
Hashmap and hashtable are the classes which the Java.Util package contains to work with hashtables.
-
An application iterates the hashtable by calling the ______ and ______ member functions.
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
-
The hasNext() function determines if there is another entry in the hashtable based on the current state of the iterator.
Skill/Topic: Hash TableA) TrueB) False
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.
-
GetSize() function is used to protect the integrity of the Data.
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
- 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.
-
The constructor of the Hashtable class initializes data members and creates the hashtable.
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
- 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.
-
What is the use of fflush() function?
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...
-
Structure and union
What is the difference between structure and union?
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
-
Why resultset being an interface can call next()
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.
-
Polymorphic Data Type
What is Polymorphic Data Type? Give example
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 ...
-
Recursive Algorithm
Explain how recursive algorithm is converted into recurrence relation with example.
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
-
Performance of Algorithm
Explain how performance of algorithm is analysed?
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...
-
Binary Tree Node Data Structure
Explain What is a node data structure Write a function such that the node data structure to visit all of the nodes in a binary tree?
ravi6771
- Aug 12th, 2009
Struct node{int datastruct node *next;}*root;int count=0;void count(struct node *nd){if(nd!=NULL){count(nd->left);count++;count(nd->right);}}call count(root) which give the count in count variable.
-
Memory Reservation
How is memory reserved using a declaration statement?
clickankit4u
- May 31st, 2009
When you delare any variable it is assigned in the data segment.Data Segment (data+bss+heap)stackand this is so memory is reserved.
-
Forest Data Structure
What is forest data structure? How is it useful?
snyder
- Mar 13th, 2012
A forest is an undirected graph which is composed of connected components in which each and every component can be represented as a tree. . . however i don't know its use exclusively . . .
-
Linked List
Write a program of Linked List using pointers.
sid0812
- Nov 11th, 2010
import java.io.*;class node { public int info; node next; }class link { node head; public void initialize() { n...
-
Deleting Data Elements
Which data structure allows deleting data elements from front and inserting at rear?a. Stacksb. Queuesc. Dequesd. Binary search tree
gangabyndoor
- Mar 21st, 2010
It is Queues only. In Queues Insertion take place from rear end and deletion take place from front end.
-
What is pre-emptive data structure ?
Sandhya.Kishan
- Apr 27th, 2012
There are primitive data types but not primitive data structures.
Primitive data types are predefined types of data, which are supported by the programming language. For example, integer, character, and string are all primitive data types.
Data Structures Interview Questions
Ans