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

Which is the best sorting algorithm and why? I know again that it depends on the implementation but how do you select that a particular one is the best one to implement. In other words what are the factors for selecting a sorting algorithm?

Damarla Nalini

 Profile Answers by Damarla Nalini Questions by Damarla Nalini

• Jul 28th, 2011

Quick sort

Shrima Baskar

 Profile Answers by Shrima Baskar Questions by Shrima Baskar

• Jul 26th, 2011

the best sorting algorithm is quick sort as it is O(nlogn) and will be able to process the input data fast even in case of very large n. In case of small n ,insertion sort is best and when the range o...

Answer Question  Select Best Answer

What is the total number of equivalent relations that can be defined on the set (1,2,3)? 1. 8 2. 64 3. 5 4. 3

rajani_vaddepalli15

 Profile Answers by rajani_vaddepalli15 Questions by rajani_vaddepalli15

• Aug 7th, 2008

Equivalent relation = {(x,y)/x,y belong to the set and,x=y}The ans is 3,i.e,three equivalent sets

Answer Question  Select Best Answer

which of the following is not primitive recursive but computable ? 1. Carnot function 2. Riemann function 3. Bounded function 4. Ackermann function

zeptov

 Profile Answers by zeptov Questions by zeptov

• Nov 7th, 2010

4. Ackermann function

Answer Question  Select Best Answer

The process of transforming one bit pattern into another by bit-wise operations is called 1. masking 2. pruning 3. biting 4. chopping

manishmodgil

 Profile Answers by manishmodgil Questions by manishmodgil

• Dec 28th, 2007

1. masking     is AND operation to convert a preknown number of digits to 0     if these are the bits    101100110 and if 4 LSBs are to masked AND it with ...

Answer Question  Select Best Answer

1. Linear list 2. search tree 3. Hash table 4. self-organization list

aries

• Aug 29th, 2007

Hash Table uses the property 'Locality of Reference'.

Answer Question  Select Best Answer

vinod148

 Profile Answers by vinod148 Questions by vinod148

• Oct 23rd, 2009

3. Intensity Compensation

Answer Question  Select Best Answer

deepali

• Aug 18th, 2007

It is one to many relationship,because one customer may pay many bill.

Answer Question  Select Best Answer

picop

 Profile Answers by picop Questions by picop

• Dec 3rd, 2007

3. symmetric about y-axis
4. an even function

an even function is symmetric with y-axis. If this function is symmetric with y-axis, each y value has two corresponding x values. A function can only has its inverse function when each y value just correspond to only one x value.

Answer Question  Select Best Answer

1. Crisp binary choices
2. Ambiguous data
3. Decision makers
4. All of them

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Jun 13th, 2012

Fuzzy logic system relays on all Crisp binary data, ambiguous data and on decision makers.

Answer Question  Select Best Answer