Practice Questions

//Thread problem
//sorted Array
// Java program to swap two strings without using a temporary variable.

import java.util.Scanner;
import java.util.*;
 
class PrintPrimes
{ 
 public static void main(String args[])
 {
 Scanner input = new Scanner(System.in);
 System.out.println("Enter number of elements");
 int n = input.nextInt();
 int[] arr = new int[n];
 for(int i=0;i<n;i++){
 arr[i] = input.nextInt();
 }
 sortedArray(arr);
 } 
 
 public static void sortedArray(int[] arr){
 for(int i=0;i<arr.length;i++){
 System.out.print(arr[i]+" ");
 }
 Arrays.sort(arr);
 int[] flag = new int[arr.length];
 System.out.println();
 System.out.println("====================");
 for(int i=0;i<arr.length;i++){
 System.out.print(arr[i]+" ");
 for(int j=i;j<arr.length;j++){
 if(arr[i]==arr[j]){
 flag[i]++;
 }
 }
 }
 }
}

Practice 5

// Java program to swap two strings without using a temporary variable.

import java.util.Scanner;
import java.util.*; 
class PrintPrimes{
public static void main(String args[]){ 
Scanner input = new Scanner(System.in);
 System.out.println("Enter String1");
 String a = input.nextLine(); 
System.out.println("Enter String2");
String b = input.nextLine();
System.out.println("Strings before swap: String1 = " + a + " and String2 = "+b);
a = a + b;
b = a.substring(0,a.length()-b.length());
a = a.substring(b.length());
System.out.println("Strings after swap: String1 = " + a + " and String2 = " + b);
}
}
OUTPUT:
C:\Users\SouravG\Desktop>java PrintPrimes
Enter String1
saurav
Enter String1
gupta
Strings before swap: String1 = saurav and String2 = gupta
Strings after swap: String1 = gupta and String2 = saurav
C:\Users\SouravG\Desktop>

——————————END of PROGRAM——————————

=================================================

Practice 4

//WAP to print primes to a number

import java.util.Scanner;
class PrintPrimes{
 public static void main(String[] args){
 Scanner input = new Scanner(System.in);
 System.out.println("Upper Range : ");
 int num=input.nextInt();
 primeNums(num); 
} 
public static void primeNums(int n){
 boolean checkFlag;
 if(n<=2){
 System.out.println(n); 
} 
else{
 for(int i=2;i<n;i++){
 checkFlag = true;
 for(int j=2;j<i/2;j++){
 if(i%j==0){
 checkFlag = false;
 break; 
} 
} 
if(checkFlag == true){
 System.out.print(i + " ");
 }
 }
 }
 }
}
OUTPUT:
C:\Users\SouravG\Desktop>javac PrintPrimes.java
C:\Users\SouravG\Desktop>java PrintPrimes
Upper Range :
21
2 3 4 5 7 11 13 17 19
C:\Users\SouravG\Desktop>

——————————END of PROGRAM——————————

=================================================

//WAP to print a second value in respect to Year – Month – Day – Hours – Min – Sec

import java.util.Scanner;
public class SecToYrDayMonDayHrMinSec {

public static void main(String[] args){
 Scanner input = new Scanner(System.in);
 boolean check = false;
 do{
 System.out.println("Enter seconds");
 int i = input.nextInt();
 if(i>100000 || i<0){
 System.out.println(" Wrong Input, try again");
 }
 else{
 check = true;
 System.out.println("minutes entered " + i);
 int minutes = i/60;
 int hours = minutes/60;
 int day = hours/24;
 int year = day/12;
 int onlySeconds = i%60;
 int onlyMinutes = minutes%60;
 int onlyHours = hours%60;
 int onlyDay = day/24;
 int onlyYear = year/365;

System.out.println("year : "+onlyYear
 + "\nday : "+onlyDay
 +"\nhours : " + onlyHours
 + "\nminutes " +onlyMinutes
 + "\nseconds " + onlySeconds);

}
 }while(check == false);
 }
}
OUTPUT: 
C:\Users\SouravG\Desktop>java SecToYrDayMonDayHrMinSec
Enter seconds
12345
minutes entered 12345
year : 0
day : 0
hours : 3
minutes 25
seconds 45

