Laxmi Institute of Technology, Sarigam

Approved by AICTE, New Delhi; Affiliated to Gujarat Technological University, Ahmedabad

ASSIGNMENT - 1
Department: Information Technology
Name of Subject In charge: Ms. Pooja M. Bharti
Subject Name: Analysis and Design of Algorithms Subject Code: 3150703
Academic Year: 2023-2024 Semester: 5th
Date: 07/08/2023

Sr.
Name of Question
No.
Define an Algorithm. How it differs from flowchart? Discuss key characteristics/properties
01
of algorithm.
02 Write the steps that needs to be followed while designing an algorithm.

03 What is relation? Explain properties of relations.

What is Function? Discuss types of functions. Find the domain and range of the following
relation.
04
{(2,9), (3,14), (4,21)}
Is this relation a function?
What is domain, co-domain and range of a function? Find the domain of the given function:
05
y = (x 2 + x – 5) / (x2 + 3x – 10)
Determine whether R is equivalence relation or not where A={0, 1, 2}, R={(0,0), (1,0),
06
(1,1), (2,2), (2,1)}.
07 What is vector? Which operations are performed on vector?
What is linear equation? Solve the following linear equation by Gauss Elimination method.
x + y + z =3
08
2x + 3y + 7z = 0
x + 3y – 2z =17

Subject In charge
 Laxmi Institute of Technology, Sarigam
Approved by AICTE, New Delhi; Affiliated to Gujarat Technological University, Ahmedabad

ASSIGNMENT - 2
Department: Information Technology
Name of Subject In charge: Ms. Pooja M. Bharti
Subject Name: Analysis and Design of Algorithms Subject Code: 3150703
Academic Year: 2023-2024 Semester: 5th
Date: 28/08/2023

Sr.
Name of Question Remark
No.
Explain an algorithm for Selection Sort Algorithm. Derive its best case,
01 worst case and average case time complexity. Sort the given elements
using Selection Sort: 45, 67, 23, 49, 98, 56.
What is the time complexity of Heap Sort? Sort the given elements with
02 Heap Sort Method: 20, 50, 30, 75, 90, 60, 25, 10, 40.

Why analysis of algorithm is required? List various criteria used for

analyzing an algorithm. Why do we use asymptotic notations in the study
03
of algorithms? Explain the commonly used asymptotic notations in detail
with graph.
Which are the basic steps of counting sort? Write counting sort algorithm.
04
Derive its time complexity in worst case.
Write the algorithm of Insertion Sort. Derive its best and worst case
05 running time. Why it differs? Sort the letters of word “EDUCATION” in
alphabetical order using insertion sort.
Write sequential search algorithm and analyze it for worst case time
06
complexity. Represent its time complexity using Big-oh (O) notation.
Arrange following growth rates in increasing order.
● O(n^(1/4)), O(n^(1.5)), O((n^3) lg n), O(n^(1.02)), Ω(n^6), Ω(n!),
07
O(√n), O(n^(6/2)), Ω(2n)
● 2n, n^2, 1, log n, n log n, 3n, n
Write the algorithm for Bubble Sort. Derive its time complexity in best
08 case and worst case. Apply the bubble sort algorithm for sorting
{U,N,I,V,E,R,S} in alphabetical order.
09 Explain proving loop invariants with example.
Find out the Ө-notation for the function: f(n)=27n^2 + 16n.
10 Find Omega (Ω) notation of function f(n)=2n^2 + 6 n * lg n + 6n.
Find out big-oh notation of the f(n)= 3n^2 + 5n + 10
What is an amortized analysis? Explain various methods of amortized
11
analysis using suitable example.

Subject In charge