Troubleshooting:
If the given project (e.g. Q1) runs with error, you need to run "Clean and Build Project" (Shift+F11). If
still error, try to rename or copy the project to other one, e.g. from Q1 to Q1X or Q1Y.
Questions: (10 marks)
Scenario:
You will complete a Python program that simulates the Task Management System. This system uses a
Binary Search Tree and a Queue to manage a series of given tasks.
Class Structure:
•
.
Task: Contains information of a single task: taskId (String), description (String) and priority
(int)
TreeNode: Includes a Task object, a left pointer and a right pointer for Binary Search Tree
structure.
.
QueueNode: Includes a Task object, a next pointer for Queue structure.
Zoom
- FUO
•
•
TaskBST: A Binary Search Tree structure. This tree stores given tasks by the normal BST order
based on priority.
Completion Queue: A Queue structure (implemented as a linked list). This queue is used to
manage the given tasks in FIFO (First-In, First-Out) order.
Students are required to carefully read the provided code segments to fully understand the relationships
between the classes and the functions within each class. The specific task of the test is to execute the
following requirements:
1. f10-2.5 marks: Implement Basic Queue Operations
•
File: CompletionQueue.java
•
Methods to Complete:
o enqueue(Task task)
o isEmpty()
+ 100%
Close
