Scribd
Upload
21 views2 pages

CSA06 - Model - Exam - 2024 - Set-5

Uploaded by

vaadharshvishal10a
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
21 views2 pages

CSA06 - Model - Exam - 2024 - Set-5

Uploaded by

vaadharshvishal10a
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

SIMATS SCHOOL OF ENGINEERING

SAVEETHA INSTITUTE OF MEDICAL AND TECHNICAL SCIENCES

INSTITUTE OF COMPUTER SCIENCE AND ENGINEERING

ANALYTICAL EXAMINATION – JULY 2024


SUB CODE: CSA 06 SUBJECT NAME: DESIGN AND ANALYSIS OF ALGORITHMS

DURATION: 3 Hrs DATE: 01-07-2024 MARKS: 100 Marks

Answer All the Questions

Big O Notation: Show that f(n)=n2+3n+5 is O(n2)


1 Big Omega Notation: Prove that g(n)= n3+2n2+4n is Ω(n3) 10 CO1 BL-1
Big Theta Notation: Determine whether h (n) =4n2+3n is Θ (n2) or not.
Give the recursive algorithm to find the maximum and minimum elements from
2 the list and apply the algorithm to find the maximum and minimum to the list 10 CO1 BL-1
[31, 22, 12,-7, 75,-6, 17, 47, 60].
Explain Considering the Text = “ Look at that Red rose “ and the is Pattern =
3 “ at “. Use Brute-Force String Matching to find whether the substring matches 10 CO2 BL-2
the given pattern.
1. Discuss the pseudocode for the Given 2 square matrices A and B of size n * n
each and find their multiplication matrix using Stassen’s Matrix Multiplication.
4 10 CO2 BL-2
A = ( (1,1,1,1),(2,2,2,2),(3,3,3,3),(2,2,2,2));
B = ( (1,1,1,1),(2,2,2,2),(3,3,3,3),(2,2,2,2));
Analyse and Apply meet in the middle algorithm to find the maximum subset
having a sum less than or equal to S. Given set = [32, 12, 19, 3, 1, 11, 5], s = 9
5 and also compare the time complexity of this algorithm with the brute force 10 CO3 BL-4
algorithm.
Apply dynamic programming for the given input string and a dictionary of
words and find out if the input string can be segmented into a space separated
sequence of dictionary words.
6 10 CO3 BL-3
Dictionary = [mobile, Samsung, sam, sung, man, mango, icecream, and, go, I,
like]
Input String = “samsungandmango”
1. Construct the optimal assembly line schedule for the following given data :

7 10 CO4 BL-5

Consider the following tasks with their deadlines and profits. Design a greedy
technique to Schedule the tasks in such a way that they produce maximum profit
after being executed

S. No. 1 2 3 4 5
9 10 CO4 BL-5
Jobs J1 J2 J3 J4 J5
Deadlines 2 2 1 3 4
Profits 20 60 40 100 80
1. Examine the given a set of non negative integers and a value sum and find the
subset of the given set whose sum is equal to the given sum using backtracking.
10 10 CO5 BL-4
(i) Given : Set[]={3,34,4,12,5,2} and sum=30
(ii) Given : Set[]={1,2,1} and sum=3

1. Solve, the given 6 items of different weights and bins each of capcity 10, assign
each item to a bin such that number of total bins used is minimum.

(i)Bin Capacity = 10

Item 1 2 3 4 5 6 7
10 Weight 2 5 4 7 1 3 8 10 CO5 BL-3

(ii)Bin Capacity = 10

Item 1 2 3 4 5 6
Weight 5 6 3 7 5 4

You might also like