Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 20, Problem 5MC
Program Description Answer
A method peek() is used to fetch the top most element of a stack without removing it from the stack.
Hence, the correct answer is option “C”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
When we use the new operator to produce a String, where does it go?
a. Stack
b. String storage
c. Massive memory
d. Unpredictable storage space
Create your own called class called Stack
Your class should store items transparently. You should add items using a Push method and remove them through the Pop method.
Add an IsEmpty method should return whether there are any items in the stack or not. A CountItems method should tell you the current number of items in the stack
Write some code to test your Stack class using the shapes in part 1.
C#
Reverse the stack - This procedure will reverse the order of items in the stack. This one may NOT break the rules of the stack. HINTS: Make use of more stacks. Arrays passed as parameters are NOT copies. Remember, this is a procedure, not a function.
This would occur in the NumberStack class, not the main class. These are the provided variables:
private int [] stack;private int size;
Create a method that will reverse the stack when put into the main class.
Chapter 20 Solutions
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Ch. 20.3 - Prob. 20.1CPCh. 20.3 - Prob. 20.2CPCh. 20.3 - Prob. 20.4CPCh. 20.3 - Prob. 20.5CPCh. 20.6 - Prob. 20.6CPCh. 20.6 - Prob. 20.7CPCh. 20.6 - Prob. 20.8CPCh. 20.6 - Prob. 20.9CPCh. 20 - Prob. 1MCCh. 20 - Prob. 2MC
Ch. 20 - Prob. 3MCCh. 20 - The concept of seniority, which some employers use...Ch. 20 - Prob. 5MCCh. 20 - Prob. 6MCCh. 20 - Prob. 8TFCh. 20 - Prob. 9TFCh. 20 - Prob. 10TFCh. 20 - Prob. 1FTECh. 20 - Prob. 2FTECh. 20 - Prob. 3FTECh. 20 - Prob. 4FTECh. 20 - Prob. 5FTECh. 20 - Prob. 1AWCh. 20 - Prob. 2AWCh. 20 - Suppose that you have two stacks but no queues....Ch. 20 - Prob. 1SACh. 20 - Prob. 2SACh. 20 - Prob. 3SACh. 20 - Prob. 4SACh. 20 - Prob. 5SACh. 20 - Prob. 6SA
Knowledge Booster
Similar questions
- help pleeasee Create a C code that will allow the user to input a word and check whether it is a palindrome or not. Also input the reversed string of the word. Use a stack to reverse the order of a string and identify whether it is a palindrome or not. It should not be case-sensitive. Example 1: Input string: Racecar Reversed string: racecar Palindrome: Yes exampl 2: Input string:ToyotA Reversed string: atoyot Palindrome: No Note: maximum string length is 20arrow_forwardC# Reverse the stack - This procedure will reverse the order of items in the stack. This one may NOT break the rules of the stack. HINTS: Make use of more stacks. Arrays passed as parameters are NOT copies. Remember, this is a procedure, not a function. public void ReverseStack(){ }arrow_forwardCreate an application that reads a statement from the user and outputs it with the characters of each word reversed. To reverse the letters in each phrase, use a stack.arrow_forward
- Derive the given word using the stack method. S→ aAD│bAB A→ a│aA│bAD B→ bA│b D→ d│SAB Word = bbaaaadabb note: subject: compailer concepts deptt: cs/Itarrow_forwardFor this code just explain the void pop function, with enough explanation that how it is working. Thanks #include<iostream> using namespace std; int choice, j=0;int stack[50];int *top;bool Exit_Indicator = false; void displayStack() { cout << "\n\t~Stack Display~\nTOP ->"; for (int i = j-1; i >= 0; i--) cout << "\t|\t" << stack[i] << "\t|" << endl; cout << "\t-----------------";} void push(int i){ cout << "\n(" << i << ") has been PUSHED into the stack!"; *top = i; top++; j++;} void pop(){ if((*(top-2) != 0 && *(top-1)!= 0) || (*(top-2) == 0 && *(top-1)!= 0)) { cout << "\n(" << *(top-1) << ") has been POPPED from the stack!"; *(top-1)= 0; top--; j--; } else{ cout<<"\nTHE STACK IS EMPTY";}} int main() { int value; top = stack; do { cout <<…arrow_forwardStack<String> names=new Stack(); String temp="A"; names.push("John"); names.push("Mary"); temp=names.pop(); names.push("Jim"); temp=names.pop(); temp=names.pop(); System.out.println(temp); What is the output?arrow_forward
- Create a menu driven application that will implement a stack and the user will be asked about the size of an array they wanted.arrow_forwardFor this code, just explain the void pop function, with each and every line. And please provide enough information on how it is working. #include<iostream> using namespace std; int choice, j=0;int stack[50];int *top;bool Exit_Indicator = false; void displayStack() { cout << "\n\t~Stack Display~\nTOP ->"; for (int i = j-1; i >= 0; i--) cout << "\t|\t" << stack[i] << "\t|" << endl; cout << "\t-----------------";} void push(int i){ cout << "\n(" << i << ") has been PUSHED into the stack!"; *top = i; top++; j++;} void pop(){ if((*(top-2) != 0 && *(top-1)!= 0) || (*(top-2) == 0 && *(top-1)!= 0)) { cout << "\n(" << *(top-1) << ") has been POPPED from the stack!"; *(top-1)= 0; top--; j--; } else{ cout<<"\nTHE STACK IS EMPTY";}} int main() { int value; top = stack; do { cout <<…arrow_forwardCreate a C code that will allow the user to input a word and check whether it is a palindrome or not. Use a stack to reverse the order of a string and identify whether it is a palindrome or not. It should not be case-sensitive. Example 1: Input string: Racecar Reversed string: RACECAR (Note, this can also be all lowercase) Palindrome: Yes exampl 2: Input string:caRrot Reversed string: TORRAC(Note, this can also be all lowercase) Palindrome: No Note: maximum string length is 20arrow_forward
- Using one or more stacks, write a code segment to read a string of charactersand determine whether it forms a palindrome.Definition: A palindrome is a sequence of characters that reads the same both forward andbackward.Example: ABLE WAS I ERE I SAW ELBA.The character ‘.’ ends the string. Write a message indicating whether the string is a palindrome.You may assume that the data are correct and that the maximum number of characters is 80.arrow_forwardCreate an application that reads a statement from the user and outputs it with the characters of each word reversed. To reverse the characters in each word, use a stack.Create an application that reads a statement from the user and outputs it with the characters of each word reversed. To reverse the characters in each word, use a stack.arrow_forwardC# Reverse the stack - This procedure will reverse the order of items in the stack. This one may NOT break the rules of the stack. HINTS: Make use of more stacks. Arrays passed as parameters are NOT copies. Remember, this is a procedure, not a function. private int [] stack; private int size; public void ReverseStack(){ }arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education