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

Blued up young drummer boy lyrics

17/11/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:

Best Coursework Help
Write My Coursework
Top Academic Tutor
Professor Smith
Helping Engineer
Engineering Help
Writer Writer Name Offer Chat
Best Coursework Help

ONLINE

Best Coursework Help

I am an elite class writer with more than 6 years of experience as an academic writer. I will provide you the 100 percent original and plagiarism-free content.

$46 Chat With Writer
Write My Coursework

ONLINE

Write My Coursework

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

$34 Chat With Writer
Top Academic Tutor

ONLINE

Top Academic Tutor

I reckon that I can perfectly carry this project for you! I am a research writer and have been writing academic papers, business reports, plans, literature review, reports and others for the past 1 decade.

$44 Chat With Writer
Professor Smith

ONLINE

Professor Smith

I have worked on wide variety of research papers including; Analytical research paper, Argumentative research paper, Interpretative research, experimental research etc.

$20 Chat With Writer
Helping Engineer

ONLINE

Helping Engineer

I will be delighted to work on your project. As an experienced writer, I can provide you top quality, well researched, concise and error-free work within your provided deadline at very reasonable prices.

$23 Chat With Writer
Engineering Help

ONLINE

Engineering Help

Being a Ph.D. in the Business field, I have been doing academic writing for the past 7 years and have a good command over writing research papers, essay, dissertations and all kinds of academic writing and proofreading.

$42 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

Systemverilog assertions examples with answers - Strength based approach teaching - Select and evaluate the usefulness of a range of decision-making tools and reflect on your decision-making styles and contrast with other styles to determine the respective levels of rationality and intuition utilised - Gareth r jones and jennifer m george - Paulo Case Scenario: Independent Living Mini Unit - Hubspot case study solution - What type of innovation does the halo sport represent - Essay - Heating and cooling curves lab answer key - Mcdonald's recently made productivity gains by cutting the - Susan moylan coombs biography - According to your textbook a commemorative speech - Ilag non stick ultimate aldi - What is google's reasoning for collecting your personal information - Elk grove unified school district v newdow case - Montagu the lover a ballad - Case Study (for Dr. Noorfatima) - Accommodation near wilsons promontory national park - Discussion - Myplate daily checklist calculator - The mcgraw hill reader issues across the disciplines pdf download - Manager's pocket guide to emotional intelligence pdf - If the financial markets are efficient then - Metal cutting guillotine safety - Celf observational rating scale - A linear programming model consists of - Application of antilog amplifier - The challenge of multi-core processors - Attitude reflects leadership meaning - Earthwell nourishing arnica shower gel - Riddles on animals and birds - Ite business information system - Traits of effective writing - 1311 hetfield ave scotch plains - Leininger's theory model - Comparative politics domestic responses to global challenges 9th edition - Cedar management consulting dubai - Dr kim bulwinkel orthopaedic surgeon - Casement black diaries extracts - Chakravartin ashoka tamil serial episode 121 - Theory of chronic sorrow in nursing - South east wales centre for teacher education and training - Ucl msc mechanical engineering - Wag the dog 303 - Introduction to management science with spreadsheets bernard w taylor - Research 505 - I have a dream speech questions pdf - The other side is not dumb by sean blanda - Sma inverter warranty document - Semantic feature analysis chart - Flinder street station renovation - Goring and woodcote medical practice - Evolve elsevier com seidel - Difference between categorical and quantitative data - Lf meaning in construction - A bead slides without friction around a loop the loop - Hope centered model of career development - Flowers for algernon movie review - Kindly find enclosed herewith - A to z mysteries detective camp - Assignment emerging threats - Herbivores in the sahara desert - 8ppol - 7 steps of the writing process - Managing customer responsiveness at littlefield technologies - Quiz 3 Chapter 3: Formulating your brief (10 Questions) - Name four of the six functions of water - Whats on millenium centre - Rock paper scissors lizard spock java code - Write a positioning statement for virgin america - Week2 - How to wrap text in lucidchart - Project: Scholar-Practitioner Project: Health Care Administration Leadership Theory - Simnet word project answers - Brave new world best quotes - Michael lo sordo stockists sydney - Telstra byo mobile plans $39 - Apple store design case study - Unit VII Essay - Higher biology course specification - Apple accounting change - Ministry of road transport and highways sarathi - +91 9928097710 jadu tona specialist astrologer in Surat - The snake charmer daily paragraph editing - Muscle origin and insertion - Cdt cutting oil sds - What is carriage in accounting - Dell powerconnect spanning tree best practices - Lowest confidence level on inquizitivelowest confidence level on inquizitive - British library document supply centre inside serials & conference proceedings - The californian's tale by mark twain essay - Single subject design social work - Hygienic practices for food safety - Windows device driver interview questions - Spiceworks bulk delete tickets - King solomon's mines analysis - Egyptian love poetry from the new kingdom - Babylon revisited f scott fitzgerald pdf - How to beat your nafs in islam - Percent acetic acid in vinegar lab