Scribd
Upload
25 views1 page

Design and Analysis of Algorithms-IA 1

Daa

Uploaded by

Preethesh Kulal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views1 page

Design and Analysis of Algorithms-IA 1

Daa

Uploaded by

Preethesh Kulal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Vivekananda College of Engineering & Technology,Puttur

[A Unit of Vivekananda Vidyavardhaka Sangha Puttur ®]


Affiliated to VTU, Belagavi & Approved by AICTE New Delhi
CRM08 Rev 1.10 CSE 21/05/2021

CONTINUOUS INTERNAL EVALUATION– 1

Dept:CSE Sem / Div:4/A & B Sub: Design and Analysis of S Code:18CS42


Algorithms
Date:24/05/2021 Time:3:00-4:30 pm Max Marks:50 Elective: N
Note: Answer any 2 full questions, choosing one full question from each part.
-
QN Questions Marks RBT COs
PART A
1 a Design an algorithm to search an element in an array using 9 L2 CO1
sequential search. Discuss the best case, worst and average case
efficiency of this algorithm
b Explain in detail the important problem types. 6 L2 CO1
c Give general plan of mathematical analysis of recursive algorithms. 10 L3 CO1
Describe Towers of Hanoi Problem and Illustrate mathematical
analysis of the Towers of Hanoi Problem.
OR
2 a Explain asymptotic notations Big O, Big Ω and Big θ,that are used 9 L2 CO1
to compare the order of growth of an algorithm with example
b Explain two common ways to represent the graph with example 6 L2 CO1
c Give general plan of mathematical analysis of non-recursive 10 L3 CO1
algorithms. Design an algorithm to check all the elements are
distinct and derive its worst case time efficiency.
PART B
3 a Explain the concept of Divide and conquer. Design an algorithm for 10 L3 CO2
merge sort and derive its time efficiency.
b Discuss quick-sort approach to sort an array and trace for the 15 L3 CO2
following data set. Draw the tree of recursive calls made. Derive the
best case complexity of quick sort algorithm.

65 70 75 80 85 60 55 50 45

OR
4 a Write a recursive algorithm for binary search and also bring out its 10 L3 CO2
efficiency
b Discuss Strassen’s matrix multiplication and derive its time 15 L3 CO2
complexity.

Prepared by: Dr.Vandana B.S, Mr. Nithin Kurup U G HOD


Page: 1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy