Register No.

FACULTY OF ENGINEERING & TECHNOLOGY, SRM UNIVERSITY

DEPARTMENT OF INFORMATION TECHNOLOGY

Cycle Test – I/Evaluation form

Academic Year: 2016-2017

Program offered: B.Tech(IT) Year / Sem: II/IV

Max. Marks: 50 Duration: 2 Periods
Date of Exam: 3-3-17
Course Code and Title : 15CS204J- Algorithm Design and Analysis

PURPOSE To acquire the ability of applying various algorithmic concepts for all domains and efficient interpretation of
real life problems.

Instructional Objectives
IO–No. Instructional Objective Student Outcome

1 Apply Mathematical concepts and notations to define a problem a

Student Learning Outcomes

LO–No. Instructional Objective

a An ability to apply knowledge of computing, mathematics and basic sciences appropriate to the
discipline

a1 Combines mathematical and /or scientific principles to formulate models of core application
domain

a2 Translates academic theory into engineering applications and accepts limitations of computing,
mathematics and /or basic sciences appropriate to the discipline

11 Reference to Reference to Marks Allotted Marks Scored Outcomes

IO Outcome (Total 50) Met Yes / No

1. 2 a2 4
2. 1 a1 4
3. 1 a1 4
4. 1 a1 4
5. 2 a2 4
6. 1 a1 15
7. 2 a2 15
TOTAL

Faculty Name:

Signature:
 Register No.

FACULTY OF ENGINEERING & TECHNOLOGY, SRM UNIVERSITY

DEPARTMENT OF INFORMATION TECHNOLOGY

Cycle Test – I/Question paper

Academic Year: 2016-2017
Program offered: B.Tech( IT ) Year / Sem: II/IV
Max. Marks: 50 Duration: 2 Periods
Date of Exam: 3-3-17
Course Code and Title : 15CS204J- Algorithm Design and Analysis
SET - A1
PART A
Answer ALLquestions 5*4=20
Sl. Question Course Marks
No Outcome
1 Build an algorithm with the time complexity of O(log n) a2 4
to search a number in a sorted list.
2 Solve the recurrence relation Cn = Cn-1 +n, n≥1, C0=0 a1 4
by substitution method.
3 a1 4
Prove the equation
using mathematical induction.
4 With an example derive the time complexity of an a1 4
algorithm using line count.
5 Write a straight forward algorithm for finding max a2 4
min in an array.

PART B
Answer any TWO questions 2*15=30

Sl. Question Course Marks

No Outcome
6. a1
i. Derive the recurrence tree for T(n)=3T(n/4)+cn2 and
find time complexity in "Big-oh" notation for the 10
given recurrence relation.
ii.
Apply Masters theorem to solve the following
5
equations:
a) T(n) = 9T(n/3)+n
b) T(n) =2 T(n/2)+n
OR
Write a recursive program to calculate sum of n
numbers. Find the recurrence relation for the same 15
and solve it using substitution method.

7 Write an algorithm to find out the Strassen's matrix a2 15

multiplication using divide and conquer method.
Derive its time complexity.
OR
Analyze the best ,worst and average time
complexity of quick sort. Also explain the quick
 sort algorithm.

Register No.

FACULTY OF ENGINEERING & TECHNOLOGY, SRM UNIVERSITY

DEPARTMENT OF INFORMATION TECHNOLOGY

Cycle Test – I/Question paper

Academic Year: 2016-2017
Program offered: B.Tech( IT ) Year / Sem: II/IV
Max. Marks: 50 Duration: 2 Periods
Date of Exam: 3-3-17
Course Code and Title : 15CS204J- Algorithm Design and Analysis
SET - B1
PART A
Answer ALLquestions 5*4=20
Sl. Question Course Marks
No Outcome
1 Justify: Strassen's matrix multiplication takes less time a2 4
complexity in comparison with conventional matrix
multiplication.
2 Solve the recurrence relation tn = tn-1 +n2, n≥1, t1=1 a1 4
by substitution method.
3 a1 4
Prove the equation using
mathematical induction.
4 With an example derive the time complexity of an a1 4
algorithm using operation count.
5 Write an efficient iterative searching algorithm for a a2 4
give sorted list.

