Assignment 1 Set B Q1

import java.util.*;
public class J2As1SetB1
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println(“How many numbers you want to add…? “);
int n = sc.nextInt();
SortedSet<Integer> set = new TreeSet<>();
System.out.println(“Enter the numbers”);
for(int i=0;i<n;i++)
{
int num = sc.nextInt();
set.add(num);
}
System.out.println(“Sorted Integers / Numbers are : “);
for(int num : set)
{
System.out.println(num);
}
}
}

Assignment 1 Set B Q2

import java.util.*;
public class J2As1SetB1
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println(“How many numbers you want to add…? “);
int n = scanner.nextInt();
sortedSet<Integer> set = new TreeSet<>();
System.out.println(“Enter the numbers”);
for(int i=0;i<n;i++)
{
int num = Scanner.nextInt();
set.add(num);
}
System.out.println(“Sorted Integers / Numbers are : “);
for(int num : set)
{
System.out.println(num);
}
}
}

 

 

 

import java.util.LinkedList;
import java.util.Iterator;

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

// Create LinkedList of String objects
LinkedList<String> list = new LinkedList<>();

// i. Add elements at the end of the list
list.add(“Apple”);
list.add(“Banana”);
list.add(“Mango”);
list.add(“Orange”);

System.out.println(“Original LinkedList:”);
System.out.println(list);

// ii. Delete first element of the list
list.removeFirst();

System.out.println(“\nAfter deleting first element:”);
System.out.println(list);

// iii. Display contents of list in reverse order
System.out.println(“\nLinkedList in reverse order:”);
Iterator<String> itr = list.descendingIterator();
while (itr.hasNext()) {
System.out.println(itr.next());
}
}
}