-
-
In an array queue, data is stored in an _____ element.
Skill/Topic: Queues Using Linked ListsA) NodeB) linked listC) arrayD) constructorExplanation: In an array queue, data is stored in an array element. In a linked list queue, data is stored in a node of a linked list
-
A _______ 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.
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.
-
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.
-
_______ form of access is used to add and remove nodes from a queue.
Skill/Topic: Queues Using Linked ListsA) FIFO , First In First Out
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.
-
QueueLinkedList class inherit the LinkedList class.
Skill/Topic: Queues Using Linked ListsA) TrueB) False
-
Why does QueueLinkedList class inherit the LinkedList class?
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
- 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.
-
The removeNode() requires a reference to the node that is to be removed.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False
vengatesh_26
- Jan 5th, 2009
Yes, We need to change previous pointer value to next node's pointer value.
-
DeleteNode() function requires the _____ of the data element of the node that is being removed.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) referenceB) valueC) declarationD) variable
Sandhya.Kishan
- Mar 26th, 2012
DeleteNode() function requires the value of data element of the node that is being removed.
-
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.
-
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.
-
The appendNode() function appends the new node to the list along with the programmer specifing where to place the new node in the linked list.
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
- 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.
-
What happens if an invalid index value is passed to a function?
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
- 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.
-
Why is it important to enhance the functionality of the LinkedList class?
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
- 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.
-
The LinkedList class is defined in the _______ package.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) java.util
-
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.
-
The insertNodeAt() function places a new node at a specific location in the linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False
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.
-
The removeNodeAt() function removes a node by using the node’s index?
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
- 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.
-
What is a Tree?
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.
-
A parent node is a node that branches into one or two other nodes, which are called child nodes.
Skill/Topic: TreeA) TrueB) False
Data Structures Interview Questions
Ans