Algorithmics Assignment Page 1 of 2

The coursework is 50% of the assessment for the module.

Learning Outcomes

1 Evaluate the operation and complexity of various algorithms and Part A

data structures by determining their asymptotic complexity
functions (C5, PLO7)
2 Compare the fundamental concepts of complexity including the P Part B
Vs NP conjecture by determining the time complexity of the
algorithms (C4, PLO7)

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

IMPORTANT: This is a group assignment. All submitted components must be your

own work or appropriately accredited.

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

PART A: Algorithms and Complexity

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]

Asia Pacific University of Technology and Innovation 2021

 Algorithmics Assignment Page 2 of 2

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)

You are required to submit:

Documentation (hardcopy)
1. Cover page
2. Marksheet
3. Results
4. References

Tasks

PART B: Complexity Classification

i) Explain P (Deterministic Polynomial time) problems with a suitable example.

[10 Marks]
ii) Identify and discuss a problem that is considered to be NP (Non-deterministic
Polynomial time).
[10 Marks]
Guideline: Length approximately 1000 words.

Deliverables

You are required to submit:

Documentation (hardcopy)
1. Cover page
2. Marksheet
3. Results
4. References

Asia Pacific University of Technology and Innovation 2021