Stack Data Structure Exam Questions and Answers, Exams of Advanced Education

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 principles. Topics covered range from basic stack operations like push and pop to more complex applications such as parentheses balancing and postfix expression evaluation. The material is suitable for students learning about data structures and algorithms, offering a practical way to reinforce their knowledge through self-assessment and review. The questions address both array-based and linked list implementations of stacks, providing a comprehensive overview of stack-related concepts and their practical implications in computer science.

Typology: Exams

2024/2025

Available from 07/29/2025

EXAMGUIDE
EXAMGUIDE 🇺🇸

4.4

(33)

32K documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
DATA STRUCTURES STACK EXAM
QUESTIONS AND ANSWERS
T/F In the Java API class java.util.Stack<E> implements a stack; there is no Stack
interface - Correct Answers -True
T/F an array can be used for storage of a stack instead of using a Java ArrayList class -
Correct Answers –True
A(n) _ is a data structure in which objects are inserted into and removed from the same
end - Correct Answers -Stack
A(n) _ is a string that reads the same in either direction: left to right or right to left -
Correct Answers -Palindrome
In terms of efficiency all stack operations using an array structure are - Correct Answers
-O(1)
T/F the statement Stack<String> myStack = new Stack<String>(); defines a stack that
holds String objects - Correct Answers -True
T/F there is only one stack interface in Java - Correct Answers -False
The value of the following postfix expression is 12+4*3+ - Correct Answers -15
Rewrite the following statement as an infix expression 56* 10- - Correct Answers -5*6-
10
A(n) _ is a data structure with the property that only the top element is accessible -
Correct Answers -Stack
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 -35
pf3

Partial preview of the text

Download Stack Data Structure Exam Questions and Answers and more Exams Advanced Education in PDF only on Docsity!

DATA STRUCTURES STACK EXAM

QUESTIONS AND ANSWERS

T/F In the Java API class java.util.Stack implements a stack; there is no Stack interface - Correct Answers -True T/F an array can be used for storage of a stack instead of using a Java ArrayList class - Correct Answers –True A(n) _ is a data structure in which objects are inserted into and removed from the same end - Correct Answers -Stack A(n) _ is a string that reads the same in either direction: left to right or right to left - Correct Answers -Palindrome In terms of efficiency all stack operations using an array structure are - Correct Answers -O(1) T/F the statement Stack myStack = new Stack(); defines a stack that holds String objects - Correct Answers -True T/F there is only one stack interface in Java - Correct Answers -False The value of the following postfix expression is 12+43+ - Correct Answers - Rewrite the following statement as an infix expression 56 10- - Correct Answers -56- 10 A(n) _ is a data structure with the property that only the top element is accessible - Correct Answers -Stack 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 What applications may use a stack - Correct Answers -Parentheses balancing, matching HTML tags and evaluating postfix expressions What is written to the screen for the input "carpets" Declare a stack of characters While(more characters to read) { Read and push characters on stack; } While(stack is not empty)