Algorithmics Assignment Page 1 of 2
Algorithmics Assignment Page 1 of 2
Learning Outcomes
INTAKE
HAND OUT DATE As per Moodle
SUBMISSION - PART-A (Algorithms and As per Moodle
Complexity)
SUBMISSION - PART-B (Complexity As per Moodle
Classification)
Assessment Criteria
Referencing: If you use ideas from external sources, e.g. books / magazines /
internet / forums, then proper citation should be done using the Harvard
Name convention within your solution. Failure to reference design /
ideas properly is considered as plagiarism.
Tasks
Numerous algorithms have long been written to solve several problems with the aim of
achieving the best accurate solution in the shortest span of time possible. Although the
computing power of the machines has largely improved over the decade, the time
complexity of the algorithm plays a major role in the effectiveness of the implementation
in solving the given problem.
Identify a problem that is solved using computers. Problems could involve sorting,
searching, path tracing, graph traversals and the like. Identify and explain any 2
algorithms that could be used to solve the problem.
[15 Marks]
Explain the time complexity of the chosen algorithms (Best-Case / Worst-Case). Use the
time complexity measures to explain the suitability of the algorithms to solve a given
problem. You may consider various attributes such as size/ volume of the data, desired
speed of processing etc. to justify your answer
[15 Marks]
Guideline: Length approximately 2000 words.
Deliverables (Part – A)
Documentation (hardcopy)
1. Cover page
2. Marksheet
3. Results
4. References
Tasks
Deliverables
Documentation (hardcopy)
1. Cover page
2. Marksheet
3. Results
4. References