Write a Java program that implements the static method capitalize() which capitalizes the first letter of each word in a sentence.(the code should have the strucrture as in the picture) Solution.java1- import java.util.Scanner;23- public class Solution {4public static void main(String args[]) {// add your code here5-678public static String capitalize(String sentence){// add your code here10111213

The first letter will be converted to uppercase and then the remaining are checked and converted if…

Answered: Write a Java program that implements…

Write a Java program that implements the static method capitalize() which capitalizes the first letter of each word in a sentence.

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

See ERROR in Java file 2: Java file 1: import java.util.Random;import java.util.Scanner; public class Account {// Declare the variablesprivate String customerName;private String accountNumber;private double balance;private int type;private static int numObjects;// constructorpublic Account(String customerName, double balance, int type) { this.customerName = customerName;this.balance = balance;this.type = type;setaccountNumber(); // set account number functionnumObjects += 1;}private void setaccountNumber() // definition of set account number{Random rand = new Random();accountNumber = customerName.substring(0, 3).toUpperCase();accountNumber += type;accountNumber += "#";accountNumber += (rand.nextInt(100) + 100);}// function to makedepositvoid makeDeposit(double amount){if (amount > 0){balance += amount;}}// function for withdrawboolean makeWithdrawal(double amount) {if (amount < balance)balance -= amount;elsereturn false;return true;}public String toString(){return accountNumber +…
Write an application that displays the strings in the provided array alphabetically in ascending order import java.util.*; public class StringSort { public static void main(String[] args) { String[] values = {"mouse", "dog", "cat", "horse", "cow", "moose", "tiger", "lion", "elephant", "bird", "hamster", "guinea pig", "leopard", "aardvark", "hummingbird"}; } } I need help with this!
import java.util.Scanner; public class Inventory { public static void main (String[] args) { Scanner scnr = new Scanner(System.in); InventoryNode headNode; InventoryNode currNode; InventoryNode lastNode; String item; int numberOfItems; int i; // Front of nodes list headNode = new InventoryNode(); lastNode = headNode; int input = scnr.nextInt(); for(i = 0; i < input; i++ ) { item = scnr.next(); numberOfItems = scnr.nextInt(); currNode = new InventoryNode(item, numberOfItems); currNode.insertAtFront(headNode, currNode); lastNode = currNode; } // Print linked list currNode = headNode.getNext(); while (currNode != null) { currNode.printNodeData(); currNode…
Java Programming Problem: Write a generic isEqualTo that compares its two arguments/paramaters with the equals method and return true if the two are equals and false if not equal. Note: Please fix the code below where it will return true if the two are equals and false if not equal. import java.util.*; public class IsEqualTo { public static boolean isEqual(String str1, String str2){ return str1.equals(str2); } public static void main(String[] args) { Scanner scan = new Scanner(System.in); String str1 = scan.next(); String str2 = scan.next(); if(isEqual(str1, str2)){ System.out.println("String is equal"); } else { System.out.println("String is not equal"); } } }
Create Java statements based on the following requirements: 1. Create an empty hash map named programs that will handle keys and values that are both of String type. 2. Map the following pairs: • BSIT – Bachelor of Science in Information Technology • BSCS – Bachelor of Science in Computer Science • BSIS – Bachelor of Science in Information Systems 3. Display the keys in a single line. 4. Delete the first entry. 5. Check whether the map contains the key "BSCpE".
Ex. If the input is: 4 plates 100 spoons 200 cups 150 forks 200 the output is: 200 forks 150 cups 200 spoons 100 plates Inventory.java import java.util.Scanner; public class Inventory {public static void main (String[] args) {Scanner scnr = new Scanner(System.in);InventoryNode headNode;InventoryNode currNode;InventoryNode lastNode; String item;int numberOfItems;int i; // Front of nodes listheadNode = new InventoryNode();lastNode = headNode; int input = scnr.nextInt(); for(i = 0; i < input; i++ ) {item = scnr.next();numberOfItems = scnr.nextInt();currNode = new InventoryNode(item, numberOfItems);currNode.insertAtFront(headNode, currNode);lastNode = currNode;} // Print linked listcurrNode = headNode.getNext();while (currNode != null) {currNode.printNodeData();currNode = currNode.getNext();}}} InventoryNode.java public class InventoryNode {private String item;private int numberOfItems;private InventoryNode nextNodeRef; // Reference to the next node public InventoryNode()…
Fix the code below so that there is a function that calculate the height of the triangle. package recursion; import javax.swing.*;import java.awt.*; /** * Draw a Sierpinski Triangle of a given order on a JPanel. * * */public class SierpinskiPanel extends JPanel { private static final int WIDTH = 810; private static final int HEIGHT = 830; private int order; /** * Construct a new SierpinskiPanel. */ public SierpinskiPanel(int order) { this.order = order; this.setMinimumSize(new Dimension(WIDTH, HEIGHT)); this.setMaximumSize(new Dimension(WIDTH, HEIGHT)); this.setPreferredSize(new Dimension(WIDTH, HEIGHT)); } public static double height(double size) { double h = (size * Math.sqrt(3)) / 2.0; return h; } /** * Draw an inverted triangle at the specified location on this JPanel. * * @param x the x coordinate of the upper left corner of the triangle * @param y the y…
Rewrite the private static int recurseMax method without using Java API public class Recursion{ public static void main(String[] args){ // My tests (DO NOT MODIFY!) int[] a = {3,2,6,4,15,7,9,8,6}; p(recurseSum(a)); // Sum should be 60 p(recurseMax(a)); // Max should be 15 // End of tests! } // Recursive methods below here... public static int recurseSum(int[] a){ // TODO: This is the wrapper method. You must complete this AND implement helper method int total = recurseSum(a, a.length); return total; } private static int recurseSum(int[] a, int i){ if (i <= 0) return 0; return (recurseSum(a, i - 1) + a[i - 1]); } public static int recurseMax(int[] a){ int max = recurseMax(a, a.length); return max; } private static int recurseMax(int[] a, int i){ if(i == 1) return a[0]; return Math.max(a[i-1], recurseMax(a, i-1)); } //…
complete TODO's using java: -Main- package edu.luc.cs271.wordcount; import java.util.*; public class Main { public static void main(final String[] args) throws InterruptedException { // set up the scanner so that it separates words based on space and punctuation final Scanner input = new Scanner(System.in).useDelimiter("[^\\p{Alnum}]+"); // TODO complete this main program // 0. create suitable map instance // 1. create a WordCounter instance // 2. use this to count the words in the input // 3. determine the size of the resulting map // 4. create an ArrayList of that size and // 5. store the map's entries in it (these are of type Map.Entry<String, Integer>) // 6. sort the ArrayList in descending order by count // using Collections.sort and an instance of the provided comparator (after fixing the latter) // 7. print the (up to) ten most frequent words in the text }} -DescendingByCount- package edu.luc.cs271.wordcount; import…
sortsearchassigncodeex1.java sort, search for a specific student package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 { // public static void fillArray(Scanner inputFile, int[] arrIn){ int indx = 0; //Complete code { arrIn[indx] = inputFile.nextInt(); indx++; } } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static void displayArray(int[] arrIn){ for(int indx=0; indx<arrIn.length;indx++) System.out.printf("student %2d sID: %5d\n",(indx+1),arrIn[indx]); } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static int searchArray(int[] arrIn, int sValue){ int retValue = -1; // if the value is not found method will return -1 for(int indx=0; //Complete code ;indx++) if(arrIn[indx] == sValue) retValue = indx; return retValue; }…
JAVA public interface Interf1 { public void repeat(String s1); } Implement the above interface using lambda to accept hello world and print ten times and implement the above interface using inner class to accept hello world and print ten times
Write an application that displays the strings in the provided array alphabetically in ascending order. import java.util.*; public class StringSort { publicstaticvoidmain(String[] args) { String[] values = {"mouse","dog","cat","horse","cow", "moose","tiger","lion","elephant","bird","hamster", "guinea pig","leopard","aardvark","hummingbird"}; }