The advantage of using linked lists over arrays is that
Option A. Linked list is an example of linear data structure
Option B. Insertion and deletion of an element can be done at any position in a linked list
Option C. Linked list can be used to store a collection of homogenous and heterogeneous data types
Option D. The size of a linked list is fixed
True Answer B
Explanation :
Insertion and deletion in a linked list can be done at any position. On the other hand, in an array, to insert an element at a specific position, the rest of the elements have to be moved one position to the left and to delete an element, all the elements after the deleted element have to be moved one position to the right.
The advantage of using linked lists over arrays is that
Which of the following is an example for non linear data type?
Option A. Tree
Option B. Array
Option C. Linked list
Option D. Queue
True Answer A
Explanation :
A data structure is said to be linear if its elements form a sequence or a linear list. For example array, linked list, queue, stack etc. Elements in a non linear data structure do not form a sequence. For example Trees, graphs etc.
Which of the following is an example for non linear data type?
The principle of stack is
Option A. First in first out
Option B. First in last out
Option C. Last in first out
Option D. Last in last out
True Answer C
Explanation :
A stack is a last in first out(LIFO) data type. This means that the last item to get stored in the stack is the first item to get out of it.
The principle of stack is
Tell whether the following tree is:

Option A. Heap
Option B. Full and Complete
Option C. Heap Complete
Option D. None of the above
True Answer B
Explanation :
Tell whether the following tree is:

Queue data structure works on the principle of
Option A. Last In First Out (LIFO)
Option B. First In Last Out (FILO)
Option C. First In First Out (FIFO)
Option D. Last In Last Out (LILO)
True Answer C
Explanation :
Queue is a linear data structure which works on the principle of first in first out. This means that the first element to be inserted in a queue will be the first one to be removed.
Queue data structure works on the principle of