Compare commits

..

10 Commits

Author SHA1 Message Date
be014379b3 fixed naming 2026-02-12 15:10:09 +05:30
a691a1d345 program 17-18B 2026-02-12 15:06:09 +05:30
7aec4f3c6b program 16 2026-02-12 14:40:32 +05:30
1a6f71bf5b program 15 2026-02-12 14:30:38 +05:30
7cab60365e fixed 14B and added correct screenshot 2026-02-12 14:15:24 +05:30
8df65fed09 program 14B 2026-02-12 14:08:05 +05:30
5fa828016b program 14A 2026-02-12 14:01:05 +05:30
6f8591833b program 13B 2026-02-12 13:46:01 +05:30
4157cd4650 program 13 2026-02-05 15:15:27 +05:30
d392daa7cc program 12 2026-02-05 14:50:46 +05:30
24 changed files with 209 additions and 0 deletions

20
LinkedListDemo.java Normal file
View File

@@ -0,0 +1,20 @@
// 13 write a java program to demonstrate linked list
import java.util.LinkedList;
public class LinkedListDemo{
public static void main(String[] args){
LinkedList<String> linkedList = new LinkedList<>();
linkedList.add("Element A");
linkedList.add("Element B");
linkedList.add("ELement C");
System.out.println("Element at index 0: " + linkedList.get(0));
System.out.println("Element at index 1: " + linkedList.get(1));
System.out.println("Element at index 2: " + linkedList.get(2));
System.out.println("Liniked List Elements");
for(String element: linkedList){
System.out.println(element);
}
linkedList.remove("Element B");
System.out.println("Size of linked List after removal: "+ linkedList.size());
}
}

BIN
Screenshots/program12.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 24 KiB

BIN
Screenshots/program13.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 17 KiB

BIN
Screenshots/program13B.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 8.1 KiB

BIN
Screenshots/program14A.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 8.6 KiB

BIN
Screenshots/program14B.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 18 KiB

BIN
Screenshots/program15.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 15 KiB

BIN
Screenshots/program16.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 7.4 KiB

BIN
Screenshots/program17A.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 7.7 KiB

BIN
Screenshots/program17B.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 7.7 KiB

BIN
Screenshots/program17C.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 8.1 KiB

BIN
Screenshots/program18A.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 7.4 KiB

BIN
Screenshots/program18B.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 25 KiB

22
SortingPracticalMain.java Normal file
View File

@@ -0,0 +1,22 @@
// 12 write a java program for sorting array list
import java.util.*;
public class SortingPracticeMain{
public static void main(String[] args){
ArrayList<String> arrayList = new ArrayList<>();
arrayList.add("Sourav Ganguli");
arrayList.add("Sachin Tendulkar");
arrayList.add("Rahul Dravid");
arrayList.add("Zaheer Khan");
arrayList.add("Yuvraj Singh");
arrayList.add("Harbhajan Singh");
arrayList.add("Javagal Srinath");
arrayList.add("Ashish Nehra");
arrayList.add("Virendra Sehwag");
arrayList.add("Ajit Agarkar");
arrayList.add("Mohammad Kaif");
System.out.println("Unsorted list: " + arrayList);
Collections.sort(arrayList);
System.out.println("Sorted list: " + arrayList);
}
}

16
TestJavaCollection10.java Normal file
View File

