0% found this document useful (0 votes)
19 views6 pages

Java Collections and Task Management Code

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
0% found this document useful (0 votes)
19 views6 pages

Java Collections and Task Management Code

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

JOSE MIGUEL VIADO JAVA COLLECTIONS NOV 16 2024

PROBLEM 1.)
package javacollection;

import [Link];
import [Link];
import [Link];
import [Link];
import [Link];

public class JavaCollection {


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

Iterator<String> iter = [Link]();


[Link]("ArrayList (Fruits);");
[Link]("Initial List: ");
while([Link]()) {
[Link]([Link]() + " ");
}
[Link]();
[Link]("Element at index 2: " + [Link](2));
[Link](1);
Iterator<String> iterremove = [Link]();

[Link]("After removing 'Orange': ");


while([Link]()) {
[Link]([Link]() + " ");
}
Iterator<String> iterremoves = [Link]();
[Link]();
[Link]("Iterating over ArrayList: ");
while([Link]()) {
[Link]([Link]());
}
[Link]();

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


[Link]("One");
[Link]("Two"); //ADD ELEMENT TO LINKEDLIST
[Link]("Three");
[Link]("Four");

[Link]("LinkedList (Numbers):");
[Link]("Initial List:" + nums);

[Link]("Five"); //ADD "FIVE" AT BEGGINING


[Link]("Nine"); // ADD "NINE" TO END
[Link]("After adding 'Five' at the beginning and
'Nine' at the end: " + nums);

Iterator<String> numss = [Link]();


[Link]("Iterating over LinkedList using
Iterator:");
while([Link]()) {
[Link]([Link]());
}

[Link]();

[Link]("Vector (Colors)");
Vector<String> colors = new Vector<>();

[Link]("Blue");
[Link]("Red");
[Link]("Green"); //ADD ELEMENT TO VECTOR
[Link]("Yellow");

[Link]("Initial Vector: " + colors);

[Link](2, "Purple");
[Link]("After modifying index 2 (Green ->
Purple): " + colors);

Iterator<String> colorss = [Link]();


[Link]("Iterating over Vector:");
while([Link]()) {
[Link]([Link]());
}

[Link]();
[Link]("Stack Operations:");

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

[Link]("Karambit");
[Link]("Talon"); //PUSH ELEMENTS ONTO STACK
[Link]("Bayonet");
[Link]("Initial Stack: " + knife);
[Link]("Peek at top element: " + [Link]());

[Link]("Paracord"); //push an element onto stack


[Link]([Link]()); //peek item at top of stack
[Link]("Stack after push: " + knife);

[Link]("Popped Element: " + [Link]());


[Link]();
[Link]("Stack after pop: " + knife); //peek item
at top of stack

Iterator<String> knives = [Link]();


[Link]("Iterating over Stack:");
while([Link]()) {
[Link]([Link]());
}
}

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

[Link]([Link]());
[Link]("Task 2");
[Link]();

[Link](); //spacer
[Link]([Link]());
[Link]("Task 1");
[Link]();
}

package tms;
import [Link].*;

public class Task {


String taskId;
String taskName;
int priority;

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


[Link] = taskId;
[Link] = taskName;
[Link] = priority;
}

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

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

package tms;

import [Link];
import [Link];
import [Link];
import [Link];

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<>([Link](task -> [Link]));
completedTasks = new HashSet<>();
}

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


{
Task task = new Task(taskId, taskName, priority);
[Link](task);
[Link](task);
}

public String viewHighestPriorityTask() { //aview highest


priority
return "Highest Priority: " + [Link]();
}

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


complete
for (Task task : taskQueue) {
if ([Link](taskId)) {
if (![Link](task)) {
[Link](task);
[Link](task);
[Link](taskId + " marked as
completed.");
}
return;
}
}
[Link]("Task not found.");
}

public void viewCompletedTasks() {


if ([Link]()) { //if [Link] = true print
[Link]("No tasks have been completed.");
} else { //if not empty display complted tasks
[Link]("Completed Tasks:");
for (Task task : completedTasks) {
[Link](task);
}
}
}
}

You might also like