Scribd
Upload
5 views

Java Collections

Uploaded by

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

Java Collections

Uploaded by

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

JOSE MIGUEL VIADO JAVA COLLECTIONS NOV 16 2024

PROBLEM 1.)
package javacollection;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Vector;
import java.util.Stack;
import java.util.Iterator;

public class JavaCollection {


public static void main(String[] args) {
ArrayList<String> fruits = new ArrayList<>();
fruits.add("Mango"); //ADD ALEMENTS TO ARRAYLIST
fruits.add("Orange");
fruits.add("Pineapple");
fruits.add("Apple");

Iterator<String> iter = fruits.iterator();


System.out.println("ArrayList (Fruits);");
System.out.print("Initial List: ");
while(iter.hasNext()) {
System.out.print(iter.next() + " ");
}
System.out.println();
System.out.println("Element at index 2: " + fruits.get(2));
fruits.remove(1);
Iterator<String> iterremove = fruits.iterator();

System.out.print("After removing 'Orange': ");


while(iterremove.hasNext()) {
System.out.print(iterremove.next() + " ");
}
Iterator<String> iterremoves = fruits.iterator();
System.out.println();
System.out.println("Iterating over ArrayList: ");
while(iterremoves.hasNext()) {
System.out.println(iterremoves.next());
}
System.out.println();

LinkedList<String> nums = new LinkedList<String>();


nums.add("One");
nums.add("Two"); //ADD ELEMENT TO LINKEDLIST
nums.add("Three");
nums.add("Four");

System.out.println("LinkedList (Numbers):");
System.out.println("Initial List:" + nums);

nums.addFirst("Five"); //ADD "FIVE" AT BEGGINING


nums.addLast("Nine"); // ADD "NINE" TO END
System.out.println("After adding 'Five' at the beginning and
'Nine' at the end: " + nums);

Iterator<String> numss = nums.iterator();


System.out.println("Iterating over LinkedList using
Iterator:");
while(numss.hasNext()) {
System.out.println(numss.next());
}

System.out.println();

System.out.println("Vector (Colors)");
Vector<String> colors = new Vector<>();

colors.addElement("Blue");
colors.addElement("Red");
colors.addElement("Green"); //ADD ELEMENT TO VECTOR
colors.addElement("Yellow");

System.out.println("Initial Vector: " + colors);

colors.set(2, "Purple");
System.out.println("After modifying index 2 (Green ->
Purple): " + colors);

Iterator<String> colorss = colors.iterator();


System.out.println("Iterating over Vector:");
while(colorss.hasNext()) {
System.out.println(colorss.next());
}

System.out.println();
System.out.println("Stack Operations:");

Stack<String> knife = new Stack<>();

knife.push("Karambit");
knife.push("Talon"); //PUSH ELEMENTS ONTO STACK
knife.push("Bayonet");
System.out.println("Initial Stack: " + knife);
System.out.println("Peek at top element: " + knife.peek());

knife.push("Paracord"); //push an element onto stack


System.out.println(knife.peek()); //peek item at top of stack
System.out.println("Stack after push: " + knife);

System.out.println("Popped Element: " + knife.peek());


knife.pop();
System.out.println("Stack after pop: " + knife); //peek item
at top of stack

Iterator<String> knives = knife.iterator();


System.out.println("Iterating over Stack:");
while(knives.hasNext()) {
System.out.println(knives.next());
}
}

}
PROBLEM 2.)
package tms;
public class TMS {
public static void main(String[] args) {
ManageMe task = new ManageMe();
//add task with taskid, taskname, taskpriority
task.addTask("Task 1", "Water Plant", 2);
task.addTask("Task 2", "Grocery", 1);
task.addTask("Task 3", "Read Comic", 4);

System.out.println(task.viewHighestPriorityTask());
task.completeTask("Task 2");
task.viewCompletedTasks();

System.out.println(); //spacer
System.out.println(task.viewHighestPriorityTask());
task.completeTask("Task 1");
task.viewCompletedTasks();
}

package tms;
import java.util.*;

public class Task {


String taskId;
String taskName;
int priority;

public Task(String taskId, String taskName, int priority) {


this.taskId = taskId;
this.taskName = taskName;
this.priority = priority;
}

@Override
public boolean equals(Object obj) {
if (this == obj) return true;
if (obj == null || getClass() != obj.getClass()) return
false;
Task task = (Task) obj;
return taskId.equals(task.taskId);
}
@Override
public int hashCode() {
return Objects.hash(taskId);
}

@Override
public String toString() {
return taskId + ": " + taskName + " (Priority " + priority +
")";
}
}

package tms;

import java.util.ArrayDeque;
import java.util.Comparator;
import java.util.HashSet;
import java.util.PriorityQueue;

public class ManageMe {


private final ArrayDeque<Task> taskQueue;
private final PriorityQueue<Task> priorityQueue;
private final HashSet<Task> completedTasks;

public ManageMe() {
taskQueue = new ArrayDeque<>();
priorityQueue = new
PriorityQueue<>(Comparator.comparingInt(task -> task.priority));
completedTasks = new HashSet<>();
}

public void addTask(String taskId, String taskName, int priority)


{
Task task = new Task(taskId, taskName, priority);
taskQueue.add(task);
priorityQueue.add(task);
}

public String viewHighestPriorityTask() { //aview highest


priority
return "Highest Priority: " + priorityQueue.peek();
}

public void completeTask(String taskId) { //declare a task as


complete
for (Task task : taskQueue) {
if (task.taskId.equals(taskId)) {
if (!completedTasks.contains(task)) {
completedTasks.add(task);
priorityQueue.remove(task);
System.out.println(taskId + " marked as
completed.");
}
return;
}
}
System.out.println("Task not found.");
}

public void viewCompletedTasks() {


if (completedTasks.isEmpty()) { //if es.empty = true print
System.out.println("No tasks have been completed.");
} else { //if not empty display complted tasks
System.out.println("Completed Tasks:");
for (Task task : completedTasks) {
System.out.println(task);
}
}
}
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy