Can you help with these inputs please Input WYour output endswithThis is a test.Expected outputends withw qNumber of wordsFind textefrSChoose an option:Number of words:46MENUWfrSсReplace all !'sShorten spacesQuiteChoose an option:WNumber of words: 4fMENUrNumber of non-whitespace charactersNumber of wordsFind textSReplace all !'sShorten spaces- Quit-Number of non-whitespace charactersNumber of wordsFind textReplace all !'sShorten spacesQuitChoose an option: InputYour output endswithI want some water. I had some water earlier, but now he has some water.fsome waterEnter a word or phrase to be found:some" instances: 3MENUCWfrSorNumber of non-whitespace charactersNumber of wordsFind texteChoose an option:Number of words: 415Replace all !'sShorten spacesQuiteMENUс Number of non-whitespace charactersNumber of wordsFind textWfrReplace all !'sS Shorten spacesq - QuitChoose an option:MENUEnter a word or phrase to be found:"some water" instances: 3сNumber of non-whitespace characters

In the given code there are some mistakes in executeMenu() method, findText() method and…

Input Your output ends with Expected output ends with This is a test. W q Number of words Find text Replace all !'se Shorten spaces f r s q- Quite Choose an option: Number of words:46 MENU c - Number of non-whitespace characters w Number of words f Find text. r Replace all !'s s Shorten spaces q - Quit Choose an option: Number of words: 4 MENU c w f Number of non-whitespace characters Number of words. Find text Replace all 's Shorten spaces. r s q - Quit Choose an option:

Input Your output ends with Expected output ends with This is a test. W q Number of words Find text Replace all !'se Shorten spaces f r s q- Quite Choose an option: Number of words:46 MENU c - Number of non-whitespace characters w Number of words f Find text. r Replace all !'s s Shorten spaces q - Quit Choose an option: Number of words: 4 MENU c w f Number of non-whitespace characters Number of words. Find text Replace all 's Shorten spaces. r s q - Quit Choose an option:

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

slides can * have title, text, graphs O drawn objects, shapes clipart , drawn art, visual any of the above O
Lab Task 04: Include the methods in the file KMP_Implementation.txt in a complete Java program that prompts for and reads a text string and then a text pattern to search for in the text. It then displays the result of the search. Sample program runs: Enter the text: ABABСАВАВАВСАВАВСАВАВСАВАВКККАВАВСАВАВ Enter the pattern to search for: ABABCABAB Pattern found at these text starting indexes: 0 Enter the text: A KFUPM STUDENT Enter the pattern to search for: KFE Pattern not in text. 7 12 17 29
2. Write a class ArrayClass, where the main method asks the user to enter the four num bers. Create a method printArray that prints the array whenever required (use Acrav.toString method). Make the program run as shown in the Sample Run below. Green is user input. Use Attax.sort, Attach.bianrySearch. Attaveauals Sample Run List1, Enter four num bers: 2 33 2 List2, Enter four num bers: 6 25 4 List3, Enter four num bers: 52 46 Your original Listi: [2, 3, 3, 2] Your original List2: [6, 2, 5, 4] Your original List3: [5, 2, 4, 6] Sorted Listi is: [2, 2, 3, 3] Enter a number from the sorted List1 to search for: 3 Value 3 is in index 2 (or position 3) List that are the same when sorted: [2, 4, 5, 6]
Java program You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a `map' of all the underground resources in the mine. This map comes as a file. The file has n rows. Each row has n space-separated integers. Each integer is between zero and one hundred (inclusive). The file should be understood to represent a grid, n wide by n deep. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and n. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit the second row,…
Rename the show method to people Override the show method in student and in the other class you created (this will be the polymorphic method) In main program, create an array of 3 objects of class people Instantiate each array position with a different object (people, student, other) With a loop, display all the objects in the array.
Given numRows and numColumns, print a list of all seats in a theater. Rows are numbered, columns lettered, as in 1A or 3E. Print a space after each seat, including after the last. Use separate print statements to print the row and column. Ex: numRows = 2 and numColumns = 3 prints:1A 1B 1C 2A 2B 2C import java.util.Scanner;public class NestedLoops {public static void main (String [] args) {Scanner scnr = new Scanner(System.in);int numRows;int numColumns;int currentRow;int currentColumn;char currentColumnLetter; numRows = scnr.nextInt();numColumns = scnr.nextInt(); /* Your solution goes here */ System.out.println("");
Load your bag with some initial values, but do not fill it. Your client code should give the user the option to: display the contents of the bag using the class method “toVector” add values to the bag remove values from the bag sort the bag search for a value using their choice of either the iterative search or the recursive search - both need to be tested Allow the user to keep doing these things until they are done. Do not automatically sort the bag if the user chooses to search. Your program should give the user a message telling them they must first sort the bag before they can search.You decide what the user interface will be. Make it clear and easy to use. It can be very basic; nothing fancy. A menu driven program works well. Each value in your array should be unique - no value will appear in the array multiple times. Your array elements can be any data type – use a template class put in place in the code provided. You can write your client code to process a bag holding any…
Java !! OverviewIn this task, you should start from the images GuessTheNumber.java output. The purpose is i.a. to learn how to use different control flow constructions and how we create random numbers within certain intervals by using the Math class.TaskBased on the images GuessTheNumber output and extend its functionality as below:• The program should ask the user within which interval the random numbers should be. I.e. the program should ask for the minimum value and the maximum value the random number can be between (inclusive). It is ok to assume that no negative numbers are used and that the user first writes the lowest and then the highest.• If the user guesses a number that is outside the range, the program will print the valid range.• If the user guesses incorrectly, but within the range, the program should print if the guessed value is higher or lower than the hidden number.• If the user guesses correctly, the program should print out how many guesses were required.• If the…
IN JAVA Create a function that takes a string and returns the number of alphanumeric characters that occur more than once. Examples duplicateCount ("abcde") → 0 duplicateCount ("aabbcde") → 2 duplicateCount ("Indivisibilities") → 2 duplicateCount ("Aa") → 0 // Case sensitive
writcapregram.to find the average oleven and the average of 20entered
P1: Name Search. Download the text file names.txt attached below. It contains a list of 65 female first names in upper case letters. In Eclipse, insert this file into your Java project folder. Implement two static methods: • tringSort: It will sort the String array provided as an argument using one of the sorting algorithms presented in class (selection or insertion). • stringSearch: It will search the String array provided as its first argument for the String value provided as its second argument using the binary search algorithm presented in class. The main method reads the 65 names from the file names.txt and inserts each one into an array. This array is then sorted using the stringSort method. The stringSearch method is then used to search for different names inputed by the user.
Define a class called Book. This class should store attributes such as the title, ISBN number, author, edition, publisher, and year of publication. Provide get/set methods in this class to access these attributes. Define a class called Bookshelf, which contains the main method. This class should create a few book objects with distinct names and store them in an ArrayList. This class should then list the names of all books in the ArrayList. Enhance the program by providing a sort function, which will sort the books in ascending order of their year of publication. Create a few more Bookobjects with the same names but with different edition numbers, ISBNs, and years of publication. Add these new Book objects to the ArrayList, and display the book list sorted by book name; for duplicate books of the same name, sort the list by year of publication. (Hint: You will need to define a comparator class that takes two Book objects as parameters of the compareTo This method should do a two-step…