Consider the following pseudocode: declare a stack of characters while ( there are more characters in the word to read ) { read a character push the character on the stack } while ( the stack is not empty ) { write the stack's top character to the screen pop a character off the stack } Call the output written to the screen for the input "carpets" out1. On the other hand; If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, call the output when they are removed out2? Correct answer for out1 + out2 is; A. carpets + DCBA B. carpets + ABCD C. steprac + DCBA D. steprac + ABCD

Consider the following pseudocode: declare a stack of characters while ( there are more characters in the word to read ) { read a character push the character on the stack } while ( the stack is not empty ) { write the stack's top character to the screen pop a character off the stack } Call the output written to the screen for the input "carpets" out1. On the other hand; If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, call the output when they are removed out2? Correct answer for out1 + out2 is; A. carpets + DCBA B. carpets + ABCD C. steprac + DCBA D. steprac + ABCD

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 5PE

See similar textbooks

Similar questions

Create a 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 20
Question 2. Draw/Show the contents of the stack for the following data during each step through using the word: сирсаkes a. During input b. During output
7. The following function converts a postfix expression to an infix expression assuming the expression can only contain unsigned integer numbers and +' and -' operators. 1. public static String convert (String postfix) { 2. String operand1, operand2, infix; 3. Stack s = new AStack; 4. int i = 0; 5. while (i < postfix.length) { char nextc = postfix.charAt (i); if ((nextc 6. 7. '+')|| (nextc == '-') { == operand2 = s.pop (); operandl = s.pop () ; infix = '(' + operandl + nextc + operand2 + ')'; s.push (infix); i++; 8. 9. 10. 11. } 12. else if (Character.isDigit (nextc)){ int start = i; while (Character.isDigit (postfix.charAt (i)) i++; infix = postfix.substring (start, i); s.push (infix); 13. 14. 15. 16. 17. } else i++; 18. 19. } 20 return s.pop () ; 21. } (a) Rewrite only the lines of code that need to be changed so that the above function converts a postfix expression to a prefix expression. (b) Describe in words what changes are needed on the above given convert () function so that it…
IN JS PROGRAMMING LANGUAGE Your local bank has decided to upgrade its ATM machines by incorporating motion sensor technology. The machines now interpret a series of consecutive dance moves in place of a PIN number. Create a program that converts a customer's PIN number to its dance equivalent. There is one dance move per digit in the PIN number. A list of dance moves is given in the code. Examples danceConvert("0000") danceConvert("3856") ["Shimmy", "Shake", "Pirouette", "Slide"] → ["Slide", "Arabesque", "Pop", "Arabesque" ] -
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.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.
3. Use a stack to evaluate the following postfix expression. 3 5 7 + 2 1 * 1 + +
D. If the values of A, B , C and D are 2, 3, 4 and 5 respectively, manually calculate the value of the following postfix expressions using stack. a. AB*C-D+ b. ABC +*D- ||
The stack can be accessed from two places called front and rear Select one: True False
1. Read input 5 integer values from the user and print them in the reverse order of their input using a stack data structure. Programming languages allowed: C++/JAVA/Python
Try a spatuladef pancake_scramble(text):Analogous to flipping a stack of pancakes by sticking a spatula inside the stack and flipping over the stack of pancakes resting on top of that spatula, a pancake flip of order k performed for the text string reverses the prefix of first k characters and keeps the rest of the string as it were. For example, the pancake flip of order 2 performed on the string 'ilkka' would produce the string 'likka'. The pancake flip of order 3 performed on the same string would produce 'klika'.A pancake scramble, as defined in the excellent Wolfram Challenges programming problems site, consists of the sequence of pancake flips of order 2, 3, ... , n performed in this exact sequence for the given n-character text string. For example, the pancake scramble done to the string 'ilkka' would step through the intermediate results 'likka', 'kilka', 'klika' and 'akilk'. This function should compute and return the pancake scramble of its parameter text string. text…
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 20
The following function converts a postfix expression to an infix expression assuming the expression can only contain unsigned integer numbers and ‘+’ and ‘-’ operators. 1. public static String convert(String postfix) { 2. String operand1, operand2, infix; 3. Stack<String> s = new AStack<String>; 4. int i = 0; 5. while(i < postfix.length) { 6. char nextc = postfix.charAt(i); 7. if ((nextc == '+')||(nextc == '-') { 8. operand2 = s.pop(); operand1 = s.pop(); 9. infix = '(' + operand1 + nextc + operand2 + ')'; 10. s.push(infix); i++; 11. } 12. else if (Character.isDigit(nextc)){ 13. int start = i; 14. while(Character.isDigit(postfix.charAt(i)) i++; 15. infix = postfix.substring(start,i); 16. s.push(infix); 17. } 18. else i++; 19. } 20 return s.pop(); 21. } a) Rewrite only the lines of code that need to be changed so…