All categories

3 years ago

Write a Console Java program that asks the user to enter one sentence on the keyboard. Output on the console:

Computers and Technology

1 answer:

Nady [450]3 years ago

6 0

Answer:

Here is the JAVA program:

import java.util.Scanner; //to accept input from user

public class Main{ //class name

public static void main(String[] args){ //start of main function

String sentence; //to store the input sentence

int i, length; //declare variables

int count[] = new int[256]; //creates a counter array

Scanner input = new Scanner(System.in); //creates Scanner class object to accept input from user

System.out.println("Enter a sentence: "); //prompts user to enter a sentence

sentence = input.nextLine(); //scans and reads the entire sentence string from user

String[] words = sentence.split("\\s+"); //splits the sentence into an array with separator as one or more white spaces and stores this array in words

System.out.println("Number of words: " + words.length); //display the number of words in sentence by using length which returns the length of the words array

sentence = sentence.toLowerCase(); // converts the sentence into lower case to ignore case sensitivity

sentence = sentence.replaceAll("\\s+",""); //removes the empty spaces from sentence

length = sentence.length(); //stores the length of the sentence string into length variable

for (i = 0; i < length; i++) { //iterates through the length of the sentence

count[(int) sentence.charAt(i)]++; } //counts occurrence of each alphabet in the sentence and stores it in count array

for (i = 0; i < 256; i++) { displays occurrence of alphabet in sentence

if (count[i] != 0) { //if count array is not empty

System.out.println((char) i + "-" + count[i]); }}}}

//prints each alphabet and its count

Explanation:

The program prompts the user to enter a sentence. Suppose the user enters "We won" so

sentence = "We won"

Now this sentence splits into an array with white space as separator and stored in words array. So words array has two words of sentence now i.e. "We" and "won"

Next words.length is used to return the length of words array. So length of words array is 2 hence

number of words = 2

Next the sentence is converted to lower case and spaces are removes so sentence becomes:

wewon

sentence.length() returns the length of sentence which is 5.

Next the for loop is used. At each iteration of this loop occurrence each character of sentence is added to the count[] array. charAt() is used to return a character at each index position of string. So the frequency of every character is counted and stored in count array.

Next is a for loop that is used to display each alphabet in the sentence along with its frequency in alphabetic order.

Hence the entire program gives the output:

Number of words: 2 e-1 n-1 o-1 w-2

The screenshot of the output of example given in the question is attached.

You might be interested in

Let's implement a classic algorithm: binary search on an array. Implement a class named BinarySearcher that provides one static

yKpoI14uk [10]

Answer:

Hope this helped you, and if it did , do consider giving brainliest.

Explanation:

import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

}import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

7 0

2 years ago

How do you take a picture with this app

Troyanec [42]

You have to be answering someone and to the left of the answer button there will be a camera. Click it and you can take a picture.

7 0

3 years ago

Read 2 more answers

What does the dashed line in the beaker separating the two sides represent?______________________?

kodGreya [7K]

I guess the correct answer is A membrane

A mеmbranе is a sеlеctivе barriеr; it allοws sοmе things tο pass thrοugh but stοps οthеrs. Such things may bе mοlеculеs, iοns, οr οthеr small particlеs.

7 0

3 years ago

Read 2 more answers

A company that connects through your communications line to its server, which connects you to the Internet, is a(n)

hammer [34]

Internet server provider

4 0

3 years ago

In a PowerPoint presentation, it is not possible to add notes that are hidden from the audience's view.

kvasek [131]

it actually is false i just checked

7 0

3 years ago