-
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.
-
Read Heterogenous Linklist
While creating a heterogenous linklist we know that we use void pointer. But when we need to read the information, How will you do it? How will you figure out to what datatype does the data belong to?
Sereche
- Jul 9th, 2012
Some kind of information regarding the type is obviously required. If there is no way of determining it from the context (i.e., the previous node in the list somehow specifies the type), it must be st...
-
Fuzzy logic system rely on
1. Crisp binary choices
2. Ambiguous data
3. Decision makers
4. All of themSandhya.Kishan
- Jun 13th, 2012
Fuzzy logic system relays on all Crisp binary data, ambiguous data and on decision makers.
-
Digital Signature Software - Installed or SaaS
Which version of Digital Signature Software - Installed or SaaS is more secured and legally binding?
-
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.
-
Data Structure for one million named objects
If you have one million named objects and you want to store them in a data structure that lets you insert new objects quickly and search for an object by name quickly, what data structure should you use?
Read Best Answer
Editorial / Best Answer
hrshksh- Member Since May-2010 | May 9th, 2010
It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for avoiding collisions. It will take O(1).
In most cases however this is not possible. In circumtances like this, there are two ways:B Trees or Extensible Hashing both of them have interesting time complexities.ptmich
- May 28th, 2012
You can use a hash table or an array of objects You can use an array of objects because you already know that you need to store a specified number of objects, also you can store and access objects qu...
hrshksh
- May 9th, 2010
It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for av...
-
Stack using two queues
write a code how to implement stack using two queues?
and vice versa ?ptmich
- May 28th, 2012
"c 1.queue_t q0; 2.queue_t q1; 3. 4.void stack_push(void *t) { 5. // At any given time one queue will be empty 6. queue_t *curr = (q0.isEmpty() ? q1 : q0); 7. 8. curr.push(t);...
ilushka
- Nov 4th, 2011
something like this:"c queue_t q0; queue_t q1; void stack_push(void *t) { // At any given time one queue will be empty queue_t *curr = (q0.size() ? q0 : q1); curr.push(t); ...
-
Conceptually, a linked list queue is the same as a queue built using an array.
Skill/Topic: Queues Using Linked ListsA) TrueB) FalseExplanation: Conceptually, a linked list queue is the same as a queue built using an array. Both store data. Both place data at the front of the queue and remove data from the front of the queue
ptmich
- May 28th, 2012
A FIFO (first in, first out) structure means data is added to the back of the queue and removed from the front of the queue. A first in first out structure is equivalent to last in last out structure,...
Sandhya.Kishan
- May 15th, 2012
A queue built using array is same as a linked list queue because both insert the data in the front and delete the data from front of the queue,i.e,both follow fifo data structure.
-
Why is it important to enhance the functionality of the LinkedList class?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) You enhance the functionality of LinkedList class to more easily manipulate a linked list
Sandhya.Kishan
- May 19th, 2012
To increase the efficiency of the linkedliss class and to allow easy manipulations on the linked list we should enhance the functionality of the class.
-
The removeNodeAt() function removes a node by using the node’s index?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) FalseExplanation: The removeNodeAt() function removes a node by using the node’s index rather than the reference to the node in memory
Sandhya.Kishan
- May 19th, 2012
True, the removenodeat() function removes a node by using the nodes index and not by the the reference to the node in memory.
-
Hashing results in a hash number that has great significance.
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
- May 19th, 2012
The hash number resulted from hashing is used as the key for an entry.
-
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.
-
The LinkedList class is defined in the _______ package.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) java.util
-
The appendNode() function appends the new node to the list along with the programmer specifing where to place the new node in the linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) FalseExplanation: The appendNode() function appends the new node to the list without requiring the programmer to specify where to place the new node in the linked list.
Sandhya.Kishan
- May 15th, 2012
No,the appendNode() function do append the new node at the programmers specified place instead it appends the new node at the tail of the linked list instead of head.If the likt is empty then it uses reference pointer to change the head pointer.
-
Why is the destructor of the StackLinkedList class empty?
Skill/Topic: Stacks using Linked ListA) The destructor of the StackLinkedList class is empty because the destructor of the LinkedList class is called prior to the destructor of the StackLinkedList class. This is because the LinkedList class is inherited by the StackLinkedList class.
Sandhya.Kishan
- May 15th, 2012
The destructor of the LinkedList class is called before the destructor of the StackLinkedList class. The LinkedList class constructor deletes all memory that is associated with the nodes of the linked list. Therefore, the destructor of the StackLinkedList class is empty.
-
Why is the constructor of the StackLinkedList class empty?
Skill/Topic: Stacks using Linked ListA) The constructor of the StackLinkedList class is empty because the constructor of the LinkedList class is called when an instance of the StackLinkedList class is declared. The constructor of the LinkedList class initializes the node and attributes that are
Sandhya.Kishan
- May 15th, 2012
The constructor is empty because the constructor of the LinkedList class is called before the constructor of the StackLinkedList class,we know that the StackLinkedList class inherits the LinkedList cl...
-
Why does QueueLinkedList class inherit the LinkedList class?
Skill/Topic: Queues Using Linked ListsA) The QueueLinkedList class inherits the LinkedList class because the LinkedList class contains data members and function members that are necessary to manage the linked list that is used for the queue.
Sandhya.Kishan
- May 14th, 2012
True,as the linkedlist class contains the functions and data members which are used to manage the linked list which is used for the queues,hence queuelinkedlist class inherit the linkedlist class.
-
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.
-
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.
-
_______ form of access is used to add and remove nodes from a queue.
Skill/Topic: Queues Using Linked ListsA) FIFO , First In First Out
Sandhya.Kishan
- May 10th, 2012
Queues are first in first out form of data structures.In a FIFO data structure, the first element added to the queue will be the first one to be removed.
Data Structures Interview Questions
Read Best Answer
Ans