Scribd
Upload
4 views

vector_task

Uploaded by

keerthana120520042004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

vector_task

Uploaded by

keerthana120520042004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

import java.util.

Collections;
import java.util.Iterator;
import java.util.Vector;

public class Main {

public static void main(String[] args) {


// Task 1
System.out.println("Task 1:");
Vector<Integer> numbers = new Vector<>();
// Adding 5 elements
Collections.addAll(numbers, 10, 20, 30, 40, 50);

System.out.println("Initial Vector:");
Iterator<Integer> numberIterator = numbers.iterator();
while (numberIterator.hasNext()) {
System.out.println(numberIterator.next());
}

// Removing the 2nd element


numbers.remove(1); // Index starts from 0
System.out.println("\nAfter removing 2nd element:");
numberIterator = numbers.iterator(); // Resetting the iterator
while (numberIterator.hasNext()) {
System.out.println(numberIterator.next());
}

// Checking if the 4th index is present


System.out.println("\nIs 4th index present?");
System.out.println(numbers.size() > 4 ? "true" : "false");

// Checking if a number (e.g., 30) is contained in the vector


int checkNumber = 30;
System.out.println("\nChecking if " + checkNumber + " is present:");
System.out.println(numbers.contains(checkNumber) ? "present" : "not
present");

// Task 2
System.out.println("\nTask 2:");
Vector<String> fruits = new Vector<>();
Collections.addAll(fruits, "Apple", "Banana", "Cherry", "Date",
"Elderberry");

System.out.println("Using for loop:");


for (int i = 0; i < fruits.size(); i++) {
System.out.println(fruits.get(i));
}

System.out.println("\nUsing for-each:");
for (String fruit : fruits) {
System.out.println(fruit);
}

System.out.println("\nUsing iterator:");
Iterator<String> fruitIterator = fruits.iterator();
while (fruitIterator.hasNext()) {
System.out.println(fruitIterator.next());
}

// Task 3
System.out.println("\nTask 3:");
Vector<Integer> fixedVector = new Vector<>(5);
Collections.addAll(fixedVector, 1, 2, 3, 4, 5);

System.out.println("Initial Fixed Vector:");


Iterator<Integer> fixedIterator = fixedVector.iterator();
while (fixedIterator.hasNext()) {
System.out.println(fixedIterator.next());
}

Collections.addAll(fixedVector, 6, 7, 8);
System.out.println("\nAfter adding more elements:");
fixedIterator = fixedVector.iterator(); // Resetting the iterator
while (fixedIterator.hasNext()) {
System.out.println(fixedIterator.next());
}

// Task 4
System.out.println("\nTask 4:");
Vector<Integer> elements = new Vector<>();
Collections.addAll(elements, 50, 10, 40, 30, 20);

System.out.println("Unsorted Vector:");
Iterator<Integer> elementIterator = elements.iterator();
while (elementIterator.hasNext()) {
System.out.println(elementIterator.next());
}

Collections.sort(elements); // Ascending order


System.out.println("\nSorted in Ascending Order:");
elementIterator = elements.iterator(); // Resetting the iterator
while (elementIterator.hasNext()) {
System.out.println(elementIterator.next());
}

Collections.sort(elements, Collections.reverseOrder()); // Descending


order
System.out.println("\nSorted in Descending Order:");
elementIterator = elements.iterator(); // Resetting the iterator
while (elementIterator.hasNext()) {
System.out.println(elementIterator.next());
}

// Task 5
System.out.println("\nTask 5:");
Vector<Integer> searchVector = new Vector<>();
Collections.addAll(searchVector, 100, 200, 300, 400, 500);

System.out.println("Vector Elements:");
Iterator<Integer> searchIterator = searchVector.iterator();
while (searchIterator.hasNext()) {
System.out.println(searchIterator.next());
}
int searchElement = 300;
System.out.println("\nSearching for " + searchElement + ":");
boolean found = false;
int index = 0;

searchIterator = searchVector.iterator(); // Resetting the iterator


while (searchIterator.hasNext()) {
if (searchIterator.next().equals(searchElement)) {
found = true;
System.out.println(searchElement + " is found at index: " +
index);
break;
}
index++;
}
if (!found) {
System.out.println(searchElement + " is not found.");
}
}
}

output

Task 1:

Initial Vector:

10

20

30

40

50

After removing 2nd element:

10

30

40

50

Is 4th index present?

false
Checking if 30 is present:

present

Task 2:

Using for loop:

Apple

Banana

Cherry

Date

Elderberry

Using for-each:

Apple

Banana

Cherry

Date

Elderberry

Using iterator:

Apple

Banana

Cherry

Date

Elderberry

Task 3:

Initial Fixed Vector:

1
2

After adding more elements:

Task 4:

Unsorted Vector:

50

10

40

30

20

Sorted in Ascending Order:

10

20

30

40

50
Sorted in Descending Order:

50

40

30

20

10

Task 5:

Vector Elements:

100

200

300

400

500

Searching for 300:

300 is found at index: 2

You might also like