IMS Engineering College

NH-09, Adhyatmik Nagar, Near Dasna, Distt. Ghaziabad, U.P.

Tel: (0120) 4940000

Department of Computer Science & Engineering

Design and Analysis of Algorithms (2023-2024)
Assignment 1

Maximum Marks: 20 Submission Date: 04/10/2023

COURSE OUTCOMES
By the end of the course, students will be able to:
CO No. Description Bloom’s Level
C303.1 Design new algorithms, prove them correct, and analyze their asymptotic and K4, K6
absolute runtime and memory demands.
C303.2 Find an algorithm to solve the problem (create) and prove that the algorithm K5, K6
solves the problem correctly (validate).
C303.3 Understand the mathematical criterion for deciding whether an algorithm is K2, K5
efficient, and know many practically important problems that do not admit any
efficient algorithms.
C303.4 Apply classical sorting, searching, optimization and graph algorithms. K2, K4
C303.5 Understand basic techniques for designing algorithms, including the techniques K2, K3
of recursion, divide-and-conquer, and greedy

ATTEMPT ALL QUESTIONS each question carries equal marks

Q. No. Question CO
What are the steps needed to be followed while designing an algorithm?
1. C303.1
Compare time complexity with space complexity.
2. C303.1
What are the characteristics of the algorithm ?
3. C303.1
Why are asymptotic notations important ?
4. C303.1
Solve the given recurrence T(n) = 4T (n/4) + n.
5. C303.1
Justify why quick sort is better than merge sort?
6. C303.1
Write the names of various design techniques of algorithm.
7. C303.1
Solve the following recurrence using master method:
8. T(n) = 4T (n/3) + n2
C303.1
Find the time complexity of the recurrence relation
9. T(n) = n + T(n/10) + T(7n/5)
C303.1
Rank the following by growth rate :
10. C303.1