C:\Users\SouravG\Desktop>

——————————END of PROGRAM——————————

=================================================

Practice 2

//WAP to check number of times and position of occurance of a sub string in a main String

import java.util.Scanner;
 public class SubStringSearch{
 public static void main(String[] args){
 Scanner input = new Scanner(System.in);
 System.out.println("Enter Main String");
 String mainString = input.nextLine();
 System.out.println("Enter Sub String");
 String subString = input.nextLine();
 String temp="";

boolean validFlag;
 do{
 validFlag = true;
 if(mainString.length()<subString.length()){
 System.out.println("Sorry, wrong input");
 System.out.println("Main String must be bigger, do you want to swap inputs Y/N");
 if(input.nextLine().equalsIgnoreCase("y")){
 temp = mainString;
 mainString = subString;
 subString =temp;
 validFlag = true;
 }
 else{
 validFlag = false;
 }
 }
 if(validFlag){
 int count =0;
 for (int i = 0; (i = mainString.indexOf(subString, i)) != -1 ; i++) {
 System.out.println("position "+ (i+1));
 count++;
 }
 System.out.println("Total number of occurance "+count);
 validFlag = false;
 }
 }
 while(validFlag);
 }
 }
OUTPUT:
C:\Users\SouravG\Desktop>java SubStringSearch
 Enter Main String
 saurav is saurav
 Enter Sub String
 saurav
 position 1
 position 11
 Total number of occurance 2

C:\Users\SouravG\Desktop>java SubStringSearch
 Enter Main String
 saurav
 Enter Sub String
 saurav is saurav because his name is saurav
 Sorry, wrong input
 Main String must be bigger, do you want to swap inputs Y/N
 y
 position 1
 position 11
 position 38
 Total number of occurance 3

C:\Users\SouravG\Desktop>


https://www.amazon.com/clouddrive/share/dZnoQ2GvniftvU9q10jpiwbQrJUDW7N2zyxVTgpv7sO/XnqJ5k-CTgeeCMHRSsQ7Ew?_encoding=UTF8&*Version*=1&*entries*=0&mgh=1

——————————END of PROGRAM——————————

=================================================

//Practice 1

//WAP which can help retrieving the group of student data in fasted possible manner.

// NOTE : Hash is the fastest retrieval data structure. We also have to use KEY-VALUE pair to identify the values in fastest way. Hence HashMap is the most ideal choice.

—————————————————–

import java.util.*;
 class Student{
 String name;
 int roll,stnd;
 Student(int _roll, String _name, int _stnd){
 this.roll = _roll;
 this.name = _name;
 this.stnd = _stnd;
 }
 public int getRoll(){
 return roll;
 }
 public int getStnd(){
 return stnd;
 }
 public String getName(){
 return name;
 }

public String toString(){
 return "Name : " + name + " Roll : "+ roll + " Standard : " + stnd;
 }
 }
 class B1{
 public static void main(String[] args){
 Scanner input = new Scanner(System.in);
 HashMap stu = new HashMap();
 stu.put(1,new Student(1,"Sa",8));
 stu.put(2,new Student(11,"Ur",9));
 stu.put(3,new Student(21,"Av",8));
 stu.put(4,new Student(9,"Pr",8));
 stu.put(5,new Student(6,"Ak",11));
 stu.put(6,new Student(14,"Sh",8));
 stu.put(7,new Student(12,"Gup",8));
 stu.put(8,new Student(10,"Ta",8));

System.out.println("Which ID : ");
 int ID = input.nextInt();

if(stu.get(ID) == null){
 System.out.println("No such ID found");
 }
 else{
 System.out.println(stu.get(ID));
 }
 }
 }
OUTPUT:

https://www.amazon.com/clouddrive/share/04BRPzPdJBmL8g4Rw74w5MbvIU221l6hOLD3KiSv4Io/L5urYt6HQXy0YzUvWtRFjA?_encoding=UTF8&*Version*=1&*entries*=0&mgh=1

——————————END of PROGRAM——————————

=================================================

Design a site like this with WordPress.com
Get started