Loading...

Messages

Proposals

Stuck in your homework and missing deadline? Get urgent help in $10/Page with 24 hours deadline

Get Urgent Writing Help In Your Essays, Assignments, Homeworks, Dissertation, Thesis Or Coursework & Achieve A+ Grades.

Privacy Guaranteed - 100% Plagiarism Free Writing - Free Turnitin Report - Professional And Experienced Writers - 24/7 Online Support

Newts restaurant in navarre ohio

22/10/2021 Client: muhammad11 Deadline: 2 Day

Stacks And Queues

Stacks and Queues In this assignment, you will be implementing Stacks and Queues. You will then use stacks and queues to test if words are palindromes, and use stacks to decompose phrases into words (to find new palindromes).

● Implement ​MyStack​ (use the included ​MyLinkedList​ to store the stack elements) ○ Implements ​StackInterface ○ Throws a ​StackException​ if peek or pop are called on an empty stack

● Implement ​MyQueue​ (use ​MyLinkedList​ to store the stack elements) ○ Implements ​QueueInterface ○ Throws a ​QueueException​ if peek or dequeue are called on an empty queue

● Test your MyStack and MyQueue ​thoroughly ● In ​Palindrome.java

○ Implement ​stackToReverseString()​ using MyStack ○ Implement ​reverseStringAndRemoveNonAlpha()​ using ​MyStack ○ Implement ​isPalindrome()​, which returns true if a word or phrase is a

palindrome, using ​MyStack​ and ​MyQueue ○ CHALLENGE: Implement ​explorePalindrome()​ which lists all possible

backwards decompositions of a phrase (e.g. “evil guns” => snug live“), a common trick to make new palindromes (uses MyStack)

● Style requirements ​(NEW!) ○ Indent your code properly

■ There are several mainstream “styles” of indentation, pick one and be consistent. EG: ​https://javaranch.com/styleLong.jsp

○ Name your variables with helpful and descriptive names ■ Whats a good variable name? Here is a ​guide

○ Add comments before every function, and in your code ■ Comments should say ​what you are trying to do​ and ​why ■ Consult this ​guide to commenting

Point breakdown Stacks ​ - 20 points Queues ​ - 20 points Style ​ - 15 points Implementing the functions: String ​stackToReverseString​(MyStack)​ - 10 points String ​reverseStringAndRemoveNonAlpha​(String)​ - 5 points Boolean ​isPalindrome​(String)​ - 10 points

https://javaranch.com/styleLong.jsp
https://a-nickels-worth.blogspot.com/2016/04/a-guide-to-naming-variables.html
https://code.tutsplus.com/tutorials/top-15-best-practices-for-writing-super-readable-code--net-8118
void​ ​explorePalindrome​()​ (and its helper)​ - 20 points

Implementing MyStack and MyQueue In this assignment, we will be making heavy use of the classes ​MyStack​ and ​MyQueue​. You have already implemented ​ MyLinkedList.java​ in a previous assignment. You can use your code, or the sample ​MyLinkedList.java ​provided. Implement ​MyStack.java​ and ​ MyQueue.java ​using the provided interfaces and exceptions. Make sure you have implemented a ​public​ String ​toString​()​ method on MyStack and MyQueue that prints out the contents of the stack from the top down and prints out the queue from the front to back. So, for example, after the following code:

MyStack stack = ​new​ MyStack(); MyQueue queue = ​new​ MyQueue(); stack.push(​"Hello"​); queue.enqueue(​"Hello"​); stack.push(​"big"​); queue.enqueue(​"big"​); stack.push(​"world"​); queue.enqueue(​"world"​);

System.out.println(​"Stack = "​ + stack); System.out.println(​"Queue = "​ + queue);

Then the output would be:

Stack = (world, big, hello)

Queue = (hello, big, world)

Test your code thoroughly!! ​We have provided ​TestQueuesAndStacks.java​ as an example of some ways to test your code, but you will want to edit it to try out many possible situations. Make sure your code behaves ​exactly ​ as you expect it to, before starting the second half of the assignment.

Is this a palindrome? A palindrome is a word or phrase that reads the same backwards and forwards, if you ignore punctuation and spaces. For example:

● A dog! A panic in a pagoda!

● ABBA ● Cigar? Toss it in a can. It is so tragic. ● Yo, bottoms up! (U.S. motto, boy.) ● Stressed was I ere I saw desserts.

