Write a GUI program to convert all lowercase letters in a string to uppercase letters, and vice versa.
For example, Alb34eRt will be converted to aLB34ErT.
Write a GUI program to convert all lowercase letters in a string to uppercase letters, and vice versa. For example, Alb34eRt will be converted to aLB34ErT.
View Replies View RelatedI have made a program, where the user types in a letter M, C or I to identify their major, if the user types m, c or i, my code does not work.
How could I make my program ignore if the letter is upercase or lowercase? My code is posted below. Can I do this in any easier way then adding this type of code for each lowercase letter?:
Java Code:
if (s.charAt(0) == 'm')
System.out.print("Mathematics "); mh_sh_highlight_all('java');
My current code:
import java.util.Scanner;
public class c4e18 {
public static void main(String[]args){
Scanner input = new Scanner(System.in);
System.out.print("Enter two characters: ");
String s = input.nextLine();
if (s.charAt(0) == 'M')
[Code] .....
I am trying to sort out all lower case letters out of my text file into a new file. I am not very good with char values. My text file that is being read says
AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz.
I just need it to write out all the lower case. The code below is what I have to read and write the file.
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;
public class Lower {
Scanner in=new Scanner(System.in);
FileWriter filw;
String fr;
[Code] .....
Write a program that reads in a line of text and then outputs that line of text first in all uppercase letters and then in all lowercase letters.
INPUT and PROMPTS. The program prompts for a line of text as follows: "Enter the text: " and then reads in an entire line of text as a String .
OUTPUT . There are four lines of output . The first line is "The text in all upper case is: ". The second line is the line that was read in, displayed in all uppercase. The third line is "The text in all lower case is: " and the fourth line is the original line that was read in, displayed in all lowercase.
CLASS NAMES. Your program class should be called ShoutAndWhisper.
This is what I have so far:
import java.util.Scanner;
public class ShoutAndWhisper
{
public static void main(String[] args)
{
Scanner scannerObject = new Scanner (System.in);
System.out.println("Enter the text: ");
scannerObject.next();
System.out.println("The text in all upper case is: ");
for example if the given string is: The world is running java technology?
Ans:
T is =2
h is=2
e is=2
w is=1
n= 4
like wise i need out put of the program?
I have to validate a string whether it is a combination lowercase and uppercase and has the character '_'.
I m having trouble in framing the expression for these conditions in the matches function.
How it can be done..?? How to frame a the correct expression.
I'm trying to create a private method called capitalize() which takes String nameModel in any uppercase/lowercase combination and returns it with the first letter uppercased and all other lowercased. E.g. "stePHeN" returns "Stephen" . This is what I've written so far:
private String makePrettyString(String modelName) {
if (modelName ==null) {
return null;
}else if (modelName =="") {
return "";
} else{
return modelName.substring(0,1).toUpperCase() + modelName.substring(1).toLowerCase();
}
}
Unfortunately it doesn't work and it still returning me the String modelName in its original uppercase/lowercase combination.
I am trying to reverse a string. Here is my code:
import java.util.*;
public class ReverseLettersInString {
public static void main (String[] args){
Scanner in = new Scanner (System.in);
String s;
[Code] .....
PROGRAM OUTPUT:
Enter string
me
e
The program returns e instead of em
How can I write a method that takes a string with duplicates letters and returns the same string which does not contain duplicates. For example, if you pass it radar, it will return rad. Also i would like to know how can I Write a method that takes as parameters the secret word and the good guesses and returns a string that is the secretword but has dashes in the places where the player has not yet guessed that letter. For example, if the secret word is radar and the player has already guessed the good guesses letters r and d, the method will return r-d-r.
View Replies View Related I want to make a method that takes a word and then checks if the word can be created from available letters. For example, if a word "johnson" can be created by using letters "jashoqwnon".
Now my goal is to make sure that if available letters contain a letter from the word, that letter is put into a String called result and then erased from the list of given letters. So, "johnson" and "jashoqwn" would produce the result "johns" and leave "aqw" unused.
Now the problem that I am facing is that I can't get Java not to use the same letter twice. So "johnson" and "jashoqwn" still gives "johnson".
I've tried everything in my power but I am missing something. Here is my code.
public static String makeAWord(String word, String letters){
String result = "";
for(int i = 0; i < word.length(); i++){
for(int j = 0; j < letters.length() ; j++){
[Code] ....
How to do this editing the last 3 letters of a string that i retrieve from database.. I have a string "111-222-333-000" here's the sample what i want to happen was to edit the last 3 letters of the string ,,
i insert into database "111-222-333-000" then i retrieve it for editing but what i want to happen is when i retrieve it what i can only edit was the last 3 strings only
I started using Java a couple of days ago, If you haven't guessed I want to see if the user is typing a full name or not, but I'm actually not too concerned with any more complexity than I mentioned in the title. It's ok if an input like "GLba b" comes out positive.
View Replies View RelatedHere is the problem:
Start with the tree.java program (Listing 8.1) and modify it to create a binary tree from a string of letters (like A, B, and so on) entered by the user. Each letter will be displayed in its own node. Construct the tree so that all the nodes that contain letters are leaves. Parent nodes can contain some non-letter symbol like +. Make sure that every parent node has exactly two children. Don’t worry if the tree is unbalanced. Note that this will not be a search tree; there’s no quick way to find a given node. You may end up with something like this:
It also says all Letters must be Leaves
Now I had it almost similar to that picture, but it wasn't right. So ive been working on it but im getting some very strange (and frustrating) output from the following methods.
Ive included the display method just for reference. The book told me to use it so I haven't edited it. I believe my main issue is with my (incomplete) insert() method. The output goes into an infinite loop despite having a return statement break the while loop when a character is inserted.
The way I see to solve the problem is just add a (+) whenever a new subtree needs to be created. Say I add A and B, then it first creates a subtree at the root with a (+) and afterwards lists A and B as its leaves. If I insert a C, it should be able to simply move to the right child of the root and deposit the C there.
package pkg4333_hwk1;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
class Main {
[Code] ....
Write a method named secondHalfLetters that accepts a string as its parameter and returns an integer representing how many of letters in the string come from the second half of the alphabet (that is, have values of 'n' through 'z' inclusive). Compare case-insensitively, such that uppercase values of 'N' through 'Z' also count. For example, the call secondHalfLetters("ruminates") should return 5 because the 'r', 'u', 'n', 't', and 's' come from the second half of the alphabet. You may assume that every character in the string is a letter.
View Replies View RelatedI'm trying to convert the first letter of every word in a String to uppercase. I've managed to isolate the first letter of every word and then make it uppercase but I don't know how to replace it.
public static StringBuffer makeUpperCase(){
String str = String.valueOf(input2);
for(int i = 0; i < str.length(); i++){
if(str.charAt(i) == ' '){
char var = str.charAt(i + 1);
var = Character.toUpperCase(var);
System.out.println(var);
}
}
String sql = "SELECT * FROM user WHERE username =? and password =?" ;
pst = conn.prepareStatement(sql);
pst.setString(1, username.getText());
pst.setString(2, password.getText());
rs = pst.executeQuery();
if(rs.next()){
do somethig;
{
I have 2 textfield that take username and password, on the database thete is a user table
id username password name surname
1 test test test test
people put username and password to the textfield like test test and they logon,but when they write username = TESt and password = teST they can logon too,there is no TESt user on the database or teST password, is the textfield making lowercase all text. or pst.setString(1, username.getText()); is this code changing the text?
What my program needs to do:
1) accepts a filename from the user that indicates the input file
2)obtains a filename to use as the output file
3)the program then reads the file and reports how many of each letter are there in the file.
4)if the file could not be opened, you must ask the user for valid file name until one is given
5)once a valid file name is given, print all of contents and store the analysis of the file in the output file name specified
You will be reading the input from a file and printing the output to another file. For example, if the file input.txt contains:
This file contains lett3rs.
YoU counT Only lEtTers, not numb3rs.
How many h's are in "Ohhhhhhhhhhh no!"?
The program should ignore white spaces, new lines and other special characters or numbers. It should count only the letters (a-z and/or A-Z) in the input file.
An example execution might look like this:
Input a file name: notAFile.txt
Invalid filename given. Input another.
Input a file name: alsoNotAFile.txt
Invalid filename given. Input another.
Input a file name: input.txt
[Code] ....
1)The last try/catch block was given by my professor, however the only thing it does is print out "hello java" into an out file. How would I make it print out similar to that of the given example?
2)I figured out how to make the array print out ABCDEFG... etc...how to count the amount of them.
I am trying to write a program and the name variable can only store letters,dotes and spaces. But whenever I enter a space, the program doesn't work. Following is my code.
import java.util.Scanner;
import java.util.*;
public class Space {
public static void main(String []args) {
Scanner reader = new Scanner(System.in);
[Code] ....
I can't figure out why my code doesn't work. My task is to replace for example ä=>ae, using this method String.charAt(int index). So here is my code:
public class pich {
public static void main(String[] args) {
String text = "Die süße Hündin Leica läuft in die Höhle des fülligen Bären "+
"Iliyan (ein Übergrößenträger), der sie zum Teekränzchen eingeladen hat."+
" An ihrem Öhrchen trägt sie modisch eine Ähre.";
String textOhneUmlaute = "";
[Code] ....
when I launch my code I get the same String and nothing has changed
I can sort strings in a collection by uppercase and then lowercase though I was wondering if there is any way of doing it in reverse, sorting by lowercase then by uppercase.
View Replies View RelatedHow to write a code that allows the computer to read a number from the keyboard, from 0-26 and print out that much of the alphabet
*For example
input = 3 output = ABC
input = 7 output = ABCDEFG
input = 0 output =
I tried this but it only gives me one letter that corresponds to the number
package pkg2911homework.pkg1;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner keys = new Scanner(System.in);
[Code] ....
While using generics, are there cases when ? wildcard cannot be replaced with letters [A-Z]? So far , I was able to find only one case, it is when you want to have field pointing on generic instance without making class generic.
class OneClass {
private LinkedList<?> myLL;
}
In case above, as I understand, you cannot use [A-Z] without generalize OneClass. Are there any other cases, when there is no way except to use ? wildcard instead of letter [A-Z]?
I have devised a simple program that reads a file and then adds up al the integers in the file and print the result, for example if the file had the numbers
1 2 3 4 5 6 7 8 9 10
then the program would print 55
However i have trouble when non integers are put into the file for example if it was
1 2 3 string 4 5 6 test 7 8 9 10
then i get:
Exception in thread "main" java.util.InputMismatchException
at java.util.Scanner.throwFor(Scanner.java:840)
at java.util.Scanner.next(Scanner.java:1461)
at java.util.Scanner.nextInt(Scanner.java:2091)
at java.util.Scanner.nextInt(Scanner.java:2050)
at Week7.Task3.filereader(Task3.java:25)
at Week7.Task3.main(Task3.java:14)
my code is as follows
package testing;
import java.util.*;
import java.io.File;
import java.io.IOException;
public class summingInts {
public static void main(String[] args)
throws IOException {
Scanner textfile = new Scanner(new File("intSum.txt"));
[code]....
My professor is a man who enjoys making his students form large, but often simple symbols with smaller letters. That might not have clarified much, so let me demonstrate:
VVVVVVV
VVVVV
VVV
V
Or...
X X
X X
X
X X
X X
Or lastly...
O
O O
O O
O O
O
My problem is, that I've always been bad at figuring out the logic behind these.
I can kinda' see it (somewhat) in my head though... I'd need a double for-loop which depend on the sizes, one that monitors the spaces and one that monitors the symbols, with some conditionals in there. How to make symbols like this, using letters, in Java.
I had to write a program for class using the method definition "public static char getNumber(char upperCaseLetter)" It compiles and runs but wont print out my final answer.
import java.util.Scanner;
public class Phone_0104730303 {
public static char getNumber(char upperCaseLetter)
{
char return_val = 0;
[Code].....