2. How you can use a stack to efficiently check if a String of length n is a palindrome? What is the time complexity of your algorithm? Complete the Java method below. Make use of all variables - stack, i, length, and mid. /** * Returns whether or not String s is a palindrome. An empty string is considered * to be a palindrome. String s is guaranteed to not be null. * @param s the String to check * @return true if String s is a palindrome; false otherwise */ public static boolean is Palindrome (String s) { Stack stack = new Stack<>(); int i = 0, length = s.length(), mid= length/2;

2. How you can use a stack to efficiently check if a String of length n is a palindrome? What is the time complexity of your algorithm? Complete the Java method below. Make use of all variables - stack, i, length, and mid. /** * Returns whether or not String s is a palindrome. An empty string is considered * to be a palindrome. String s is guaranteed to not be null. * @param s the String to check * @return true if String s is a palindrome; false otherwise */ public static boolean is Palindrome (String s) { Stack stack = new Stack<>(); int i = 0, length = s.length(), mid= length/2;

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Complete Through this method /** * Count the number of occurrences of substrings "baba" or "mama" * in the input string recursively. They may overlap. * For example, countBabaMama("aba babaa amama ma") → 2, * and countBabaMama("bababamamama") → 4. * @param input is the input string. * @return the number of occurrences. */public static int countBabaMama(String input) { // base case // recursive step }
Use an array and two index variables. Write functions or methods push, pop, and sizeof. Then write a main function or method that will allocate the stack at n=10 and push some strings in ii, print out the size, and then pop some strings from it. Note make stack be be able to hold string variable type. java
If New character set is given, it is "qwertyuiopasdfghjklzxcvbnm."The first character is q, and we will place the letter "a" (for position) at index q during hashing, i.e. (17th).Our new character set after hashing is "kxvmcnophqrszyijadlegwbuft."write a java program to achieve the same for any given string.
Public class Utilities { getDigits Method: public static java.lang.String getDigits(java.lang.String str) Returns a string with the digits (if any) present in the str parameter. You can assume str will never be null. You can use Character.isDigit() to determine whether a character is a digit. You may not use an auxiliary method in order to implement this method. Your implementation must be recursive and you may not use any loop construct. From the String class, the only methods you can use are length(), isEmpty(), charAt() and substring. Do not use ++ or -- in any recursive call argument. It may lead to an infinite recursion. For example, use index + 1, instead of index++. Parameters: str - Returns: String with digits or empty string
Do not use static variables to implement recursive methods. USING JAVA: // P6 public static int countSubstrings(String s1, String s2) { } Write a recursive method countSubstrings that counts the number of non-overlapping occurrences of a string s2 in a string s1. Use the method indexOf() from String class. As an example, with s1=”abab” and s2=”ab”, countSubstrings returns 2. With s1=”aaabbaa” and s2=”aa”, countSubstrings returns 2. With s1=”aabbaa” and s2=”AA”, countSubStrings returns 0. Show the output on the following strings: s1 = “Java is a programming language originally developed by James Gosling at Sun Microsystems and released in 1995 as a core component of Sun Microsystems Java platform. The language derives much of its syntax from C and C++ but has a simpler object model and fewer low-level facilities. Java applications are typically compiled to bytecode (class file) that can run on any Java Virtual Machine (JVM) regardless of computer architecture.…
Use for loop in Java language Write the method stringSplosion().* * The method takes one parameter, a non-empty String str (such as "Code") and* returns a String in the form "CCoCodCode". Notice that this includes the* first character of the original String, followed by the first two characters,* and so on until the whole String is used.* * Examples: stringSplosion("Code") returns "CCoCodCode" stringSplosion("abc")* returns "aababc" stringSplosion("x") returns "x"* * @param str the input String to process.* @return a new String as described above.
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.
Write Java statements that finds the index of the minimum number in an ArrayList of doubles.Do not write whole program, write only the statements to perform the task described above. with java
Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] ================================================ import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum = findMinimum(numbers);System.out.println("Minimum: " + minimum);}public static int…
Use any loops in Java Language Write the method named withoutString().** Given two strings, base and remove, return a* version of the base string where all instances* of the remove string have been removed (not case* sensitive). You may assume that the remove* string is length 1 or more. Remove only non-overlapping* instances, so with "xxx" removing "xx" leaves "x".** Note: Despite the term "remove" you should actually not* try to remove the characters from a string. You'll continue* to use the "building a string" pattern from lecture.** Examples:* withoutString("Hello there", "llo") returns "He there"* withoutString("Hello there", "e") returns "Hllo thr"* withoutString("Hello there", "x") returns "Hello there"** @param base the base String to modify.* @param remove the substring to remove.* @return the base String with all copies of remove removed.*/// TODO - Write the withoutString method here /*** Write the method named sameEnds().** Given a string, return the longest substring*…
Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] Hint:The trick is to remove the last element each time to make the ArrayList a little shorter. import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum =…
Artificial Intelligence- Java program Write code that accomplishes the following tasks. Consider two bags that can hold strings. One bag is named letters and contain seeral one-letter strings. The other bag is empty and is namedvowels. One at a time removed a string from letters. If the string contain a vowel place it into bag vowels, otherwise, discard the string. After you have checked all of the strings in letters, report the number of vowels and the number of times each voewl appears in the bag.