click to join

Our community NEMESIS

for all kind of updates info notes gp nptel....

Printed Pages: Mid Semester Test-1 UID No:

Academic year Semester 2023- 2024
Program Name/Code: Bachelor of Engineering -Computer Science &
Engineering
Semester:sth
Subject Title: Design and Analysis of Algorithms with Lab
Subject Code: 21CSH-311
Time: 1 Hour Maximum Marks: 20
Instructions: Attempt all questions
Q. No Statement CO
mapping
SectionA
5x2= 10 marks
1 Identify the difference between Little "oh" CO1
and Little Omega.
2 List the methods used to solve CO1
recurrence relations.
3 Explain tree data structure with its CO2
terminologies and types.
4 ldentify the difference between min heap CO2
and max heap.
Identify the difference between Binary CO2
Search Tree and Binary Tree.
Section B
2x5= 10 marks
6 Examine the time complexity of the CO1
recurrence: T(n) =4T(n/2) +n using
Recursion Tree method.
7 Differentiate between Doubly Linked List CO1
and Circular Linked List.
 Instructions: HourSubject
Attenpt Time:
Subject
Name/Code:
BE-CSE/T
3Program Printed
Pages:
Ne

th thief
77,90) (,wiTotlowing
weightsand robbing
Into Solve Examine Bellman
Statethe Ldentifytheir quick
ldentify
sort Recall
Discussdifferent Statement
21CSH-311/21ITH-311
Code:Title:
any
10, take
him? his
15., thisTl) traversal various three
Attempt Design
bag it the
if
22, n=5 be problem He Algorithm
ConvexHull Ford the the
There +time difference difference questions
can can 1, aigorithm
25) W=
ifn>01. algorithms all Examination
and Semester
2023-2024
Academnic
year End
(vl, even complexity
ecarry
arwhere:a ways to questions Analysis 930491
60
v2, tvalues. ake items 5 a 4x520 marksProblen, betweenbetween from
kg maximal ifn=0) N8ection B 5x2=10 marks
v3, (wl, also. selectdesign
a of
the thief Sectionfrom
v4, of Algorithms
fraction What thein the Dijkstra trectechniques
v5) w2 , enters Section
weight recurrence:
house and pivot C
w3, items
(30, w4, of a Agorithn graph. Maximum
any house
of clement Marks:60 with
A Lab
40, w5) should with 60 and No:260|UID
45, item the kgfor T(n) State
= &C02 in B Semester:5t
CO3 CO1 CO2 CO2 CO2 CO1 mapping CO

currences of problems
NP-completeness
": orris-PrattcomplexityElaborate
Develop Text:ABCABDABACDABABCABABABCABDABAC
Implement the step Uülze
0.39, DABABCÁBAB challenge
2. Patfern:"ABARCABAB
Salesenn
inFamalate Floyd-Washall
alent
graph. Solve
D" C15
The 5 0 0
Your4AO0s the "bud
cxplanation
epnai 0.26, the
total setiou 2OO5
2320 table the
the
belonging the character of
distanee
Piohiem the Bucket
k 0.72, string ali-pair
solution theory Boyer-Moore
the concepts optimal ofhow
queceahould shortet
pattern ntaceutina 0.94, Sort and patern
algorithm
(KMP) to of toandclasses of include ithm
each the
solntion
0.21,0.12, on "good the
below also in with
Braanh 3x10-30 marks matching.
algorithm
within of
optnal the Section C for
class P, which 3eities:
suffix" alporithm tbe
problen provide NP, these fer input
and problen
the coeiputational in tour. the the 0.23, ziven
NP-hardness eties boad, array heuristicsworks,
Provide
text. vities Traveling
A to
weighted
using
examples D,CD
are 0.681.[0.78, nddress ntng
Text: findall should focusing a
eiven step-by the
the
0.17,C02
andCO
of on the
CO4 COS CO3
COS
 UID No:
Semester 2022-2023 Find minimum cost
emic
year
spanning tree for given grap
using Kruskal and Prims COS
Name Code: CS-201/CS-202/
cS-T0ZCS-704/1T-201
r r a n Semester: 5th algorithm.
Subject Code: nand,igar,
wbject
Title:

d
Analysissof Algorithms 20CSTATT-311 0 11

astructions:Attempt all questions

Maximum Marks: 609
an
Exam ams
|Statement
CO 8
Explain the process to solve systems of congruences COS
No mapp
ng
with the Chinese remainder theorem and explain with
the help of suitable example.
Section A
List all string manipulation/matching algorithms and COS
5x2 10 marks elaborate any onewith the help of suitable example.
Writeany
two limitations of an array, COS Section C
Explain the algorithm used inl Huffman coding COS
3x 10 =30 marks
2 lustrate representation of graph using adjacency 10 Construct Binary Search Tree using following nodes:CO5
COS 45, 15, 79, 90, 10, 55, 12, 20, 50
example.
matrix with the help of suitable numbers. Find the optimal solution for the 0/1 knapsack
COS
Write pseudo code for GCD of2 COS
Efficiency?COs problem making use of dynamic programming
Dilerentiate Time Efficiency and Space
4
5
approach. Consider
Section B n=4
4x5-20 marks w=5 kg
ofCoS (wl, w2, w3, w4) =(2,3,4, 5)
1llustrate the working of queues with the help (pl, p2, p3, p4) (3, 4, 5, 6)
suitable example. of given graph? COS
12 Evaluate depth first search traversal order
 UID No: graph?
Semester 2022- 2023
year
Name/Code:
csdemmC
CS-201/CS-202/ Semester: sth gah
CS-702CS-704/TT-201
subject
Title:

AnalysisofA
lgorithms
Subject Code:
CST-311/TT-311
Exhms
anya iona
7 and

CST-302T-302
Maximum Marks: 60
Tine:
3 Hour
lastructions:Attempt all questions
CO
0Statemnent
mapping COS
Using Dijkstra's Algorithm, find the shortest
Section A distance from source vertex 'S' to remaining
5x2= 10 marks vertices in the following graph.
Linked List? COS
Write 2 applications of
Dynamic
Compare Divide and Conquer and
COS
2 Programming?
techniques? COS
Explain graph traversal
complexity? COS
1Explain the term computational
2 3
spanning tree? CO5
Explain term minimum cost
Section B 2
4x5=20 marks
Differentiate between Singly Linked List and
COS 2
Circular Linked List?
with the COS
Write algorithm for Binary search and explain SectionC
help of an example? 3x 10 = 30 maks
compression technique C03
8 Evaluate breadth first search traversal order of
given CO5 10Anetworking company uses a
 message before
encodethe transmitting over the
Supposethe message contains
to the following
network. withtheir frequency:
charactersw

Character: Frequency
a:5

b :9

c:12

d :13

e:16

f:45 message takes 1

Notethateach character in input

byte. required to encodethe given

no. of bits
How many Huffman coding.
message with using can carry a COS
house for robbing it. He
Thereare5
enters a his bag.
11|A
thief
weight of 60 kg into
following weights and
maximal the even
in the house with thief take if he can
items items should with him?
values. What
fraction of any item
take the
n=5
W= 60 kg (5, 10, 15,22,25)
w3,w4, w5) = 45, 77,90) CO5
(w1, w2, (30,40,
Manipulation/matching
v3, v4, v5)=
(v1,v2, various String example.
of
aborate withthehelp
12 algorithms?Explain