PART B
Answer any TWO questions 2*15=30

Sl. Question Course Marks

No Outcome
6.i. Derive the recurrence tree for T(n)=T(n/3)+T(2n/3)+n and a1 15
find time complexity in "Big-oh" notation for the given
recurrence relation.
ii. Apply Masters theorem to solve the following equations:
a) T(n) = 4T(n/2)+n2
b) T(n) =16 T(n/4)+n
OR
Write a recursive program to calculate Fibonacci series.
Find the recurrence relation for the same and solve it using
substitution method.
7 Write an algorithm to find out the closest pair points using a2 15
divide and conquer method. Derive its time complexity.
OR
Analyze the best ,worst and average time complexity of
merge sort. Also explain the merge sort algorithm.

Register No.

FACULTY OF ENGINEERING & TECHNOLOGY, SRM UNIVERSITY

DEPARTMENT OF INFORMATION TECHNOLOGY
Cycle Test – I/Question paper
Academic Year: 2016-2017
Program offered: B.Tech( IT ) Year / Sem: II/IV
Max. Marks: 50 Duration: 2 Periods
Date of Exam: 3-3-17
Course Code and Title : 15CS204J- Algorithm Design and Analysis
SET - A2
PART A
Answer ALLquestions 5*4=20
Sl. Question Course Marks
No Outcome
1 Justify: the merge part of the closest pair algorithm using a2 4
divide and conquer, takes 7n operations.
2 Solve the recurrence relation tn = tn-1 +2, t0=1 by a1 4
substitution method.
3 a1 4
Prove the equation
using mathematical induction.
4 Prove that if T(n)=15n3+n2+4, T(n)=Ω(n2) a1 4

5 a2 4
Solve X using strassen's matrix

multiplication.

PART B
Answer any TWO questions 2*15=30

Sl. Question Course Marks

No Outcome
6.i. Derive the recurrence tree for T(n)=2T(n/2)+n 2 and find a1 15
time complexity in "Big-oh" notation for the given
recurrence relation.
ii. Apply Masters theorem to solve the following equations:
a) T(n) = T(2n/3)+1
b) T(n) =3T(n/4)+n log n
OR
Write a recursive program to convert decimal number to
binary. Find the recurrence relation for the same and solve
it using substitution method.

7 Explain MaxMin algorithm using divide and conquer a2 15

method and derive its time complexity. Trace the recursion
for the following list of numbers using MaxMin algorithm:
99,56,43,-3,10,102,82,3.
OR
Write iterative and recursive binary search algorithms with
example. Analyze the time complexity of the algorithms
and mention the efficient algorithm out of the two
algorithms.

Register No.

FACULTY OF ENGINEERING & TECHNOLOGY, SRM UNIVERSITY

DEPARTMENT OF INFORMATION TECHNOLOGY

Cycle Test – I/Question paper

Academic Year: 2016-2017
Program offered: B.Tech( IT ) Year / Sem: II/IV
Max. Marks: 50 Duration: 2 Periods
Date of Exam: 3-3-17
Course Code and Title : 15CS204J- Algorithm Design and Analysis
SET - B2
PART A
Answer ALLquestions 5*4=20
Sl. Question Course Marks
No Outcome
1 Write a general algorithm for divide and conquer a2 4
strategy.
2 Solve the recurrence relation Cn = n+Cn/2 , where n is a1 4
the power of 2, C1=0 by substitution method.
3 a1 4
Prove the equation using
mathematical induction.
4 Prove that if T(n)=6n3, T(n)=Ɵ(n2) a1 4

5 a2 4
Solve X using strassen's matrix

multiplication

PART B
 Answer any TWO questions 2*15=30

Sl. Question Course Marks

No Outcome
6. Derive the recurrence tree for T(n)=4T(n/2)+cn and a1 15
provide a tight asymptotic bound on its solution and
verify by substitution method.
OR
Write a recursive program to calculate Fibonacci
series. Find the recurrence relation for the same and
solve it using substitution method.
7 Write an algorithm to find out the closest pair points a2 15
using divide and conquer method. Derive its time
complexity.
OR
Analyze the best, worst and average time
complexity of merge sort. Also explain the merge
sort algorithm.