Define and compare all the Abstracts Data Structures covered so far in the course. $(3$ points$)$

What method can a programmer use to avoid queue underflow? $(2$ points$)$

Is a Constructor really needed for the linked list version of a stack? What happen if we omitted the constructor? $(2$ points$)$

What kind of exception is thrown when you try to pop an empty stack? Which Java Class Library defines this exception? $(3$ points$)$

Discuss the advantages and disadvantages of an arraybased implementation of the ADT stack as compared to a linked implementation. $(5$ points$)$