-
__________ file contains the actual stack application.
Skill/Topic: Stacks using Linked ListA) StackLinkedListDemo.cpp
-
How is the front of the queue calculated ?
Skill/Topic: QueueA) The front of the queue is calculated by front = (front+1) % size
-
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. -
Code switching and code mixing
What is the difference between code switching and code mixing?
Sandhya.Kishan
- Apr 27th, 2012
Concurrent use of more than one language in the same sentence of a conversation is known as code switching as
Code mixing refers to mixing of two or more languages in a speech.It occur within a multilingual setting where speakers share more than one language.
-
What is the difference between MLOAD and TPUMP ?
Sandhya.Kishan
- Apr 17th, 2012
1.TPump allows us to load data into tables with referential integrity which MultiLoad doesn't allow. 2.TPpump does not support MULTI-SET tables,but multiple tables can be loaded in the same MultiLoad...
-
How to Retrieve the Hidden Field Value
How to retrieve the value of hidden filed in one page from another
Sandhya.Kishan
- Apr 11th, 2012
In .aspx, you can access the hidden fields when the page is submitted by using -
string customerId = Request.Form["txtCustomerId"];
-
Linked list in java
How to implement reverse linked List using recursion?
Sandhya.Kishan
- Apr 11th, 2012
The program is
List* recur_rlist(List* head)
{
List* result;
if(!(head && head->next))
return head;
result = recur_rlist(head->next);
head->next->next = head;
head->next = NULL;
return result;
}
void printList(List* head)
{
while(head != NULL) {
std::cout -
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.
-
How is a key hashed?
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
- 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.
-
The insertNodeAt() function places a new node at a specific location in the linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False
Sandhya.Kishan
- Mar 26th, 2012
True , the insertNodeAt() function can place a node at the front or back of a linked list if you pass the appropriate index to this function.
-
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.
-
DeleteNode() function requires the _____ of the data element of the node that is being removed.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) referenceB) valueC) declarationD) variable
Sandhya.Kishan
- Mar 26th, 2012
DeleteNode() function requires the value of data element of the node that is being removed.
-
In an array queue, data is stored in an _____ element.
Skill/Topic: Queues Using Linked ListsA) NodeB) linked listC) arrayD) constructorExplanation: In an array queue, data is stored in an array element. In a linked list queue, data is stored in a node of a linked list
-
What is the formula used to calculate the back of the queue?
Skill/Topic: QueueA) The back of the queue is calculated by using the following formula:back = (back+1) % size
Sandhya.Kishan
- Mar 26th, 2012
Back = (back+1) % size is the formula to calculate the back of the queue.
-
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 . . .
-
Double Link List
Is double link list a linear data structure? If Yes, Why?If No, Why?
snyder
- Mar 13th, 2012
If every element in a DS has almost two adjacent neighbors then it is called a linear DS. . . Hence doubly linked list is a linear DS
snyder
- Mar 7th, 2012
To check if a DS is linear or not just do a simple test . . . check if the data elements of the given DS can be accessed in a sequential manner, if it can, then its a linear DS.
A doubly linked list can be accessed in a sequential manner, hence it is a linear linked list. -
Data Structure
Data structures provide many positive aspects like minimum disk-space efficiency, proper data management but at cost of complexity. What is your opinion?
snyder
- Mar 10th, 2012
Although you have to deal with the complexity but you curb many problems that the users may experience. For eg. imagine how much data is stored in the servers of facebook. . .its massive . . .and ye...
Rajan Patekar
- Aug 12th, 2011
Complexity is at the user side in understanding not for the compiler.
data structure is a way of organising and using the memory effectively and efficiently. -
Where data abstraction used ?
can you please explain the oops concepts with example program? like in which place data abstraction is used?
snyder
- Mar 7th, 2012
Abstraction is a concept in which the complexity of the system is hidden from the user and the user interacts with the system via interfaces. the simplest example of this concept is ur computer or l...
-
Define datastructure?
yogitag
- Mar 5th, 2012
Data Structure is the way of organizing data as per the requirement and defining few operations that can be operated on it
snyder
- Feb 27th, 2012
Data Structure is way of organizing data in memory so as to use it in an efficient manner and is best suited for the algorithm to be implemented.
-
Bit Transformation
The process of transforming 1 bit pattern into another is called ______________
snyder
- Feb 29th, 2012
It is called conditioning. This question is actually related to electronics and you can find it in "Telecommunication Networks".
Data Structures Interview Questions
Ans