Skill/Topic: Queues Using Linked ListsA) FIFO , First In First Out

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 10th, 2012

Queues are first in first out form of data structures.In a FIFO data structure, the first element added to the queue will be the first one to be removed.

Answer Question  Select Best Answer

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

Pushpa

• Nov 7th, 2007

True

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) The QueueLinkedList class inherits the LinkedList class because the LinkedList class contains data members and function members that are necessary to manage the linked list that is used for the queue.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 14th, 2012

True,as the linkedlist class contains the functions and data members which are used to manage the linked list which is used for the queues,hence queuelinkedlist class inherit the linkedlist class.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False

vengatesh_26

 Profile Answers by vengatesh_26 Questions by vengatesh_26

• Jan 5th, 2009

Yes, We need to change previous pointer value to next node's pointer value.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) referenceB) valueC) declarationD) variable

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Mar 26th, 2012

DeleteNode() function requires the value of data element of the node that is being removed.

Answer Question  Select Best Answer

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

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 27th, 2012

The index position of the node is returned by the findnode() function.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 27th, 2012

True,the insertnodeat() function specifies the index of where to insert the new node into the linked list.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) FalseExplanation: The appendNode() function appends the new node to the list without requiring the programmer to specify where to place the new node in the linked list.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 15th, 2012

No,the appendNode() function do append the new node at the programmers specified place instead it appends the new node at the tail of the linked list instead of head.If the likt is empty then it uses reference pointer to change the head pointer.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) If an invalid index is passed, the function terminates without further processing. [Explanation] Functions that use an index value always determine if the index passed to them is valid before using the index value . If an invalid index is received, the

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Jul 25th, 2012

If the user passes in an invalid index, the program will cause an assertion error. While this is useful to indicate to the user that something went wrong, so they can deal with it as appropriate.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) You enhance the functionality of LinkedList class to more easily manipulate a linked list

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 19th, 2012

To increase the efficiency of the linkedliss class and to allow easy manipulations on the linked list we should enhance the functionality of the class.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) java.util

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 15th, 2012

The linkedlist class is defined in the java.util package.

Answer Question  Select Best Answer

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

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

The getsize() function retrieves the value of the size member of the linked list class.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by 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.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) FalseExplanation: The removeNodeAt() function removes a node by using the node’s index rather than the reference to the node in memory

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 19th, 2012

True, the removenodeat() function removes a node by using the nodes index and not by the the reference to the node in memory.

Answer Question  Select Best Answer

Skill/Topic: TreeA) A tree is a data structure where data is stored in nodesExplanation: A tree is a data structure where data is stored in nodes. Nodes are arranged in branches where each node can expand into 0, 1, or 2 other nodes.

sivanesh.a

 Profile Answers by sivanesh.a Questions by sivanesh.a

• Feb 6th, 2007

Tree is a data structure..

Answer Question  Select Best Answer

Skill/Topic: TreeA) TrueB) False

sivanesh.a

 Profile Answers by sivanesh.a Questions by sivanesh.a

• Feb 6th, 2007

Yes.

Answer Question  Select Best Answer

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

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

The data model provides unique keys as a component of the node which identifies the node.

Answer Question  Select Best Answer

Skill/Topic: TreeA) TrueB) False

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

True, a value is also a component of a node which is used to store data.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) Hashing is the technique of scrambling bits of a key into a hash number.

manishmodgil

 Profile Answers by manishmodgil Questions by manishmodgil

• Jan 2nd, 2008

You could cateogorize hashing as one of the heuristic techniques. Its an important term w.r.t. searching.Hashing uses a has function f(x) to find key which lies in some pre-known domain. here x is the...

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) Hashing assures that the format of keys is uniform and unique

manishmodgil

 Profile Answers by manishmodgil Questions by manishmodgil

• Dec 28th, 2007

It is one of the data structures and could prove to be useful in situation depending upon the domain.Hashing is a technique to organize the data according to some function f(x) applied on the individu...

Answer Question  Select Best Answer