-
Which node is removed from the queue when the dequeue() member method is called?
Skill/Topic: Queues Using Linked ListsA) The node at the front of the queue is removed when the dequeue() member method is called.
Sandhya.Kishan
- May 10th, 2012
The dequeue() function is used to remove the node at the front and returns a value, this value is stored in an item.
-
The isEmpty () member function must determine if the stack is empty.
Skill/Topic: Stacks using Linked ListA) TrueB) FalseExplanation: The pop () member function must determine if the stack is empty
Sandhya.Kishan
- May 10th, 2012
False.
The pop() function determine whether the stack is empty or not by calling the isEmpty() member function.. -
A ______ is a component of a node that identifies the node.
Skill/Topic: TreeA) ValueB) TreeC) KeyD) IndexExplanation: A key is a component of a node that identifies the node. An application searches keys to locate a desired node
Sandhya.Kishan
- May 8th, 2012
The data model provides unique keys as a component of the node which identifies the node.
-
A value is also a component of a node that is used to store data.
Skill/Topic: TreeA) TrueB) False
Sandhya.Kishan
- May 8th, 2012
True, a value is also a component of a node which is used to store data.
-
A key entered by an application be directly compared to a key in a hashtable.
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
- May 8th, 2012
False.
The key entered must be hashed before an application compares it with the hash key table. -
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.
-
The _______ function retrieves the value of the size member of the LinkedList class.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) getSize()B) giveSize()C) seeSize()D) addSize()Explanation: The getSize() function retrieves the value of the size member of the LinkedList class. The getSize() function contains one statement that simply returns the value of the size member
Sandhya.Kishan
- May 8th, 2012
The getsize() function retrieves the value of the size member of the linked list class.
-
C program to print the information from each node in reverse order.
Write a C program to print the information from each node in reverse order in doubly linked list, in which pointer to last node is TAIL.
-
The insertNodeAt() function specifies the index of where to insert the new node into the linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False
Sandhya.Kishan
- Apr 27th, 2012
True,the insertnodeat() function specifies the index of where to insert the new node into the linked list.
-
What is the return value of the findNode() function?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) The return value of the findNode() function is the index position of the node.
Sandhya.Kishan
- Apr 27th, 2012
The index position of the node is returned by the findnode() function.
-
__________ 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.
-
Efficient Algorithm to print count and possible string combinations of a string by retaining order and length of charactersined
Problem: Given a input string as "0000" and following input scheme for the zeroes, print the possible combinations by retaining order of the characters.
Input Scheme:
A "0"
B "00"
C "000"
D "0000"
Example: "AAAA" is one string with length and order of characters retained -
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.
Data Structures Interview Questions
Ans