{"id":1298,"date":"2021-11-04T18:49:56","date_gmt":"2021-11-04T18:49:56","guid":{"rendered":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/2021\/11\/04\/sdet-interview-questions-part-4\/"},"modified":"2021-11-04T18:49:56","modified_gmt":"2021-11-04T18:49:56","slug":"sdet-interview-questions-part-4","status":"publish","type":"post","link":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/2021\/11\/04\/sdet-interview-questions-part-4\/","title":{"rendered":"Top SDET Interview Questions in Java – Part 4"},"content":{"rendered":"

<\/p>\n

\n

\n

\n

\n

<\/div>\n

\n

\n

<\/div>\n<\/div>\n

<\/div>\n

\n

<\/div>\n

\n

\n

Table of Contents<\/div>\n<\/p><\/div>\n<\/div>\n<\/div>\n

\n

\n

<\/div>\n

\n

\n

\n

1. What is Typecasting explain with small code snippet?<\/a><\/div>\n

2. Write a program to reverse a string \u00a0without using string.reverse() method<\/a><\/div>\n

3. Write a program to calculate the occurrences of each character in the string<\/a><\/div>\n

4. Write a program to check the magic number<\/a><\/div>\n

5. Write a program to check if two strings are an anagram<\/a><\/div>\n

6. Write a program to create a deadlock in java<\/a><\/div>\n

7. Consider I have data like below distance to the city from your hometown<\/a><\/div>\n

Course Alert<\/a><\/div>\n<\/div>\n

<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

1. What is Typecasting explain with small code snippet?<\/a><\/h3>\n
\n
Typecasting is converting data from one data type to another data type.<\/li>\n
Typecasting can be applied to both primitive and non-primitive types.<\/li>\n
Typecasting process doesn’t alter the data but alters the type.<\/li>\n<\/ul>\n
There are two types:<\/strong><\/p>\n
\n

\n<\/ins>\n<\/div>\n
\n
Implicit casting<\/li>\n
Explicit casting<\/li>\n<\/ul>\n
Implicit casting: <\/strong>This is known as automatic typecasting. Usually, this happens when you converting a lower data type to a higher data type<\/p>\n
<\/strong><\/p>\n
Example Code Snippet<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String args[]) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int i = 10;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 float f = i;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Value of f = ” +f);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Value of f = 10.0<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
Explicit TypeCasting<\/strong><\/p>\n
Explicit casting involves assigning a data type of high range to a lower range. This casting needs to be done manually<\/p>\n
<\/strong><\/p>\n
Example Code Snippet<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String args[]) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 float f = 3.142f;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int\u00a0 i = (int) f;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Value of i = ” +i);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Value of i = 3<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
Note: <\/strong>Why do we need typecasting?<\/em><\/p>\n
Typecasting is needed to get access to fields and methods declared on the target type or class. You cannot access them with any other type.<\/em><\/p>\n
2. Write a program to reverse a string \u00a0without using string.reverse() method<\/a><\/h3>\n
Example Code Snippet<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String args[]) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 String string = “Rahul Shetty Academy”;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 String reverse = “”;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = string.length() – 1; i >= 0; –i) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 reverse += string.charAt(i);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(reverse);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output: ymedacA yttehS luhaR<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
3. Write a program to calculate the occurrences of each character in the string<\/a><\/h3>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.;<\/span><\/p>\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 static void countChars(String string) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 HashMap<Character, Integer> charCount = new HashMap<Character, Integer>();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 char[] charArray = string.toCharArray();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (char c : charArray) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (charCount.containsKey(c)) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 charCount.put(c, charCount.get(c) + 1);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 } else {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 charCount.put(c, 1);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (Map.Entry entry : charCount.entrySet()) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Character “+entry.getKey() + ” Occurred ” + entry.getValue() +” Time(s)”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 countChars(“java”);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Character a Occurred 2 Time(s)<\/span><\/p>\n
Character v Occurred 1 Time(s)<\/span><\/p>\n
Character j Occurred 1 Time(s)<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
4. Write a program to check the magic number<\/a><\/h3>\n
The number is called a Magic number<\/strong>, If the sum of its digits is calculated till a single digit recursively by adding the sum of the digits after every addition. If the single-digit comes out to be 1, then the number is a magic number.<\/p>\n
Example 1:<\/strong><\/p>\n
Number: 1081<\/p>\n
1081 = 1+0+8+1 Sum is 10<\/p>\n
10 = 1+0 Sum 1<\/p>\n
So 1081 is Magic number<\/p>\n
Example 2:<\/strong><\/p>\n
Number: 1056<\/p>\n
1056 = 1+0+5+6 Sum is 12<\/p>\n
12 = 1+2 Sum is 3<\/p>\n
So 1056 is not a Magic number<\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int sum = 0;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int number = 1081;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int n = number;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 while (n > 0 || sum > 9) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0 if (n == 0) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 n = sum;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 sum = 0;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 sum += n % 10;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 n \/= 10;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (sum == 1) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(number + ” is a Magic Number”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 } else {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(number + “is not a Magic Number”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
1081 is a Magic Number<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
5. Write a program to check if two strings are an anagram<\/a><\/h3>\n
An anagram is if two strings are having exactly the same chars and however the order of chars are different.<\/p>\n
Example 1:<\/strong><\/p>\n
String 1 = ABCD<\/p>\n
String 2: BDCA<\/p>\n
The String 1 and String 2 are anagrams<\/p>\n
Example 2:<\/strong><\/p>\n
String 1: Race<\/p>\n
String 2: Care<\/p>\n
String 1 and String 2 are anagrams<\/p>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.;<\/span><\/p>\n
public class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 String string1 = “race”;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 String string2 = “care”;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 boolean isAnagram = false;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (string1.length() != string2.length()) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 isAnagram = false;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 else{<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 char[] char1 = string1.toCharArray();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 char[] char2 = string2.toCharArray();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Arrays.sort(char1);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Arrays.sort(char2);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i < char1.length; i++) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (char1[i] != char2[i]) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 isAnagram = false;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 break;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 isAnagram = true;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (isAnagram)<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(string1 + ” and “+string2+ ” are Anagram”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 else<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(string1 + ” and “+string2+ ” are Not Anagram”);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
race and care are Anagram<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
6. Write a program to create a deadlock in java<\/a><\/h3>\n
Deadlock<\/strong> is the situation when a first thread is waiting for an object, that is acquired by a second thread and the second thread is waiting for an object lock that is acquired by the first thread. Since both threads are waiting for each other to release the lock. This condition is called deadlock.<\/p>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Object resource1 = new Object();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Object resource2 = new Object();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Thread t1 = new Thread() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 public void run() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 synchronized (resource1) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Thread 1: locked resource 1”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 try {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Thread.sleep(100);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 } catch (Exception e) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 synchronized (resource2) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Thread 1: locked resource 2”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 };<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Thread t2 = new Thread() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 public void run() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 synchronized (resource2) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Thread 2: locked resource 2”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 try {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Thread.sleep(100);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 } catch (Exception e) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 synchronized (resource1) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Thread 2: locked resource 1”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 };<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 t1.start();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 t2.start();<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Thread 1: locked resource 1<\/span><\/p>\n
Thread 2: locked resource 2<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
7. Consider I have data like below distance to the city from your hometown<\/a><\/h3>\n
Bangalore, 560<\/p>\n
Chennai, 890<\/p>\n
Hyderabad, 566<\/p>\n
Mumbai, 788<\/p>\n
New Delhi, 1000<\/p>\n
Write a program that stores the above data in Map, and print them back by iterating over each element.<\/p>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.HashMap;<\/span><\/p>\n
import java.util.Map;<\/span><\/p>\n
import java.util.Map.Entry;<\/span><\/p>\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Map<String,Integer> map = new HashMap<String,Integer>();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 map.put(“Bangalore”, 560);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 map.put(“Chennai”, 890);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 map.put(“Hyderabad”, 566);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 map.put(“Mumbai”, 788);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 map.put(“New Delhi”, 1000);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for(Entry<String,Integer> entry:map.entrySet()) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Distance from Hometown to ” + entry.getKey()+” is ” + entry.getValue()+” Kms”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Distance from Hometown to New Delhi is 1000 Kms<\/span><\/p>\n
Distance from Hometown to Chennai is 890 Kms<\/span><\/p>\n
Distance from Hometown to Mumbai is 788 Kms<\/span><\/p>\n
Distance from Hometown to Hyderabad is 566 Kms<\/span><\/p>\n
Distance from Hometown to Bangalore is 560 Kms<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
Course Alert<\/span><\/em><\/h5>\n
If you are interested in landing a SDET or Sr. QA Automation Engineer role, check out our popular SDET course to learn the fundamental skills required an SDET needs to perform at work. Also, I have another popular course which covers Top 150+ Interview questions most commonly asked in SDET \/ Automation interviews.<\/strong><\/p>\n<\/div>\n
\n
\n
\n
\n
SDET\/Test Architect Essentials -Road to Full stack QA<\/a><\/span><\/li>\n
\n
\n
SDET\/QA Automation Interview Kit + Java logic Programs<\/a><\/span><\/li>\n<\/ul>\n<\/div>\n
\n
\n
<\/div>\n
\n
\n
A Quick Note<\/strong><\/em><\/h4>\n<\/div>\n\n
Please remember all these courses comes with 100% Lifetime acces<\/strong>s<\/strong> and free updates for Lifetime!!<\/strong><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n
Please click on the link\u00a0Sr.QA and SDET Interview Questions in Java \u2013 Part 5<\/a><\/em><\/strong> to continue to part-5 series of this article.<\/p>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n<\/section>\n
<\/body><\/html><\/p>\n","protected":false},"excerpt":{"rendered":"
Table of Contents 1. What is Typecasting explain with small code snippet? 2. Write a program to reverse a string \u00a0without using string.reverse() method 3. Write a program to calculate the occurrences of each character in the string 4. Write a program to check the magic number 5. Write a program to check if two […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,5],"tags":[],"class_list":["post-1298","post","type-post","status-publish","format-standard","hentry","category-interview-questions","category-java","post-wrapper","thrv_wrapper"],"_links":{"self":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/1298","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/comments?post=1298"}],"version-history":[{"count":0,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/1298\/revisions"}],"wp:attachment":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/media?parent=1298"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/categories?post=1298"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/tags?post=1298"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}