TDA3231 Algorithm Design and Analysis

PROJECT GUIDELINES

1. General Guidelines

1. Form a group of 2, 3 or 4 members from same lab session.

a. Students are to work in a group.
b. Choose members who can work together.
c. No sleeping member is allowed (in case of any sleeping member, kindly report
as soon as possible and the member need to work alone and submit the
project individually).
2. Choose a topic (the topic will be similar for project Part 1 and project Part 2). Refer to
the list of topics and choose one).
a. Register your topic through this excel file:
TDA3231 Group Registration Form
b. No group should have the similar topics within same lab session.
c. Due date of registration: 12/04/2024
3. Format of the report: Times New Roman, 1.5 lines spacing, size 14 for header, size 12
for contents, justify the paragraph, properly label tables and figures.

4. Due date of submission:

a. 21/6/2024 (Week 13, Friday)
Submit to: Microsoft Team Classroom under Assignment Channel

5. Presentation: 24/6/2024 – 5/7/2024

6. For cover page, refer to Appendix 1.
7. For reference format, refer
https://libraryguides.vu.edu.au/ieeereferencing/gettingstarted
8. For your information, project is a component of final assessment. Thus, the mark will
not be released to students. Total mark for this project is 40%.
9. You may choose from the following titles or propose your own title. If the title is too
general, you can always narrow it down and focus on a sub topic. For e.g., sorting
data in array, you may come across different sorting technique such as merge sort,
radix sort and quick sort. You can focus on one of the sorting techniques, such as
quick sort, where quick sort consists of different improved versions. This will allow
you to perform proper algorithm comparison. For certain algorithms that do not have
improved version, you may compare two different algorithms but solving similar
application. For e.g.: Prims and Kruskal are both used to find minimum spanning tree
in solving the network communication design of wires/points.

No Application

1 Sudoku Puzzle

2 Job Assignment

3 Shortest Path/Route/Network

4 Search Engine focusing on Web Crawlers

5 Crossword puzzle

1
TDA3231 Algorithm Design and Analysis

6 Chess board

7 Knapsack

8 Task Scheduling

9 Sorting Images/Objects

10 Randomization in Machine Learning

11 Travelling Salesman Problem

12 Feature Selection

13 Clustering (suggestion: choose one clustering technique but different algorithm

design approach)

14 Classification (suggestion: choose one classifier but different algorithm design

approach)

15 Indoor Positioning

16 Resource Management

17 Image Segmentation

18 Text Segmentation

19 Web Searching

20 Recommendation System

10. A sample of good review paper is shared (see Appendix 2). You need to choose an
application, and discover the algorithm design technique that has been used to solve
and improve the performance of the algorithm.
11. Marks are deducted if the contents have low clarification, and copy paste the
statement from articles.
12. Refer to Rubrics.xlsx for the marking scheme.

2. About the contents:

a. Introduction & Research Questions

Describe the application (what it is, why can it solve, what is the first initial
version, what researchers try to improve)
Research question (what you want to study/explore in this literature review,
such as what are the improvement have been done, how do the algorithms
design differ from each other; what are the strengths/weakness in each

2
TDA3231 Algorithm Design and Analysis

design; what are the remaining challenges etc) ~ three to four research
questions are more than enough
b. Review different designs of algorithms that improve the application.
i. Review AT LEAST THREE of the revised/improved version of a similar
algorithms OR
ii. Review different algorithms that solve the similar problem
iii. Review should include but not limited to this information: who has
invented it, what kind of design technique is used (dynamic, divide
conquer, recursive, linked list, matrix etc), why the improvement is
suggested.
iv. What are the strengths and weaknesses of each technique
v. Any remaining challenges
c. Tips to perform search in getting useful articles
(i) Go to https://scholar.google.com.my/
(ii) Key in the search keywords (refer to Appendix 2 and define a proper sets
of keywords), such as ‘Quick sort review’ (see Figure 1).

Figure 1. Sample Output After Search

(iii) Click the relevant articles. In case if payment is needed, you can try to
access by using Open Athens where login through MMU IDM username and
password are needed. For databases that have subscribed by MMU, you
can freely download the article without payment.
(iv) When you get one relevant article, you can always get other relevant
articles through the Cited by (see the yellow highlighted part in the Figure
1)
d. The review needs to consists of at least 20 or more articles in your
reference list.
e. Project Part 2 is focusing on the algorithm analysis and experiment. Select AT
LEAST THREE algorithms. The algorithms need to be coded either in C++ or
Python (choose only 1 language and all your algorithms must write in similar
programming language).

3
TDA3231 Algorithm Design and Analysis

f. You can obtain the code from Internet, but remember to cite the source of
reference. Otherwise, mark is deducted.
g. Theoretical analysis: analyse the design of each selected algorithm by using
asymptotic analysis (show the steps).
h. Experimental analysis: analyse the execution time of your selected algorithms
through experiments.
i. You need to provide input with different number of input sizes (enough
for you to construct the graph).
ii. Produce a graph which shows the execution time (y-axis, time could be
in minutes/seconds/milliseconds) vs sizes of input (x-axis) of each
algorithm.
iii. Analyse the graph.
k. Summarise the overall results by comparing between the theoretical analysis and
experimental analysis in terms of the growth of function and execution time.
l. Propose a new version that improve the algorithm or how you can modify the
algorithm to solve other real-world problem (solution that is not yet discover by
the other).
(i) Explain about your idea of design or solution
(ii) Justify the possibility of implementing it
m. Refer to Appendix 3a for sample report (just for reference and may not be
correct).

4. Submission (put all into 1 zip folder with LabSection_GroupNo_LeaderID ((e.g.:

1A_G1_1121156553)))
1. Group declaration form (no sleeping member is allowed, any complaint from the
leader will cost the member to obtain zero mark (so choose a good leader and be a
good member))
2. Report for project part 1
a. Cover page
b. Table of Contents
c. Abstract
d. Introduction & Research Questions
e. Research Method
f. Related Studies
g. Theoretical analysis
h. Experimental analysis
i. Discussion/Suggestion/New ideas of improvement
j. Conclusion
k. Appendix: Coding of those algorithms
l. References
3. Programs (.cpp & .py) ~
a. Properly name your file
4. Presentation slides (refers to Appendix 3b)
5. Items to include for project submission and name the folder as
LabSection_GroupNo_LeaderID:
a. Group declaration form
b. Report
c. Presentation slides
d. Programs
e. Marking scheme (using excel file)