-
Consider a linked list implemented of a queue with two pointers: front and rear. What is the time needed to insert an element if the queue is of length n?
ankitschopra
- Nov 3rd, 2013
In Queue Insertion can only take place in the end. Since we have pointer to front and rear, We only require one step to insert at the rear.
Shahnawaz
- Sep 2nd, 2013
O(1). Insert element at rear.
-
-
Linear and Non-Linear Data Structures
Explain what are linear data structure & non-linear data structure?
-
-
-
The hashString() member function is called by other member functions of the Hashtable class whenever a function needs to convert a ________________.
Skill/Topic: Hash TableA) a hash number key to a keyB) key to a hash number keyC) a key to an IndexExplanation: 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...
rasheed
- Feb 14th, 2013
C) a key to an Index
Sandhya.Kishan
- May 21st, 2012
The hashString() member function is called by other member functions of the Hashtable class whenever a function needs to convert a key to hash number key.
-
GetInstance()...
Please, can anybody answer me that when to use getInstance() and which class having getInstance(),I could not find that method in class Class also.
-
Can a linked list store data other than integers?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) YesB) NoExplanation: Integers are usually used, but you can modify the data type of the data in the definition of the node to change the kind of data stored in the linked list.
-
What happens if an invalid index value is passed to a function?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) If an invalid index is passed, the function terminates without further processing. [Explanation] Functions that use an index value always determine if the index passed to them is valid before using the index value . If an invalid index is received, the
Sandhya.Kishan
- Jul 25th, 2012
If the user passes in an invalid index, the program will cause an assertion error. While this is useful to indicate to the user that something went wrong, so they can deal with it as appropriate.
Iterative Algorithm
Design an iterative algorithm to traverse a binary tree represented in two dimensional matrix
Sandhya.Kishan
- Jul 16th, 2012
A binary tree can be traversed using only one dimensional array. InOrder_TreeTraversal() { prev = null; current = root; next = null; while( current != null ) { if(prev == current.parent) { prev = cu...
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.
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.
Read Best Answer
Ans