Java DA 2

Q1)

import java.io.*;
import java.util.Scanner;

public class q1 {

String name;
int age;
String address;
int contact;
String blood;
String date;

q1(String name,int age,String blood,String date,String address)

{
this.name=name;
this.age=age;
this.contact=contact;
this.address=address;
this.blood=blood;
this.date=date;

public static void main(String[] args) {

try {
PrintStream output = new PrintStream("C:\\Users\\haroo\\OneDrive -
vit.ac.in\\Summer sem 2022-23\\Java lab\\Java\\DA2\\q1.txt");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
q1[] arr = new q1[n];
for (int i = 0; i < n; i++)
{
String name = sc.next();

String address = sc.next();

String blood = sc.next();

String date = sc.next();

int age = sc.nextInt();

int contact = sc.nextInt();

arr[i] = new q1(name, age, blood, date, address);
 }

for (int i = 0; i < n; i++)

{System.out.println(arr[i].address);

if (arr[i].address.equals("best"))
{
output.println(arr[i].name);
output.println(arr[i].blood);
output.println(arr[i].age);
output.println(arr[i].contact);
output.println(arr[i].address);
output.println(arr[i].date);
output.println("\n");
}
}
output.close();
} catch (Exception e) {
e.getStackTrace();
}
}

}
Q2)
import java.util.*;
import java.util.concurrent.*;

public class q3 {

static TreeMap<Integer, String> tree_map;

static void create()

{
tree_map = new TreeMap<Integer, String>();

static void insert()

{

// Mapping string values to int keys

// using put() method
tree_map.put(10, "haroon");
tree_map.put(15, "4");
tree_map.put(20, "rachit");
tree_map.put(25, "dhruv");
tree_map.put(30, "ajay");

// Display message only

System.out.println("\nElements successfully"
+ " inserted in the TreeMap");
}

static void search(int key)

{

System.out.println("\nIs key \"" + key

+ "\" present? "
+ tree_map.containsKey(key));
}

static void search(String value)

{

System.out.println("\nIs value \"" + value

+ "\" present? "
+ tree_map.containsValue(value));
}

static void display()

{

System.out.println("\nDisplaying the TreeMap:");

 System.out.println("TreeMap: " + tree_map);
}

static void traverse()

{

System.out.println("\nTraversing the TreeMap:");

for (Map.Entry<Integer, String> e :

tree_map.entrySet())
System.out.println(e.getKey() + " "
+ e.getValue());
}

public static void main(String[] args)

{

create();
insert();
search(50);
search("rachit");
display();
traverse();
}
}

a tree map is used in cases where there needs to be an automatic

ordering of data based on keys
Q3)
import java.util.*;

public class q4 {
public static void main(String[] args) {

TreeSet<Integer> set=new TreeSet<Integer>();

set.add(24);
set.add(66);
set.add(12);
set.add(15);
System.out.println("Lowest Value: "+set.pollFirst());
System.out.println("Highest Value: "+set.pollLast());
}
}

tree set is used in cases where data stored shud be unique and
arranged.It is self balancing thus operations such as searching can be
done efficiently via binary search

Q4)

import java.io.*;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;

public class q4 {

public static void main(String[] args)

throws IOException {
File file = new File("C:\\Users\\haroo\\OneDrive - vit.ac.in\\Summer sem
2022-23\\Java lab\\Java\\DA2\\q1.txt");
FileInputStream fileInputStream = new FileInputStream(file);
InputStreamReader inputStreamReader = new
InputStreamReader(fileInputStream);
BufferedReader bufferedReader = new BufferedReader(inputStreamReader);

String line;
int wordCount = 0;
int characterCount = 0;
int paraCount = 0;
int whiteSpaceCount = 0;
int sentenceCount = 0;
 while ((line = bufferedReader.readLine()) != null) {
if (line.equals("")) {
paraCount += 1;
} else {
characterCount += line.length();
String words[] = line.split("\\s+");
wordCount += words.length;
whiteSpaceCount += wordCount - 1;
String sentence[] = line.split("[!?.:]+");
sentenceCount += sentence.length;
}
}
if (sentenceCount >= 1) {
paraCount++;
}
System.out.println("Total word count = " + wordCount);
System.out.println("Total number of sentences = " + sentenceCount);
System.out.println("Total number of characters = " + characterCount);
System.out.println("Number of paragraphs = " + paraCount);

FileWriter writer = new FileWriter("C:\\Users\\haroo\\OneDrive -

vit.ac.in\\Summer sem 2022-23\\Java lab\\Java\\DA2\\q1.txt");
BufferedWriter buffer = new BufferedWriter(writer);
String s = String.valueOf(wordCount);
String s1 = String.valueOf(sentenceCount);
String s2 = String.valueOf(characterCount);
String s3 = String.valueOf(paraCount);

buffer.write("word count=" + s);

buffer.write("sentence count=" + s1);
buffer.write("Character count=" + s2);
buffer.write("para count=" + s3);
buffer.close();
System.out.println("Success");

}
}
Q5)
import java.util.*;

class RegNumNotFoundException extends Exception {

RegNumNotFoundException(String s) {
super(s);
}
}

public class q5 {
public static void main(String[] args) throws RegNumNotFoundException {
Scanner sc = new Scanner(System.in);
System.out.println("enter n");
int n = sc.nextInt();
ArrayList<String> arr = new ArrayList<>();
for (int i = 0; i < n; i++) {
String reg = sc.next();
arr.add(reg);
}
System.out.println("enter reg number to be found");
String user = sc.next();
boolean flag=true;
for (int i = 0; i < n; i++) {
if (arr.get(i).equals(user)) {
System.out.println("reg number found");
flag=false;
}
}
if (flag) {
throw new RegNumNotFoundException("reg not found");
}

}
}