1.) Queue data structure works on
A - LIFO
B - FIFO
C - FILO
D - none of the above
2.) Linked list search complexity is
A - Ο(1)
B - Ο(n)
C - Ο(log n)
D - Ο(log log n)
3.) What does LinkedList consist of?
a.) Node
b.) Address of next node
c.) Both a and b
d,) None
4.) Stack Follows
a.) LIFO
B.) FIFO
C.) Both a and b
d.) None