CCCS 314 - Design and Analysis of Algorithms Assignment 1 Topics: [PLO K2 CLO 1.2] 1. Algorithm analysis 2. Asymptotic notations and basic efficiency classes 3. Mathematical analysis of non-recursive algorithms 4. Mathematical analysis of recursive algorithms Total Marks: 5(0.510) Student Name: Student ID: (Algorithm Analysis) 1. For each of the following algorithms, determine the basic operation: a) Computing the sum of n numbers. Answer: b) Computing n ! Answer: c) Finding the largest element in a list of n numbers. Answer: 2. For each of the following functions, indicate how much the function's value will change if its argument is increased four times (which means that n is changed to 4n). a) log2n b) n c) n2