Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

CSc 2720-Data Structures: Lab 4 How to Submit Queue Stack: Please submit your answers in icollege once you have completed Failure to submit will result

image text in transcribed
CSc 2720-Data Structures: Lab 4 How to Submit Queue Stack: Please submit your answers in icollege once you have completed Failure to submit will result in a zero for this lab. Front Back Problem 1: A palindrome is a string of characters that reads the same from left to right as it does from right to left. Write a function called checkPalindrome that takes a string s1 andevaluate ifthe string is a palindrome or not using only a stack and a queue data structures. You should make use of the built-in java implementation of the stack and queue data structure under java.util.Stack and java.util.Queue Example 1: Input: S1 "radar" Output: true Example 2 Input: si "Hit TheRoadJack Output: false -.-Function import java.util.Stack; import java.util.LinkedList; import java.util.Queue; public class Lab4 ( public static void main (String[] args)f String s1 -radar"; boolean ans checkPalindrome (s1); System.out.println(ans); II Should be True public static boolean checkPalindrome (String si) Stack s = new StackO: // Example of stack push // Example of stack pop s-push("r) s-pop // Example of queue enqeue // Example of queue dequeue // Check if stack or queue is empty -addr -poll) s.isEmpty) q.isEmpty() INSERT YOUR CODE HERE

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Design Query Formulation And Administration Using Oracle And PostgreSQL

Authors: Michael Mannino

8th Edition

1948426951, 978-1948426954

More Books

Students also viewed these Databases questions