CST3130

Testing and Verification Approaches to Algorithms and Data Structures

Scenario

1. Each week, a new exercise is given (i.e., implement a linked-list).
2. Utilise test-driven development to implement the exercises.
3. Maximise the branch coverage for each exercise.

Each laboratory's tasks are listed below.

To view more details, please click the '✅' for more information.

Laboratory Week	Exercise	Link to repository
1	Program for Array Rotation	✅
2	Maximum Sum of an Hourglass in a Matrix	✅
3	Linked-List	✅
4	Check Whether a List is Palindrome	✅
5	Circular Queue	✅
6	Binary Tree	✅
7	Turning Numbers into English	✅
8	-	-
9	-	-
10	-	-
11	-	-
12	-	-
13	Introduction to Contact	✅
14	-	-
15	-	-
16	-	-
17	-	-
18	-	-
19	-	-
20	-	-
21	-	-
22	-	-
23	-	-
24	-	-
- In this context, means that there was no work that week or it is yet to be revealed.