Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
132 views

Java Strings: Wikipedia: String (Computer Science)

This document discusses Java Strings. It provides an example of declaring a String variable and explains that Strings are made up of characters. It describes how to get the length of a String using the length() method. It then provides a problem to test understanding of Strings - given two input Strings, the task is to 1) sum their lengths, 2) determine if one is lexicographically larger than the other, and 3) capitalize the first letter of each and print them separated by a space. Sample input and output is also provided.

Uploaded by

Wael Abdulal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
132 views

Java Strings: Wikipedia: String (Computer Science)

This document discusses Java Strings. It provides an example of declaring a String variable and explains that Strings are made up of characters. It describes how to get the length of a String using the length() method. It then provides a problem to test understanding of Strings - given two input Strings, the task is to 1) sum their lengths, 2) determine if one is lexicographically larger than the other, and 3) capitalize the first letter of each and print them separated by a space. Sample input and output is also provided.

Uploaded by

Wael Abdulal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Java Strings

Introduction
"A string is traditionally a sequence of characters, either as a literal constant or as some kind of variable."
— Wikipedia: String (computer science)

This exercise is to test your understanding of Java Strings. A sample String declaration:

String myString = "Hello World!"

The elements of a String are called characters. The number of characters in a String is called the length,
and it can be retrieved with the String.length() method.

Given two strings of lowercase English letters, and , perform the following operations:

1. Sum the lengths of and .

2. Determine if is lexicographically larger than (i.e.: does come before in the dictionary?).

3. Capitalize the first letter in and and print them on a single line, separated by a space.

Input Format

The first line contains a string . The second line contains another string . The strings are comprised of
only lowercase English letters.

Output Format

There are three lines of output:


For the first line, sum the lengths of and .
For the second line, write Yes if is lexicographically greater than otherwise print No instead.
For the third line, capitalize the first letter in both and and print them on a single line, separated by a
space.

Sample Input 0

hello
java

Sample Output 0

9
No
Hello Java

Explanation 0

String is "hello" and is "java".

has a length of , and has a length of ; the sum of their lengths is .


When sorted alphabetically/lexicographically, "hello" precedes "java"; therefore, is not greater than
and the answer is No .

When you capitalize the first letter of both and and then print them separated by a space, you get
"Hello Java".

You might also like