

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A series of questions and answers related to the stack data structure, covering fundamental concepts, operations, and applications. It includes true/false questions, fill-in-the-blanks, and problem-solving exercises to test understanding of stack implementation using arrays and linked lists. Key topics include lifo principle, stack overflow/underflow, postfix expressions, and balancing parentheses. This resource is designed to reinforce learning and assess comprehension of stack data structures in computer science. It serves as a valuable tool for students and educators alike, offering a concise yet comprehensive review of essential stack concepts and their practical applications in various computing scenarios. Particularly useful for exam preparation and self-assessment, providing clear and concise answers to common stack-related questions.
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


T/F In the Java API class java.util.Stack
In the array version of the stack class, which operations require linear time for their worst case (is empty, peek, pop) - Correct Answers -None In a(n) _ the top element is the data value that was most recently stored - Correct Answers -Stack What are the methods that make up the StackInt interface - Correct Answers -Push(), pop(), peek(), empty() What is the value of the following postfix expression 561+* - Correct Answers - Is the following a balanced expression (a+b{[d-e]}) +(d/e) - Correct Answers -Yes The storage policy used by stack is what - Correct Answers -LIFO What does LIFO mean - Correct Answers -Last in first out The value of the following expression is 573 10++4/ - Correct Answers - What will an array look like after Stack s = new Stack(); S.push(1); S.push(2); S.push(3); System.out.println(s.pop()); - Correct Answers -0|1| 1|2| Top is pointed at 1s index Updates top What will a linked list look like after Stack s = new Stack(); S.push(1); S.push(2); S.push(3); System.out.println(s.pop()); - Correct Answers -|2| -> |1| Top is at 2 Update variable of head The operation for adding an entry to a stack is called - Correct Answers -Push The operation for removing an element from a stack is called - Correct Answers -Pop What stack operation could result in stack overflow - Correct Answers -Push Which stack operation could result in stack underflow - Correct Answers -Pop