Data Structure
First in first out
This form of access is used to add and remove nodes from a queue.
Two fields
Each node in a linked list must contain at least ___________________.
LIFO
Stack follows the strategy of ________________.
Stacks
The term push and pop is related to _____________.
Push
The term used to insert an element into stack.
First record of the actual data
The dummy header in linked list contains ____________________.
Reverse
The elements are removal from a stack in _________ order.
Traversal
The operation of processing each element in the list is known as ________________.
Top
A pointer variable which contains the location at the top element of the stack.
Front
Deletion operation is done using __________ in a queue.
2
Each node in singly linked list has _______ fields.
Circular linked List
A linear list in which the last node points to the first node.
Singly linked list
A linear list in which the pointer points only to the successive node.
Sentinel
This indicates the end of the list.
FIFO List
Which of the following names does not relate to stacks?
Predecessor node
LINK is the pointer pointing to the ____________________.
For the size of the structure and the data in the structure are constantly changing
Linked lists are best suited _____________________.
Back
New nodes are added to the ________ of the queue.
Pop
The retrieval of items in a stack is ___________ operation.
Underflow
The situation when in a linked list START=NULL is ____________________.
List traversed in two way directions
Which of the following is a two-way list?
All of these
Which of the following is an application of stack?
Avail
Which is the pointer associated with the availability list?
Top
Which is the pointer associated with the stack?
circular linked list
In linked lists, there are no NULL links in ______________
Info
In linked representation of stack, ___________ fields hold the elements of the stack.
Bottom of the stack
In linked representation of stack, the null pointer of the last node in the list signals _____________________.
Middle
Indexing the ________________ element in the list is not possible in linked lists.
Fifo
What is a queue?
Link field
In a linked list, the ____________ contains the address of next element in the list.
LIFO
This form of access is used to add/remove nodes from a stack.
Dequeue
This is a linear list in which insertions and deletions are made to form either end of the structure.
Push
This is the insertion operation in the stack.
Pop
This is the term used to delete an element from the stack.
Garbage collection
This may take place only when there is some minimum amount or no space left in free storage list.
List
This refers to a linear collection of data items.
0
Value of first linked list index is _______________.
The new node is placed at the front of the linked list
Value of first linked list index is _______________.
The new node is placed at the front of the linked list
What happens when you push a new node onto a stack?
Small batches of records from a file
What is a run list?