Write a program to add, retrieve and remove the element from theArrayList.
import [Link].*;
class ArrayListDemo
public static void main(String[] args)
ArrayList<String> al = new ArrayList<String>();
[Link]("Size of ArrayList: "+[Link]());
//Adding the elements
[Link]("Java");
[Link]("JDBC");
[Link]("Elements of first ArrayList: "+al);
ArrayList<String> al2 = new ArrayList<String>();
[Link]("EJB");
[Link]("Struts");
//Adding the both array
[Link](al);
[Link]("Elements of second ArrayList: "+al2);
//remove the element
[Link]("EJB");
[Link]("Elements of ArrayList after deletion: "+al2);
[Link]("Size of ArrayList: "+[Link]());
//Retriving 2nd index element
[Link]("The element at 2nd index is: "+[Link](2)); }}
Java Program to perform add, remove and retrieve the elements fromthe linked list.
import [Link].*;
public class LinkedListDemo {
public static void main(String args[]) {
LinkedList<String> ll = new LinkedList<String>();
[Link]("Initial size of LinkedList: "+[Link]());
[Link]("Pune");
[Link]("Mumbai");
[Link]("Delhi");
[Link]("Noida");
[Link]("Element of LinkedList: " + ll);
[Link]("Size of LinkedList after addition: "+[Link]());
[Link](2);
[Link]("Element of LinkedList after deletion: " + ll);
[Link]("Size of the LinkedList after deletion: "+[Link]());
[Link]();
[Link]();
[Link]("ll after deleting first and last: " + ll);
[Link]("Size of the LinkedList after deletion: "+[Link]());
[Link]("Fisrt element of LinkedList: "+[Link]());
[Link]("Last element of LinkedList: "+[Link]());
Iterator<String> itr = [Link]();
while([Link]()){
[Link]([Link]()+", "); }}}
Write a program to sort and reverse the LinkedList elements
Import [Link].*;
class student{
private String name;
private int regNumber;
public student(String n, int reg) {
[Link] = n;
[Link] = reg; }
public String getName() {
return name; }
public void setName(String name) {
[Link] = name; }
public int getReg() {
return regNumber; }
public void setReg(int regNumber) {
[Link] = regNumber; }
public String toString() {
return "Student Name: "+[Link]+", Reg Number:
"+[Link]; }}
class StudCompare implements Comparator<student>{
@Override
public int compare(student stud1, student stud2) {
if ([Link]() < [Link]()) {
return 1; }
return -1; }}
class SortList{
public static void main(String[] args) {
LinkedList<student> list = new LinkedList<student>();
[Link](new student("John", 1001));
[Link](new student("Raju", 1005));
[Link](new student("Sham", 1000));
[Link](new student("Ravi", 1002));
[Link](list, new StudCompare());
[Link]("Sorted list based on registration number\n");
[Link]("**=============**=================**");
for (student stud: list )
[Link](stud);
[Link]("**=============**=================**\n");
}
Write program to search key and value from HashTable.
import [Link];
import [Link];
class SearchValueKeys{
public static void main(String[] args) {
Hashtable<String, String> ht = new Hashtable<String, String>();
[Link]("1","First");
[Link]("2","Second");
[Link]("3","Third");
[Link]("4","Forth");
[Link]("5","Fifth");
[Link]("Hashtable elements with key: ");
[Link](ht);
[Link]("===============================================");
if ([Link]("1") && [Link]("First")) {
[Link]("key 1 and value first are available.");}
else
[Link]("Hashtable doesn't contain first key and value");
if ([Link]("second") && [Link]("2")) {
[Link]("key second and value 1 are available.");
[Link]("Hashtable doesn't contain key second and value 2");
[Link]("===============================================");
}}
Java Program to copy elements from Hashset to Array
import [Link];
public class Test {
public static void main(String[] args) {
HashSet<String> hashSet = new HashSet<String>();
[Link]("Jai");
[Link]("Mahesh");
[Link]("Vivek");
[Link]("Naren");
[Link]("Vishal");
[Link]("Hemant");
[Link]("HashSet: " + hashSet);
String[] strArray = new String[[Link]()];
[Link](strArray);
[Link]("Array created:");
for(String str:strArray){
[Link](str);
}
import [Link];
import [Link];
class Employee{
private String name;
private int salary;
private int id;
public Employee(int id, String name, int salary){
[Link] = id;
[Link] = name;
[Link] = salary;}
public String getName() {
return name;}
public void setName(String name) {
[Link] = name;}
public int getSalary() {
return salary;}
public void setSalary(int salary) {
[Link] = salary;}
public int getId() {
return id;}
public void setId(int id) {
[Link] = id;}
public String toString(){
return "Id: "+[Link]+", Name: "+[Link]+", Salary: "+[Link];}
@Override
public int hashCode() {
[Link]("In hashcode method");
return [Link]();}
@Override
public boolean equals(Object obj) {
Employee e = null;
if(obj instanceof Employee){
e = (Employee) obj;
[Link]("In equals
method");
if([Link]() == [Link]()){
return true;
} else {
return false;}}}
public class Test {
public static void main(String
args[]){
Hashtable<Employee,String>
hashtable = new
Hashtable<Employee, String>();
[Link](new
Employee(1,"Jai",50000), "JAI");
[Link](new
Employee(2,"Mahesh",80000),
"MAHESH");
[Link](new Employee(3,"Vishal",60000), "VISHAL");
[Link](new Employee(4,"Hemant",64000), "HEMANT");
[Link]("Adding duplicate entry.");
[Link](new Employee(3,"Vishal",60000), "VISHAL");
Set<Employee> keys = [Link]();
for(Employee key:keys){
[Link](key+" - "+[Link](key));
[Link]("Duplicate removed.");}}
import [Link];
import [Link];
import [Link];
import [Link];
public class Test1 {
public static void main(String args[]){
TreeMap<Integer, String> treeMap = new TreeMap<Integer, String>();
[Link](4, "Roxy");
[Link](2, "Sunil");
[Link](5, "Sandy");
[Link](1, "Munish");
[Link](3, "Pardeep");
[Link]("TreeMap elements:");
[Link](treeMap);
Set set=[Link]();
Iterator iterator=[Link]();
[Link]("TreeMap elements using iterator:");
while([Link]()){
[Link] mapEntry=([Link])[Link]();
[Link]("Key: " + [Link]() + ", " +
"Value: " + [Link]()); }}}
import [Link].*;
import [Link].*;
import [Link].*;
import [Link].*;
import [Link].*;
public class Table1 extends JFrame
int i=0;
int j=0,k=0;
Object data[][]=new Object[5][4];
Object list[][]=new Object[5][4];
JButton save;
JTable table1;
FileInputStream fis;
DataInputStream dis;
public Table1()
String d= " ";
Container con=getContentPane();
[Link](new BorderLayout());
final String[] colHeads={"Name","Roll Number","Department","Percentage"};
try
String s=[Link]("Enter the File name present in the current directory");
FileInputStream fis=new FileInputStream(s);
DataInputStream dis = new DataInputStream(fis);
while ((d=[Link]())!=null)
StringTokenizer st1=new StringTokenizer(d,",");
while ([Link]())
{
for (j=0;j<4;j++)
data[i][j]=[Link]();
[Link](data[i][j]);
i++;
[Link] ("______________");
} catch (Exception e)
[Link] ("Exception raised" +[Link]());
table1=new JTable(data,colHeads);
int v=ScrollPaneConstants.VERTICAL_SCROLLBAR_AS_NEEDED;
int h=ScrollPaneConstants.HORIZONTAL_SCROLLBAR_AS_NEEDED;
JScrollPane scroll=new JScrollPane(table1,v,h);
[Link](scroll,[Link]);
public static void main(String args[])
Table1 t=new Table1();
[Link]([Link]);
[Link]("Display Data");
[Link](500,300);
[Link](true); }}
[Link](JFrame.EXIT_ON_CLOSE);
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
public class HashTab
public static void main(String[] args)
HashTab prog11 = new HashTab();
Hashtable<String, String>hashData = [Link]("[Link]");
[Link]("File data into Hashtable:\n"+hashData);
[Link](hashData, "vbit");
[Link](hashData, "123");
[Link](hashData, "----");
private void printTheData(Hashtable<String, String>hashData, String
input)
String output = null;
if(hashData != null)
Set<String> keys = [Link]();
if([Link](input))
output = [Link](input);
}
else
Iterator<String> iterator = [Link]();
while([Link]()) {
String key = [Link]();
String value = [Link](key);
if([Link](input))
output = key;
break;
}}}}
[Link]("Input given:"+input);
if(output != null)
[Link]("Data found in HashTable:"+output);
else {
[Link]("Data not found in HashTable");
}}
private Hashtable<String, String>readFromFile(String fileName) {
Hashtable<String, String> hashData = new Hashtable<String, String>();
try {
File f = new File("D:\\java\\"+fileName);
BufferedReader br = new BufferedReader(new FileReader(f));
String line = null;
while((line = [Link]()) != null) {
String[] details = [Link]("\t");
[Link](details[0], details[1]);
} catch (FileNotFoundException e) {
[Link]();
} catch (IOException e) {
[Link](); }
return hashData; } }