q1 java lang

Aurinn wus Lab Stacks Queues and Priority Queues - Word p Search Xeral dial Insert Design Layout References Malings Review View Help Share Comments Fle Home A X Cut A 21 2 Find - 43 Repce Colibri Body 11 A A Aa A A E- BI, XA2-A- A EEEEE COM Anbcc A:BCOCCEDE AaBbcc ABCD AaBbCal. Aalbce AaBb BbDABbcc Aabbcc Console. 1 labhgu. Lab Figu.. 1 Lab Goal 1 Lab Goal. 1 Lab Hub Lab Rub.. 1 Lab Rub. 1 Lab Sol. 1 Lab Solu. Labak TE - Sensit dhor 3 Format Painter Clipboard Font PASAPP Editing Voir Editor Task 1. Questions. (5 points) 1.1 What does LIFO stand for? A. Last In Last Out B. Last In First Out C. First In Last Out D. First In First Out 1.2. How many items can you put on a stack? A. As many as you allocate when you create the stack B. As many as will fit in the computer's memory As many as will fit in a single string D. Ten 1.3. Which operations does a stack support? (Choose two) Delete Push Append Sort Pop 1.4. Which kind of structure is a stack? FIFO LIFO FILO LILO 1.5. Suppose variable LIFO is defined as a stack. How do you check to see if the stack is empty? (Choose two) if (LIFO.empty()) if (LIFO.size() > @) 1.6. What happens if you call peek) on an empty stack? 1 A. peek() returns zero B. peek() returns NULL C. peek() throws an exception D. You can't call peekl) on an empty stack Type here to search O Ti ADRENG 7:59 PM 7/7/2001 5