(from ​http://www.palindromelist.net/palindromes-y/​) In this part of the assignment, you will be writing several functions in ​Palindrome.java ​to test and create palindromes using your stack and queue implementations.

Example Input & Output Palindrome.java​ takes as input: a ​mode ​, and some ​words. ​The mode is either “test” or “expand”, so the function call will be: Test for palindromes Are these phrases palindromes?

javac Palindrome.java && java Palindrome test "oboe" "ABBA" "I'm alas, a

salami" "evil liver"

'oboe': false

'ABBA': true

'I'm alas, a salami': true

'evil liver': false

Expand palindromes Which words could be added to make this a palindrome?

javac Palindrome.java && java Palindrome expand "an era live" "mug god"

an era live: evil a ren a

an era live: evil aren a

an era live: evil arena

mug god: dog gum

http://www.palindromelist.net/palindromes-y/
Functions to implement: String ​stackToReverseString​(MyStack)​:​ your toString function in your stack class prints out the stack in the order that things would be popped from it. What if we want to turn it into a string in the opposite order (the order that things were ​pushed to it)? In Palindrome.java, we do not have access to the internal representation of the stack’s list. So instead, we have to pop everything off the stack, read it in order and push it pack onto the stack in the original order so that the stack is unchanged (​Whew!​)

● Create an empty string ● Create a new temporary stack ● Pop everything from the original stack onto

the new stack ● Pop everything from the new stack back

onto the original stack ​and​ add it to the string

String ​reverseStringAndRemoveNonAlpha ​(String) Use a stack to reverse a string. Similar to before. Also, we want to not only

● Create a new stack. ● Iterate through the string, and push each character from the string onto the stack, but

only if ​they are alphabetic (ignore spaces and punctuation) ○ Character.isAlphabetic ​will be a useful function here!

● Pop everything from the stack to reconstruct the string in reverse.

● Note: your stack can only contain Objects. Java’s ​char​ datatype isn’t an object though! This means that you will have to wrap it (and later cast it) as a ​Character​ type. Look up the Character class in Java’s documentation, or find out more about wrapper classes here ​.

Boolean ​isPalindrome​(String) Implement this function using ​ both a stack and a queue. To test if a string is a palindrome:

● Convert the string to lowercase (we don’t care about uppercase vs lowercase characters being different)

● Create a new stack and queue. ● Enqueue and push each character (if it is alphabetic, we don’t want to look at white

space or punctuation) ● Pop each character from the stack and dequeue each character from the queue until

one is empty ● Notice how in our above functions, pushing and then popping from a stack ​reversed the

order. ​How will you use this to test whether this string is a palindrome?

void ​explorePalindrome​(String) This function lists all possible endings that would make this string a palindrome, e.g.:

javac Palindrome.java && java Palindrome expand "an era live" "mug god"

an era live: evil a ren a

an era live: evil aren a

an era live: evil arena

First, convert the string to lowercase and use your ​reverseStringAndRemoveNonAlpha function to reverse it and remove non-alphabetical characters. Now, most of the work will be done by a recursive helper function to decompose this new string (“evilarena”) into words. Takes the original string, the reversed string, an index, and the current stack of words we are building up

​public​ ​static​ ​void​ ​decomposeText​(String originalText, String textToDecompose, ​int​ index, MyStack decomposition)

We have provided a function ​ String[] getWords(String text, ​int​ index) ​that uses a dictionary to find which words could be created from a string at a given index. For example getWords(​"isawere"​, ​0​) ​could find the words “i” and “is”, ​ getWords(​"isawere"​, ​2​)​ could find the words (“a”, “aw” and “awe”). A recursion step:

https://en.wikipedia.org/wiki/Primitive_wrapper_class
● If the index is at the end of the word, we are finished, print out the words (using reverse print) and the original text.

● Else: Find the potential words at that index ● For each word:

● Push it to the stack ○ Recurse at the next index (not *just* i++) ○ If it was part of a correct solution, it will print itself out in a subsequent

recursion step (if it reaches a conclusion) ● Pop it from the stack

● Confused? See below for a visual explanation of this approach. ○ As usual, println statements may help you understand your code’s operation if

you get lost. Consider outputting the list of words from getWords, or printing out the ​decomposition​ stack each time you push or pop from it. Just remove your debug statements before turning in your code.

Turning the code in

● Create a directory with the following name: _assignment3 where you replace with your actual student ID. For example, if your student ID is 1234567, then the directory name is 1234567_assignment3

● Put a copy of your edited files in the directory (MyQueue.java, MyStack.java, and Palindrome.java)

● Compress the folder using zip. Zip is a compression utility available on mac, linux and windows that can compress a directory into a single file. This should result in a file named _assignment3.zip (with replaced with your real ID of course).

● Double-check that your code compiles and that your files can unzip properly. You are responsible for turning in working code.

● Upload the zip file through the page for ​Assignment 3 in canvas

https://canvas.ucsc.edu/courses/12730/assignments/40191
Visual example of palindrome search with stacks

Homework is Completed By:

Writer Writer Name Amount Client Comments & Rating
Instant Homework Helper

ONLINE

Instant Homework Helper

$36

She helped me in last minute in a very reasonable price. She is a lifesaver, I got A+ grade in my homework, I will surely hire her again for my next assignments, Thumbs Up!

Order & Get This Solution Within 3 Hours in $25/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 3 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

Order & Get This Solution Within 6 Hours in $20/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 6 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

Order & Get This Solution Within 12 Hours in $15/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 12 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

6 writers have sent their proposals to do this homework:

Math Exam Success
Financial Solutions Provider
Instant Assignments
Calculation Guru
ECFX Market
A Grade Exams
Writer Writer Name Offer Chat
Math Exam Success

ONLINE

Math Exam Success

I can assist you in plagiarism free writing as I have already done several related projects of writing. I have a master qualification with 5 years’ experience in; Essay Writing, Case Study Writing, Report Writing.

$26 Chat With Writer
Financial Solutions Provider

ONLINE

Financial Solutions Provider

After reading your project details, I feel myself as the best option for you to fulfill this project with 100 percent perfection.

$43 Chat With Writer
Instant Assignments

ONLINE

Instant Assignments

I have done dissertations, thesis, reports related to these topics, and I cover all the CHAPTERS accordingly and provide proper updates on the project.

$47 Chat With Writer
Calculation Guru

ONLINE

Calculation Guru

I have done dissertations, thesis, reports related to these topics, and I cover all the CHAPTERS accordingly and provide proper updates on the project.

$31 Chat With Writer
ECFX Market

ONLINE

ECFX Market

I am a professional and experienced writer and I have written research reports, proposals, essays, thesis and dissertations on a variety of topics.

$49 Chat With Writer
A Grade Exams

ONLINE

A Grade Exams

I have read your project description carefully and you will get plagiarism free writing according to your requirements. Thank You

$35 Chat With Writer

Let our expert academic writers to help you in achieving a+ grades in your homework, assignment, quiz or exam.

Similar Homework Questions

Why does the cyclic form of glucose exist in solutions - Aero dynamik consult gmbh - 12a irma grove pascoe vale - Legal underpinnings of business law - Hangman game code in assembly language - Business objects 4.2 publication guide - Ikea strategic management case study - Juniper m10i end of life - Identify the factors of production - Easy rider death scene - Context free grammar odd length - Thomas v bpe solicitors - Farmyard nurseries voucher code - 3 page review for blockchain - Social Work DQ - Contemporary hero’s quest presentation - Shadow health focused exam abdominal pain - Part 2 - Christopher pettiet cause of death - Gcu doctoral dna - Refutation in letter from birmingham jail - Hartford research issues bonds dated january 1 2015 - Dog stud fees canada - Brigance test score interpretation - Stat hw due in 10 hours - Qub ac uk qol - Of human interaction joseph luft pdf - What are multivariate tests in spss - Michelin fleet solutions case study answers - 39.50 dollars in pounds - Journal of applied physiology endnote style - EDU651 Assignment 1 week 5 social networking a letter of request - Assignment - Reflect and respond penn foster - English-Major Writing Assignment - Essay #3 - Discussion Boards - University of phoenix college algebra - Medieval social system crossword - Professional services strategy ppt - Peyton approved trial balance 2018 - Nurs 6541 exam - Discussion question - Healthcare quality book 3rd edition pdf - How to prepare a statement of retained earnings - Psychology - American standard freedom 90 flash codes - Two significant figures meaning - Speed up vista free - Strong campbell interest inventory test - F scott fitzgerald biography quiz - By the waters of babylon characters - Free your mind and the rest will follow quote - Organizing the elements answer key - A first course in linear algebra by k kuttler - Transportation Management - The thrill of the grass sparknotes - Tourism and colonial imagery - Comp2 - Inner london boroughs map - 600 words 6 hrs I will provide reading stuff don’t search online for anything as references - Week 4 Discussion - Discussion - DISCUSSION POST T4:DQ2 - The red badge of courage and camouflaging the chimera - Operating System Project 2 - Map of university of california campuses - Bupa medical certificate form - Sexual harrassement - Module 1=250 words - Cisco finesse not ready reason codes - Into the wild chapter 17 summary - CASE STUDY - REGRESSION MODEL - Cate bandel nina leonard - Pediatric - Unit 2 DB Staffing, Budgets and Audits - Supply Chain management - Discussion Question - Kim Woods only - 8.10 unit assessment the great gatsby k12 - A fall in labor costs will cause aggregate - Rb 61 ii bookshelf speakers - PowerPoint on the Pacific Culture  - Melting ice physical or chemical - Who was involved in the boston busing - Ati leadership remediation - Major Essay: - Suzuki swift manufacturing country - Bingo connection columbus ohio - Questions - Robe to mount gambier - Normal quantile plot excel - Guide to computer forensics and investigations bill nelson pdf - Decision support system for restaurants - Michael jordan and the new global capitalism sparknotes - Fertilizer spreader calibration formula - What does cate often call her twin sister math worksheet - Dynisco pressure transducer manual - Facts about ionic compounds - Adversity and Depression Treatment Disparities - All wales medicines strategy group