School of Engineering and Technology

Department of Computer Science and Engineering

Academic Year : 2023-24
BTECH CSE V Sem
Subject Name: Design and Analysis of Algorithms Sub Code:CSE 356
Assignment 1
Date of Submission:28-08-2023 Max Marks: 30

COURSE OUTCOMES

By the end of the course, students will be able to:

CO 1 Analyze the asymptotic performance of algorithms

Describe the dynamic-programming and Greedy paradigm and explain when an
CO 2
algorithmic design situation calls for it.
CO 3 Demonstrate a familiarity with major algorithms and data structures
CO 4 Apply important algorithmic design paradigms and methods of analysis
CO 5 Discuss NP-complete problems and develop algorithms to solve the problems.
CO 6 Choose appropriate algorithm design techniques for solving problems.

Note: Attempt All Questions.

Q. No. Questions Marks

Q1. Highlight the need for the design of an algorithm. 6
Q2. Compare the worst-case time complexity of Merge sort and Insertion 6
sort.
Q3. Explain the various types of asymptotic notations. 6
Q4. State Masters Theorem. Give examples for all the 3 cases. 6
Q5. Consider the given algorithm form the recurrence relation and also solve 6
the recurrence relation using back-Substitution and Recursion-tree
method also show the proper steps and compute the time complexity:
Algorithm Test1 (int n)
{
if (n>0)
{
For (j=1; j<n; j=j*2)
{
Cout<<j;
}
Test1 (n-1);
Test1 (n-1);
}
}