@@ -0,0 +1,16 @@
// 17C
import java.util.*;
public class TestJavaCollection10{
public static void main(String args[]){
LinkedHashSet<String> set = new LinkedHashSet<>();
set.add("Ravi");
set.add("Vijay");
set.add(null);
set.add("Ravi");
set.add("Ajay");
Iterator<String> itr = set.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

15
TestJavaCollection11.java Normal file
View File

@@ -0,0 +1,15 @@
// 18A write a java code to demonstrate treeset
import java.util.*;
public class TestJavaCollection11{
public static void main(String args[]){
TreeSet<String> set = new TreeSet<>();
set.add("Ravi");
set.add("Vijay");
set.add("Ravi");
set.add("Ajay");
Iterator<String> itr = set.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

17
TestJavaCollection12.java Normal file
View File

@@ -0,0 +1,17 @@
// 18B write a java code to demonstrate treeset
import java.util.*;
public class TestJavaCollection12{
public static void main(String args[]){
TreeSet<String> set = new TreeSet<>();
set.add("Ravi");
set.add("Vijay");
set.add(null);
set.add("Ravi");
set.add("Ajay");
Iterator<String> itr = set.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

15
TestJavaCollection2.java Normal file
View File

@@ -0,0 +1,15 @@
// 13B
import java.util.*;
public class TestJavaColection2 {
public static void main(String args[]){
LinkedList<String> al = new LinkedList<>();
al.add("Ravi");
al.add("Vijay");
al.add("Ravi");
al.add("Ajay");
Iterator<String> itr = al.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

15
TestJavaCollection3.java Normal file
View File

@@ -0,0 +1,15 @@
// 14 Write a java code to demonstrate java code
import java.util.*;
public class TestJavaCollection3{
public static void main(String args[]){
Vector<String> vector = new Vector<>();
vector.add("Ayush");
vector.add("Amit");
vector.add("Ashish");
vector.add("Garima");
Iterator<String> itr = vector.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

22
TestJavaCollection4.java Normal file
View File

@@ -0,0 +1,22 @@
// 15 write a java code to demonstrate stack
import java.util.*;
public class TestJavaCollection4 {
public static void main(String args[]){
Stack<String> stack = new Stack<>();
stack.push("Ayush");
stack.push("Garvit");
stack.push("Amit");
stack.push("Garima");
Iterator<String> itr = stack.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
String topElement = stack.peek();
System.out.println("The top element of the stack is: " + topElement);
stack.pop();
System.out.println("After POP");
for(String element: stack){
System.out.println(element);
}
}
}

15
TestJavaCollection7.java Normal file
View File

@@ -0,0 +1,15 @@
// 16 write a java program to demonstrate HashSet
import java.util.*;
public class TestJavaCollection7{
public static void main(String args[]){
HashSet<String> set = new HashSet<String>();
set.add("Ravi");
set.add("Vijay");
set.add("Ravi");
set.add("Ajay");
Iterator<String> itr = set.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

16
TestJavaCollection8.java Normal file
View File

@@ -0,0 +1,16 @@
// 17A write a java code to demonstrate linked hash set
import java.util.*;
public class TestJavaCollection8{
public static void main(String args[]){
LinkedHashSet<String> set = new LinkedHashSet<>();
set.add("Ravi");
set.add("Vijay");
set.add("Ravi");
set.add("Ajay");
Iterator<String> itr = set.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

17
TestJavaCollection9.java Normal file
View File

@@ -0,0 +1,17 @@
// 17B
import java.util.*;
public class TestJavaCollection9{
public static void main(String args[]){
LinkedHashSet<String> set = new LinkedHashSet<>();
set.add("Ravi");
set.add("Vijay");
set.add("");
set.add("Ravi");
set.add("Ajay");
Iterator<String> itr = set.iterator();
while(itr.hasNext()){
System.out.println(itr.next());
}
}
}

19
VectorDemo.java Normal file
View File

@@ -0,0 +1,19 @@
// 14B
import java.util.Vector;
public class VectorDemo{
public static void main(String[] args){
Vector<String> vector = new Vector<>();
vector.add("Item X");
vector.add("Item Y");
vector.add("Item Z");
System.out.println("Elements at index 0: " + vector.get(0));
System.out.println("Elements at index 1: " + vector.get(1));
System.out.println("Elements at index 2: " + vector.get(2));
System.out.println("Vector Elements: ");
for(String element: vector){
System.out.println(element);
}
vector.remove("Item Y");
System.out.println("Size of Vector afte removal: " + vector.size());
}
}