Scribd
Upload
35 views2 pages

Ada Assignment

Uploaded by

dsilvacarolm17
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
35 views2 pages

Ada Assignment

Uploaded by

dsilvacarolm17
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/ 2

Sir.M.

Visvesvaraya Institute of Technology


Bengaluru - 562157
Approved by AICTE | Affiliated to VTU Belagavi | Accredited by NAAC

Department of Information Science and Engineering


Assignment Questions 1

Name of the Faculty : Mrs Suguna M K , Mrs Shanta Biradar


Name of the Subject with code : Analysis & Design of Algorithms BCS401
Academic Year : 2023-2024 EVEN SEM
Semester and year : IV SEM

Relevance to PSO- PSO1

Sl.N Assignment Questions Relevance Relevance


O to PO to CO
1 Define an Algorithm. Explain about algorithm with suitable example PO1 CO1
(Notion of algorithm).
2 Briefly explain the Fundamentals of Algorithmic Problem Solving PO1 CO1
using block diagram.
3 Explain the Asymptotic Notations with example and diagram. PO1 CO1
4 List out the Steps in Mathematical Analysis of non-recursive PO2 CO1
Algorithms. Explain anyone.(Maximum element, Unique element in
list)
List out the Steps in Mathematical Analysis of Recursive Algorithms
.Explain anyone .(Tower of Hanoi and Factorial)
5 Explain the concept of Divide and Conquer Approach. PO2 CO2
Apply Quick Sort algorithm to sort the list of characters E,X,A,M,P,L,E.
Draw the recursive calls made during tracing.

6 Design an algorithm for Quick Sort to sort the input list. Discuss the PO2 CO2
best- case, worst -case and average- case efficiency of an algorithm.

7 Design an algorithm to search an element in array using sequential PO2 CO1


search. Discuss the best- case, worst -case and average- case
efficiency of an algorithm.

8 Define Topological Sorting. Illustrate the Topological Sorting for the PO2 CO2
graph using DFS method
9 Discuss Decrease and Conquer technique. Explain Insertion Sort with PO2 CO2
an example.
10 Define Exhaustive Search. Solve the Knapsack problem for the PO2 CO1
following data with knapsack capacity W= 16
Item I1 I2 I3 I4
Value 2 5 10 5
Weight 20 30 50 10
11 Design an algorithm for Merge Sort to sort the input list. Discuss the PO2 CO2
best- case, worst -case and average- case efficiency of an algorithm.
Trace for the input list
4 9 0 -1 6 8 9 2 3 12

12 Explain the Brute Force String Matching and trace for the input PO2 CO1
TEXT: NOBODY NOTICED HIM
PATTERN : NOT
13 Apply Strassen’s Multiplication to multiply the matrices. Show the PO2 CO2
details of computation

Course outcome (Course Skill Set)


At the end of the course, the student will be able to:
CO1. Apply asymptotic notational method to analyze the performance of the algorithms in terms of
time complexity.
CO2. Demonstrate divide & conquer approaches and decrease & conquer approaches to solve
computational problems.
CO3. Make use of transform & conquer and dynamic programming design approaches to solve the
given real world or complex computational problems.
CO4. Apply greedy and input enhancement methods to solve graph & string based computational
problems.
CO5. Analyse various classes (P,NP and NP Complete) of problems
CO6. Illustrate backtracking, branch & bound and approximation methods.

You might also like