Output of Java Programs | Set 52 (Strings Class)
Last Updated :
18 Sep, 2018
Prerequisite : Basics of Strings class in java
1. What is the Output Of the following Program
Java
class demo1 {
public static void main(String args[])
{
String str1 = "java";
char arr[] = { 'j', 'a', 'v', 'a', ' ', 'p',
'r', 'o', 'g', 'r', 'a', 'm', 'm', 'i', 'n', 'g' };
String str2 = new String(arr);
System.out.println(str1);
System.out.println(str2);
}
}
Output:
java
java programming
2. What is the Output Of the following Program
Java
class demo2 {
public static void main(String args[])
{
String str1 = "";
char arr[] = { 'j', 'a', 'v', 'a', ' ', 'p',
'r', 'o', 'g', 'r', 'a', 'm', 'm', 'i', 'n', 'g' };
String str2 = new String(arr);
String str3 = new String(str2);
System.out.println(str1);
System.out.println(str2);
System.out.println(str3);
}
}
Output:
java programming
java programming
3. What is the Output Of the following Program
Java
class demo3 {
public static void main(String args[])
{
byte[] arr = { 97, 98, 99, 100, 101 };
String str2 = new String(arr);
System.out.println(str2);
}
}
abcde
Explanation:
The constructor String( byte[] ) converts the bytes to corresponding characters i.e. 97 converted to character 'a'
4. What is the Output Of the following Program
Java
class demo4 {
public static void main(String args[])
{
String str = "Java Programming";
char ch = str.charAt(2);
System.out.println(ch);
}
}
Output:
v
Explanation:
charAt() function returns the character at the specified index.
5. What is the Output Of the following Program
Java
class demo5 {
public static void main(String args[])
{
String str = "Java Programming";
char arr[] = new char[10];
str.getChars(0, 4, arr, 0);
System.out.println(arr);
}
}
Output:
Java
Explanation:
The syntax of the method is: getChars(startindex, numOfCharacters, arrayName, startindexOfArrat). So from the string, starting from 0th index, first four characters are taken.
6. What is the Output Of the following Program
Java
class demo6 {
public static void main(String args[])
{
String str = "Java Programming";
char arr[] = new char[20];
arr = str.toCharArray();
System.out.println(arr);
}
}
Output:
Java Programming
Explanation:
toCharArray() method converts the string into a character array.
7. What is the Output Of the following Program
Java
class demo7 {
public static void main(String args[])
{
String str = "Java Programming";
String str1 = "Java Programming";
String str2 = str1;
if (str.equals(str1))
System.out.println("Equal Case 1");
if (str == str1)
System.out.println("Equal Case 2");
}
}
Output:
Equal Case 1
Equal Case 2
Explanation:
The equals() method compares the characters inside a String object.Thus str.equals(str1) comes out to be true.
The == operator compares two object references to see whether they refer to the same instance. Now str points to "Java Programming" and then str1 also points to "Java Programming", hence str == str1 is also true.
8. What is the Output Of the following Program
Java
class demo8 {
public static void main(String args[])
{
String str = "Java Programming";
String str1 = "Programminggggg";
if (str.regionMatches(5, str1, 0, 11))
System.out.println("Same");
}
}
Output:
Same
Explanation:
The syntax of the function is: regionMatches( startIndex, stringS, stringS's_startIndex, numOfCharacters)
so starting from index 5, string str1 is compared from index 0 till 11 characters only.
Hence output is 'Same'
9. What is the Output Of the following Program
Java
class demo9 {
public static void main(String args[])
{
String str = "Java Programming";
String str1 = "Java";
if (str.startsWith("J"))
System.out.println("Start Same");
if (str.endsWith("T"))
System.out.println("End Same");
}
}
Output:
Start Same
Explanation:
The startsWith() method determines whether a given String begins with a specified string.
The endsWith() determines whether the String in question ends with a specified string.
10. What is the Output Of the following Program
Java
class demo10 {
public static void main(String args[])
{
String str = "JavaProgramming";
String str1 = "Java";
System.out.println(str.compareTo(str1));
System.out.println(str1.compareTo(str));
}
}
Output:
11
-11
Explanation:
The String method compareTo( ) serves the purpose of comparing two strings. Whether one string is less than, greater than or equal to the second string.
In case 1, comparing JavaProgramming with Java implies JavaProgramming is greater than Java by 11 characters.
In case 2, comparing Java with JavaProgramming implies Java is lesser than JavaProgramming by 11 characters (-11).
11. What is the Output Of the following Program
Java
class demo11 {
public static void main(String args[])
{
String str = "Java Programming";
String str1 = "Java";
System.out.println(str.indexOf("a"));
System.out.println(str.indexOf("m"));
System.out.println(str.lastIndexOf("a"));
System.out.println(str.lastIndexOf("m"));
}
}
Output:
1
11
10
12
Explanation:
indexOf( ) Searches for the first occurrence of a character or substring. lastIndexOf( ) Searches for the last occurrence of a character or substring.
12. What is the Output Of the following Program
Java
class demo12 {
public static void main(String args[])
{
String str = "Java Programming";
String str1 = "Java";
String str2 = str.substring(5);
System.out.println(str2);
System.out.println(str.substring(5, 9));
}
}
Output:
Programming
Prog
Explanation:
constructor substring(int startIndex) takes the substring starting from the specified index till end of the string
constructor substring(int startIndex, int endIndex) takes the substring from startIndex to endIndex-1
13. What is the Output Of the following Program
Java
class demo13 {
public static void main(String args[])
{
String str = "Java Programming";
System.out.println(str.replace('a', '9'));
}
}
Output:
J9v9 Progr9mming
Explanation:
The replace( ) method replaces all occurrences of one character in the invoking string with another character.
Hence 'a' replaced with a '9'.
14. What is the Output Of the following Program
Java
class demo14 {
public static void main(String args[])
{
String str = "Java";
String str1 = "Programming";
System.out.println(str.concat(str1));
}
}
Output:
JavaProgramming
Explanation:
concat() method simply concatenates one string to the end of the other.
15. What is the Output Of the following Program
Java
class demo15 {
public static void main(String args[])
{
String str = " Java Programming ";
System.out.println(str.trim());
}
}
Output:
Java Programming
Explanation:
The trim( ) method returns a copy of the invoking string from which any leading and trailing whitespace has been removed. But it does not remove the spaces present between two words.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem