preparation

 import java.util.*;

import java.util.Scanner;

class city
{
public static void main(String args[])
{
List m=new ArrayList();
Scanner sc=new Scanner(System.in);

System.out.println("enter HOW Many cities you want=");
int a=sc.nextInt();

for(int j=0;j<a;j++)
{
System.out.println("enter cities = ");
m.add(sc.next());
}
System.out.println("list ="+m);
m.clear();
System.out.println("removed cities = "+m);
}
}


/*write a program to sort hashmap by keys and display the detaisl before sorting and after sorting*/

/*import java.util.Map;
import java.util.HashMap;
import java.util.TreeMap;
import java.util.Iterator;*/
import java.util.*;

public class hashmap {
    public static void main(String args[]) {
        HashMap<Integer, String> hm = new HashMap<Integer, String>();
        hm.put(8, "Nandan");
        hm.put(2, "Navnath");
        hm.put(5, "Shubham");
        hm.put(4, "Manish");
        hm.put(9, "Abhishek");
        hm.put(6, "Meghana");
        hm.put(7, "Tanaya");
        hm.put(3, "Neha");

        Iterator<Integer> it = hm.keySet().iterator();

        System.out.println("The elements before sorting are:");
        System.out.println("The elements are:");
        System.out.println("" + hm);
        System.out.println("\n");

        while (it.hasNext()) {
            int key = (int) it.next();
            System.out.println("Keys:-" + key + "     Name:   " + hm.get(key));
        }
        System.out.println("\n");

    }
}








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


class duplicate
{
            public static void main(String[] args) throws Exception
            {
                       
                    Scanner sc=new Scanner(System.in);
                                    TreeSet ts=new TreeSet();
                                    System.out.println("Enter the of elements :");
                                    int no=sc.nextInt();
                                    for(int i=0;i<no;i++)
                                    {
                                                System.out.println("Enter the element : ");
                                               int element=sc.nextInt();
                                                ts.add(element);
                                    }
                          System.out.println("The elements in sorted order :"+ts);    
                       
            }
}
/*****************output***********************
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ javac duplicate.java
Note: duplicate.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ java duplicate
Enter the of elements :
5
Enter the element :
765
Enter the element :
8
Enter the element :
748
Enter the element :
546
Enter the element :
869
The elements in sorted order :[8, 546, 748, 765, 869]
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$
*/










import java.util.*;

class friends
{
public static void main(String args[])
{
Scanner s =new Scanner(System.in);
System.out.println("enter how many name you want to enter = ");
int a=s.nextInt();
LinkedList l=new LinkedList();
for(int i=0;i<a;i++)
{

System.out.println("enter names = ");
l.add(s.next());
}
System.out.println("your frd list ="+l);

}
}

/**********************output************************
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ javac friends.java
Note: friends.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ java friends
enter how many name you want to enter =
2
enter names =
Mayur
enter names =
Rinku
your frd list =[Mayur, Rinku]
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$
*******************************************************/








import java.util.*;

class htable
{
 public static void main(String args[])
 {
 Hashtable h=new Hashtable();
 
 h.put("tanaya",new Long(1234567890L));
 h.put("tanu",new Long(5647649374L));
 h.put("tani",new Long(5647389292L));
 System.out.println("hasg table = "+h);
 
 
 
 }
 }

/***********************output************************





import java.sql.*;
import java.io.*;

import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.Statement;

public class ResultSetMetaData
{
  public static void main(String[] args) throws Exception
  {
 
 
    Statement stmt;
   Class.forName("org.postgresql.Driver");
       Connection conn = DriverManager.getConnection("jdbc:postgresql://localhost:5432/db1","postgres", "redhat");
    stmt = conn.createStatement();
   ResultSet rs = stmt.executeQuery("Select * from donar30");
    java.sql.ResultSetMetaData rsmd = rs.getMetaData();
    int noOfColumns = rsmd.getColumnCount();
    System.out.println("Number of columns = " + noOfColumns);
    for(int i=1; i<=noOfColumns; i++)
    {
       System.out.println("Column No : " + i);
       System.out.println("Column Name : " + rsmd.getColumnName(i));
       System.out.println("Column Type : " + rsmd.getColumnTypeName(i));
      System.out.println("Column display size : " + rsmd.getColumnDisplaySize(i));
    }
    conn.close();
  }
}
/*
msc18@msc18-HP-202-G2-MT:~/nandan$ export CLASSPATH=mysql-connector-java-5.1.43-bin.jar:.
msc18@msc18-HP-202-G2-MT:~/nandan$ javac ResultSetMetaData.java
msc18@msc18-HP-202-G2-MT:~/nandan$ java ResultSetMetaData

/Number of columns = 3
Column No : 1
Column Name : r
Column Type : INT
Column display size : 11
Column No : 2
Column Name : name
Column Type : VARCHAR
Column display size : 20
Column No : 3
Column Name : per
Column Type : INT
Column display size : 11*/












Stuhash.java


    import java.util.*;
    import java.io.*;
    class stuhash
    {
        public static void main(String args[])          
        {
            Hashtable student = new Hashtable();
            Enumeration names;
            String str;
            student.put("Amar",new Long(8975642310L));
            student.put("Anil",new Long(8954892514L));
            student.put("Asif",new Long(9857460123L));
            student.put("Aman",new Long(8745169660L));
            student.put("Atul",new Long(7845415140L));
            student.put("Ajay",new Long(1589243878L));
            names = student.keys();
            while(names.hasMoreElements())
            {
               str = (String) names.nextElement();
            System.out.println(str + ":" +student.get(str));
            }
                            }
                }
/***********************************output*****************
mcs21@mcs21-HP-202-G2-MT:~$ cd RM
mcs21@mcs21-HP-202-G2-MT:~/RM$ cd java2
mcs21@mcs21-HP-202-G2-MT:~/RM/java2$ cd Assignmentno1
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ java stuhash.java
Note: stuhash.java uses or overrides a deprecated API.
Note: Recompile with -Xlint:deprecation for details.
Note: stuhash.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
Aman:8745169660
Asif:9857460123
Ajay:1589243878
Atul:7845415140
Anil:8954892514
Amar:8975642310
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$
*/






import java.util.*;
class tree
{
public static void main(String[] args)
{
TreeSet s=new TreeSet();
s.add("red");
s.add("Yellow");
s.add("Purple");
s.add("White");
s.add("Blue");
System.out.println("Display color's:"+s);        
}
}









import java.util.Map;  
import java.util.HashMap;  
import java.util.TreeMap;  
import java.util.Iterator;  
public class SortHashMapByKeys  
{  
public static void main(String args[])  
{  
 
HashMap<Integer, String> hm=new HashMap<Integer, String>();  
 
hm.put(23, "Yash");  
hm.put(17, "Arun");  
hm.put(15, "Swarit");  
hm.put(9, "Neelesh");  
Iterator <Integer> it = hm.keySet().iterator();        
System.out.println("Before Sorting");  
while(it.hasNext())  
{  
int key=(int)it.next();  
System.out.println("Roll no:  "+key+"     name:   "+hm.get(key));  
}  
System.out.println("\n");  
Map<Integer, String> map=new HashMap<Integer, String>();  
System.out.println("After Sorting");  
 
TreeMap<Integer,String> tm=new  TreeMap<Integer,String> (hm);  
Iterator itr=tm.keySet().iterator();              
while(itr.hasNext())    
{    
int key=(int)itr.next();  
System.out.println("Roll no:  "+key+"     name:   "+hm.get(key));  
}    
}  
}

/*******************output****************
mcs21@mcs21-HP-202-G2-MT:~$ cd RM
mcs21@mcs21-HP-202-G2-MT:~/RM$ cd java2
mcs21@mcs21-HP-202-G2-MT:~/RM/java2$ cd Assignmentno1
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ javac SortHashMapByKeys.java
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ java SortHashMapByKeys
Before Sorting
Roll no:  17     name:   Arun
Roll no:  23     name:   Yash
Roll no:  9     name:   Neelesh
Roll no:  15     name:   Swarit


After Sorting
Roll no:  9     name:   Neelesh
Roll no:  15     name:   Swarit
Roll no:  17     name:   Arun
Roll no:  23     name:   Yash
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$




import java.util.*;

class llist
{
public static void main(String args[])
{
LinkedList l=new LinkedList();
l.add(10);
l.add(20);
l.add(30);
l.add(40);
l.add(50);
l.add(60);
System.out.println("list = "+l);
System.out.println("size of list = "+l.size());
l.addFirst(0);
System.out.println("add first element in list  = "+l);
l.removeLast();
System.out.println("After deleting last element = "+l);

}
}

/******************************output*****************************
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ javac llist.java
Note: llist.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$ java llist
list = [10, 20, 30, 40, 50, 60]
size of list = 6
add first element in list  = [0, 10, 20, 30, 40, 50, 60]
After deleting last element = [0, 10, 20, 30, 40, 50]
mcs21@mcs21-HP-202-G2-MT:~/RM/java2/Assignmentno1$
*****************************************************************/

Comments