BANSAL INSTITUTE OF SCIENCE AND TECHNOLOGY
Analysis Design of Algorithm: CS-402
Department of Computer Science and Engineering
Assignment-1
BRANCH: CSE
SECTION-A
Issue Date: 06/03/2024
Submission Date: 11/03/2024
Return Date : 13/03/2024
Faculty: Dr. Nikhlesh Pathik
:
Learning
S.N Questions CO
Level
Batch I (01-17)
Define an algorithm. Explain Pseudocode and program.
Q.1 CO-1 L-2
Explain how time complexity of an algorithm can be
Q.2 calculated. Give suitable example. CO-1 L-4
Describe about various types of asymptotic notations used
Q.3 in algorithm analysis. CO-1 L-2
Q.4 Explain briefly binary search technique. CO-1 L-4
Write quick sort algorithm. Discuss its time complexity.
Q.5 CO-1 L-5
Batch II (18-33)
Discuss important characteristics of an algorithm.
Q.1 CO-1 L-2
What are the factors which affect the running time of an
Q.2 algorithm? CO-1 L-2
Explain heap sort algorithm with example.
Q.3 CO-1 L-4
Q.4 Design a recursive algorithm for binary search. CO-1 L-4
Explain the Strassen’s multiplication technique.
Q.5 CO-1 L-4
Batch III (35-50)
Explain the various criteria used for analyzing algorithm.
Q.1 CO-1 L-4
Explain heap sort algorithm with example.
Q.2 CO-1 L-4
Following nodes are inserted in empty tree, to form
minimum heap. With neat sketches show how insertion will
Q.3 CO-1 L-3
be done-8,7,11,6,2,1,5,12
Write a short note on merge sort.
Q.4 CO-1 L-5
Write the algorithm for binary search. Apply binary search
to find 122 in a list-
Q.5 CO-1 L-5
44,95,104,120,144,191,198,204,244,274,122,849,904.
Batch IV (51-66)
Discuss how to analyze algorithms.
Q.1 CO-1 L-2
What are the factors which affect the running time of an
Q.2 algorithm? CO-1 L-2
Sort the following list using heapsort-
Q.3 66,33,40,20,50,88,60,11,77,30,45,65 CO-1 L-5
Write merge sort algorithm and analyse your algorithm of
Q.4 different case. CO-1 L-5
Sort the given list using mergesort-
Q.5 70,80,40,50,60,12,35,95,10 CO-1 L-5
Batch V (67-75& D07-D12)
What do you understand by best case, average case and
Q.1 worst case of an algorithm? CO-1 L-2
What do you understand by the term asymptotics?
Q.2 CO-1 L-2
What is divide and conquer strategy? Write and explain the
Q.3 algorithm of divide and conquer. CO-1 L-2
Write a short note on quicksort.
Q.4 CO-1 L-5
Sort the following list using quicksort-
Q.5 36,95,42,12,08,66,72,55 CO-1 L-5
