Professional Documents
Culture Documents
Question 1 (30 marks) 300-500 words per discussion and avoid plagiarism.
i. Design an algorithm an algorithm that solves for the following equation. Show the
steps only.
𝑎𝑥
𝑦= + 2𝑥
𝑡
ii. Produce the flow chart for the equation in i.
iii. Discuss two importance of algorithms and provide an example each.
iv. Discuss time complexity and use examples to give scenarios.
v. Discuss space complexity and use examples to give scenarios.
vi. Discuss NP vs P and use examples to give scenarios
Note: Providing examples to explain your point during discussion will earn you more marks.
Question 2 (20 marks) 300-500 words per discussion and avoid plagiarism.
Discuss the following the following and provide scenarios each. Consider engineering-based
domains when using examples.
a. Dynamic Programming
b. Asymptotic Analysis
c. Greedy Algorithms
d. Divide and Conquer
Question 4 (25 marks) 300-500 words per discussion and avoid plagiarism.
a. Discuss the following derived and built-in data types. Provide examples each using c++
codes.
List
Stack
Arrays
Queue
a. https://smallpdf.com/compress-pdf
b. https://www.ilovepdf.com/compress_pdf
Online Submission Instructions