Skill/Topic: Linked ListA) Syntax of displayNodesReverse() is wrongB) Node*temp should be NULLC) Wrong use of paranthesisD) temp should be equal to temp->previous Explanation: The displayNodesReverse() member function displays the contents of a linked list in reverse order,beginning with the node at the back of the linked list and continuing until the first node is displayed.So Previous should be...

samiksc

 Profile Answers by samiksc Questions by samiksc

• Jan 23rd, 2006

(D) temp should be equal to temp->previous

Answer Question  Select Best Answer

Skill/Topic: Linked ListA) LinkedList.h fileB) LinkedList.cpp fileC) LinkedList.txt fileD) LinkedListDemo.cpp file Explanation: Definitions of member functions for the LinkedList class are contained in the LinkedList.cpp file

samiksc

 Profile Answers by samiksc Questions by samiksc

• Jan 23rd, 2006

(B) LinkedList.cpp

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) 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: Stacks using Linked ListA) TrueB) False

kishan_g84

 Profile Answers by kishan_g84 Questions by kishan_g84

• Feb 19th, 2006

A)true

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: 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: 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: 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) 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: 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

The total number of spanning trees that can be drawn using five labelled vertices is: A)125 B) 64 C)36 D)16

Srinivasa Reddy Konda

 Profile Answers by Srinivasa Reddy Konda Questions by Srinivasa Reddy Konda

• Jun 24th, 2011

General Formula : n power(n-2)5 power(5-2)= 5 power 3125

Answer Question  Select Best Answer