Assignments
Homework assignments are individual works. No collaboration among students is permitted.
To receive full credit, the assignment must be submitted by the due date.
Late submissions will incur a penalty of 5% per day.
Important Note:
A variety of techniques, data structures, and algorithms will be studied in this class.
Each assignment aims at some specific areas.
Students are expected to use the specified techniques, data structures, and algorithms to complete each assignment.
Out-of-scope techniques may not meet the assignment requirements. In this case, a code review between the student and instructor may be conducted to determine the level of understanding.
Assignment 1 – Review of COMP2243 Materials
(Due: Wednesday, 8/31/22)
Assignment 2 – ArrayList
(Due: Wednesday, 9/7/22)
Assignment 3 – Aggregation (Due: Monday, 9/19/22)
Assignment 4 – OOP Inheritance (Due: Wednesday, 9/28/22)
Assignment 5 – Recursion (Due: Wednesday, 10/19/22)
Assignment 6 – Sorting and Searching (Due: Saturday, 10/29/22)
Assignment 7 – Linked List (Extra Credit) (Due: Wednesday, 11/9/22)
Assignment 8 – Stack (Due: Wednesday, 11/23/22)
Assignment 9 – Queue (Due: Friday, 12/2/22)
Assignment 10 – Tree, Heap, and Priority Queue (Due: Friday, 12/9/22)
Assignment 3 – Aggregation (Due: Monday, 9/19/22)
Assignment 4 – OOP Inheritance (Due: Wednesday, 9/28/22)
Assignment 5 – Recursion (Due: Wednesday, 10/19/22)
Assignment 6 – Sorting and Searching (Due: Saturday, 10/29/22)
Assignment 7 – Linked List (Extra Credit) (Due: Wednesday, 11/9/22)
Assignment 8 – Stack (Due: Wednesday, 11/23/22)
Assignment 9 – Queue (Due: Friday, 12/2/22)
Assignment 10 – Tree, Heap, and Priority Queue (Due: Friday, 12/9/22)