Assignment 04 - PART 2 Palindromes (50 points) - Note Part 2 is a separate deliverable: In this part, you will use stacks to recognize palindromes. Palindromes are strings that read the same backward as forward (for example "madam"). Write a program to read a line in from the keyboard and print to the display, whether or not it is a palindrome. You will use three stacks to implement the program. For simplicity use only lower-case letters in your test strings. Use the following logic 1. Push original string onto Stack_1 and also Stack_2 2. Pop Stack_1 and push onto Stack_3 until Stack_1 is empty 3. At this point Stack_2 is the original string and Stack_3 is the reverse 4. Compare Stack_2 and Stack_3 using dot = 5. If Stack_2 is equal to Stack_3 the string is a palindrome Test your string by entering data from the keyboard and writing out to the screen whether the string is a palindrome.

Assignment 04 - PART 2 Palindromes (50 points) - Note Part 2 is a separate deliverable: In this part, you will use stacks to recognize palindromes. Palindromes are strings that read the same backward as forward (for example "madam"). Write a program to read a line in from the keyboard and print to the display, whether or not it is a palindrome. You will use three stacks to implement the program. For simplicity use only lower-case letters in your test strings. Use the following logic 1. Push original string onto Stack_1 and also Stack_2 2. Pop Stack_1 and push onto Stack_3 until Stack_1 is empty 3. At this point Stack_2 is the original string and Stack_3 is the reverse 4. Compare Stack_2 and Stack_3 using dot = 5. If Stack_2 is equal to Stack_3 the string is a palindrome Test your string by entering data from the keyboard and writing out to the screen whether the string is a palindrome.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

Assume s1,s2 are two stacks and we write s1=s2 , if the class stack based on array then إختر أحد الخيارات: a. This statement is good to use when s1 has small number of items b. This statement is good to use when s2 has large number of items c. This statement is good to use when s2 has small number of items d. This statement is good to use when s1 has large number of items أخلِ اختياري
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
If the elements “A”, “B”, “C” and “D” are placed in a stack and are removed one at a time, in what order will they be removed?
5. Write a program to declare a stack of char data type and insert all the uppercase alphabets in it, and print them by popping them back out of the stack.
JAVA programming question i will attach images of the ourQueue code and the main I have to do the following: *create an ourQueue object, add the following sequence: *2,-3,4,-6,7,8,-9,-11 *create and ourStack object *write a program/ one loop that would result into the stack containing all of the negative number at the bottom and the positive numbers at the top. *outStack at the end should contain the following *[-3,-6,-9,-11,2,4,7,8]
Assume s1,s2 are two stacks and we write s1=s2 , if the class stack based on array then Select one: a. This statement is good to use when s2 has large number of items b. This statement is good to use when s1 has small number of items c. This statement is good to use when s1 has large number of items d. This statement is good to use when s2 has small number of items
1. Use a below-given starter code. Use StackInterface.(h), and ArrayStack.(h,cpp). You will write your own StackDriver.cpp application file. IT'S IN C++Also...If the class that you create is Star, remember that you will declare your stack as follows:ArrayStack<Star> myStarStack;and you will push, pop, and peek Star objects.2. Create your own class definition. I should have at least one attribute, a constructor, and set and get methods for each attribute in your class.NOTE: If your class is offensive your lab will be rejected and you will receive a score of zero. I'm sorry I have to say this but there is a history of this happening and it is not appropriate.3. Write a driver program that exercises the Stack class from the downloaded starter code. Create multiple instances of your own class and demonstrate the stack operations: push, pop, and peek. ( you write your own class that you will put on the stack and you will write a driver that pushes, peeks, and pops your class items…
*in java* A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings), separated by a comma. That list is followed by a name, and your program should output the phone number associated with that name. Assume that the list will always contain less than 20 word pairs. Ex: If the input is: 3 Joe,123-5432 Linda,983-4123 Frank,867-5309 Frank the output is: 867-5309 Your program must define and call the following method. The return value of getPhoneNumber() is the phone number associated with the specific contact name.public static String getPhoneNumber(String[] nameArr, String[] phoneNumberArr, String contactName, int arraySize) Hint: Use two arrays: One for the string names, and the other for the string phone numbers.…
Q1: Write a java application for the stack operations with Linked List. Q2: Write java program to take the order from the customer and display the ordered items and total payment. If customer is entering the wrong name or not following the order to enter the menu it has to display error messages. (Find in the sample code) Sample Output:
3- Write a program that randomly generates 10 numbers (between 1 and 8), inserts into queue and then finds how many distinct elements exist in the queue. Example 1: Example 2: Queue: 2 40 3 3 2 18 4 18 18 3 Queue: 1 1 4 33 16 16 4 16 4 Output: 5 Output: 4 Notes: • You must use ONLY queue data structure. Don't use other different data structures like string or normal (pure) array or stack or array list. • Don't write any other method in the Qeueu class. All methods must be written in the main program.
java program: If in the ArrayStack, the first element that we push to the stack, is stored in location capacity – 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topOfStack to capacity and we write the push method as follows: public E push(E obj) { if (topOfStack == 0) reallocate(); topOfStack--; theData[topOfStack] = obj; return obj; } This push method can work but the if statement should be: if (topOfStack == theData.length - 1) reallocate(); This push method will work provided we modify the reallocate method. This push method can work, but topOfStack-- ; should come after theData[topOfStack] = obj; This push method can work, but topOfStack-- ; should be topOfStack++;
Write a program and fill a queue with random numbers between 0 and 100. The size of thequeue is assumed to be 15. After filling the array with random numbers, display the elements in the queue and remove the elements of the queue and store these numbers according to the following criteria.If the number in the queue is less than 50, remove it from the queue and store it inside queue 2.Else, remove the number and store these values inside queue 3.Display all three queues on the screen.