ITE6201 Data Structures and Algorithms
(PreLim)
Question 1
Question text
The operation of processing each element in the list is known as ________________.
Question 2
Question text
This form of access is used to add/remove nodes from a stack.
Question 3
Question text
Indexing the ________________ element in the list is not possible in linked lists.
Question 4
Question text
This indicates the end of the list.
Question 5
Question text
In linked representation of stack, ___________ fields hold the elements of the stack.
Question 6
Question text
Stack follows the strategy of ________________.
Question 7
Question text
In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.
Question 8
Question text
This form of access is used to add and remove nodes from a queue.
Question 9
Question text
LINK is the pointer pointing to the ____________________.
Question 10
Question text
This may take place only when there is some minimum amount or no space left in free storage list.
Question 11
Question text
Each node in a linked list must contain at least ___________________.
Question 12
Question text
Value of first linked list index is _______________.
Question 13
Question text
Which is the pointer associated with the availability list?
Question 14
Question text
New nodes are added to the ________ of the queue.
Question 15
Question text
A linear list in which the pointer points only to the successive node.
Question 16
Question text
The retrieval of items in a stack is ___________ operation.
Question 17
Question text
The situation when in a linked list START=NULL is ____________________.
Question 18
Question text
This is the term used to delete an element from the stack.
Question 19
Question text
Each node in singly linked list has _______ fields.
Question 20
Question text
A linear list in which the last node points to the first node.
Question 21
Question text
Linked lists are best suited _____________________.
Question 22
Question text
The dummy header in linked list contains ____________________.
Question 23
Question text
The term used to insert an element into stack.
Question 24
Question text
In linked representation of stack, the null pointer of the last node in the list signals _____________________.
Question 25
Question text
What is a run list?
Question 26
Question text
The elements are removal from a stack in _________ order.
Question 27
Question text
A pointer variable which contains the location at the top element of the stack.
Question 28
Question text
In linked lists, there are no NULL links in ______________
Question 29
Question text
Which is the pointer associated with the stack?
Question 30
Question text
Which of the following is an application of stack?
Question 1
Question text
This is the term used to delete an element from the stack.
Question 2
Question text
Linked lists are best suited _____________________.
Question 3
Question text
Stack follows the strategy of ________________.
Question 4
Question text
A linear list in which the last node points to the first node.
Question 5
Question text
In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.
Question 6
Question text
This is the insertion operation in the stack.
Question 7
Question text
Which of the following is an application of stack?
Question 8
Question text
Which of the following is two way lists?
Question 9
Question text
Each node in a linked list must contain at least ___________________.
Question 10
Question text
What is a queue?
Question 11
Question text
This is a linear list in which insertions and deletions are made to form either end of the structure.
Question 12
Question text
What happens when you push a new node onto a stack?
Question 13
Question text
The situation when in a linked list START=NULL is ____________________.
Question 14
Question text
In linked representation of stack, the null pointer of the last node in the list signals _____________________.
Question 15
Question text
The elements are removal from a stack in _________ order.
Question 16
Question text
The term used to insert an element into stack.
Question 17
Question text
Value of first linked list index is _______________.
Question 18
Question text
A linear list in which the pointer points only to the successive node.
Question 19
Question text
The term push and pop is related to _____________.
Question 20
Question text
In a linked list, the ____________ contains the address of next element in the list.
Question 21
Question text
The dummy header in linked list contains ____________________.
Question 22
Question text
Which of the following names does not relate to stacks?
Question 23
Question text
The retrieval of items in a stack is ___________ operation.
Question 24
Question text
Which is the pointer associated with the availability list?
Question 25
Question text
Which is the pointer associated with the stack?
Question 26
Question text
The operation of processing each element in the list is known as ________________.
Question 27
Question text
In linked lists, there are no NULL links in ______________
Question 28
Question text
New nodes are added to the ________ of the queue.
Question 29
Question text
This form of access is used to add and remove nodes from a queue.
Question 30
Question text
Each node in singly linked list has _______ fields.