Skill/Topic: TreeA) TrueB) FalseExplanation: A leaf node is the last node on a branch and does not have any child nodes

zakariya

• Mar 2nd, 2006

A leaf nodes does not have any child node because leaf node is the last nodes of a tree

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) removeback()B) isEmpty()C) removedfront()Explanation: The pop() member function must determine if the stack is empty, or it will attempt to remove a node that isn’t on the stack. The pop() member function determines if the stack is empty by calling the isEmpty() member function, which you must define as part of the StackLinkedList class.

sandeep yadav

• Mar 5th, 2006

its only depend your way of implimentation.but generally top of the stack is initialized by -1 and if we insert (push) an element in the stack the top first increment itself by one and on that index t...

Answer Question  Select Best Answer

Skill/Topic: Variables and PointersA) FalseB) TrueExplanation: A pointer is a variable and can be used as an element of a structure and as an attribute of a class in some programming languages such as C++, but not Java. However, the contents of a pointer is a memory address of another location of memory, which is usually the memory address of another variable, element of a structure, or attribute of...

warisha

• Mar 18th, 2006

Yeh, we can call pointer as a variable .it is used in some languages which supports its use.the datatype of pointer is of ptr,and not of datatype of the variable to which it is pointing.

samiksc

 Profile Answers by samiksc Questions by samiksc

• Jan 19th, 2006

Yes in the languages which support use of pointers, a pointer is a variable used to hold address of a memory location.

Answer Question  Select Best Answer

Skill/Topic: ArrayA) by using the address operator, which is the ampersand (&), in an assignment statementB) by using the address operator, which is the asterisks (*), in an assignment statementC) by using the address operator, which is the Double-asterisks (**), in an assignment statementD) None of the above Explanation: You assign a memory address to an element of a pointer array by using the address...

Munish

• Apr 14th, 2006

Sayint * ptoia[10];int a=10;so we can writeptoia[0]=&a;.... and so on,.

Answer Question  Select Best Answer

Skill/Topic: Linked ListA) TrueB) False

neetu

 Profile Answers by neetu Questions by neetu

• Apr 14th, 2006

True

shanu

• Apr 10th, 2006

a doubly linked list has got the address of the previous list as well as next linked list, with data in between...

Answer Question  Select Best Answer

Skill/Topic: TreeA) The left child node has a key that is less than the key of its parent node. The right child node has a key that is greater than the key of its parent node

smitha

• Apr 15th, 2006

The left child node nd right child node hels in sorting technology bcoz parent will be having larger value than that of left and left child will be having larger value than that of right.

Answer Question  Select Best Answer

Skill/Topic: TreeA) TrueB) False

tapsi tiwari

• May 22nd, 2006

a tree cant have duplicate key, because its through key only that a node is identified.

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) queue linked listB) stacks linked listC) both of themD) neither of themExplanation: A queue linked list is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

Amish Kumar Aman

• Jun 5th, 2006

A:) be the Ans.

sri harsha

 Profile Answers by sri harsha Questions by sri harsha

• Apr 17th, 2006

Ans is A.

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) A queue linked list can expand and shrink in size when an application runs, depending on the needs of the application

Amish Kumar Aman

• Jun 5th, 2006

benifits:1:) The Most Important is CPU Scheduling ,refers a Queue for  scheduling.2:)   Queue Is to Faster then Other One(stack)

Answer Question  Select Best Answer

Skill/Topic: Variables and PointersA) The data type in this is CharExplanation: The data type of the memory address stored in the pointer is of Character type

s

• Jun 18th, 2006

The datatype is char * type that is the variable points to a location(stores the address of the location) which contains character type data

samiksc

 Profile Answers by samiksc Questions by samiksc

• Jan 19th, 2006

The data type for this declaration is 'char *' that is pointer to char data.

Answer Question  Select Best Answer

Skill/Topic: Stacks using an ArrayA) PrivateB) PublicC) Both a) and b)D) Neither a) nor b)Explanation: The keyword private means that the attribute or member method is accessible only by a member method. The instance of the class cannot directly access a private member of the class.

shyamstrikes

 Profile Answers by shyamstrikes Questions by shyamstrikes

• Jun 25th, 2006

PRIVATE

samiksc

 Profile Answers by samiksc Questions by samiksc

• Jan 19th, 2006

(A) Private

Answer Question  Select Best Answer

Traversing the link list with two pointers, both traversing at different speed.

madhuri

• Aug 7th, 2006

Just keep  a var in the node and assign it as yes on visiting and traverse .......then each time check this field in the node if not visited i.e, no then make it yes ............if already yes then u hav a loop

SIVA

• Jul 16th, 2006

VERY NICE

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) ZeroB) Same as linked listC) Any NumbersExplanation: There can be a nearly unlimited number of nodes on a stack-linked list, restricted only by the amount of available memory in the computer.

Venkateswara Rao

• Sep 5th, 2006

Because this is linked list, you can create any number of nodes.

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) TrueB) False

Venkateswara Rao

• Sep 5th, 2006

True: Stack follows Last In First Out

sri harsha

 Profile Answers by sri harsha Questions by sri harsha

• Apr 17th, 2006

Its TRUE.It follows FIRST IN LAST OUT.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) insertNode()B) giveNode()C) findNode()D) cannot locate the node at all

Vinan2k

 Profile Answers by Vinan2k Questions by Vinan2k

• Sep 5th, 2006

C) findNode()

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) TrueB) False

Sreenivas

• Oct 31st, 2006

True

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class.B) because initialization of data members of the LinkedList class is performed by the destructor of the LinkedList class.C) because initialization of data members of the QueueLinkedList class is performed by the constructor of the LinkedList...

Sreenivas

• Oct 31st, 2006

C) because initialization of data members of the QueueLinkedList class is performed by the constructor of the LinkedList class.

Answer Question  Select Best Answer

Skill/Topic: Variables and PointersA) You use a structure to access parts of a dataB) You use a structure to group together related data.C) You use a structure to declare an instance of data groupExplanation: Structure is used to group all related data together

naidu saptagiri

• Nov 2nd, 2006

The differnecebetween structure and union is ....the size of structure is sum of all data types containing the structure where as the size of union is the size of largest data type the union contains.....

swapna

• Jun 14th, 2006

structure is to declare different data types at a time,where as a arra y is a group of related data typesthe main difference b/w structure & union is in memory requirement.In structure s memory is su...

Answer Question  Select Best Answer

csabill

• Nov 2nd, 2006

void reverse() { Node < T > *currentNode = head, *nextNode = currentNode->next; while(nextNode) { Node < T > *newNextNode = nextNode->next; nextNode->next = currentNode; cur...

f2003062

 Profile Answers by f2003062 Questions by f2003062

• Oct 30th, 2006

A quite different way..! but same as the previous logic written by Rohit..!struct linkedlist { int x; struct linkedlist* next;}*head;Assume that "head" contains some nos ...example: 1->2->3->4...

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) Bit Shifting

shiney roshia

• Nov 28th, 2006

Ans:modulo division method In this the key to be stored is divided by a no 'n' and the result is the index in which it is to be stored

Answer Question  Select Best Answer