Scribd
Upload
11 views2 pages

Csam 551

Uploaded by

KESHAV BHARDWAJ
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
11 views2 pages

Csam 551

Uploaded by

KESHAV BHARDWAJ
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

-----------------

National Institute of Technology, Delhi


Name of the Examination: M. Tech First Year (AY 2022-2023)
End Semester Examination (Spring Semester)

Branch: CSE Semester: II


Title of the Course: Advanced Data Structures and Algorithms/ Algorithms for Analytics
Course Code: CSEM504/CSAM551
Time: 3 Hours Maximum Marks:50

Course Matrix (CO Mapping)

QUEI PUE2 QUE3 QUE4

a) Ib) ~) ~) b) ~) ~) a) b) c) a) b) c) d) e)

Marks 4 ~ ~ I 3 I 5 I 3 I 5 5 5 5 5

CO COl ~O2 ~O3 COl ~O2 ~O2 ~O2 CO2 CO2 C03 C03 C03 C03 C03 C03

I=Addressed to small extent


2= Addressed significantly
3= Addressed strongly (major part of course)
Que 1 a) Briefly explain P type, NP type, NP hard and NP complete problems. 4M
b) What is an approximation algorithm? Enlist the types of a!_g_orithmic
problems. 2M
c) Apply Brute force, greedy method and dynamic programming approach to 4M
find solution. (HINT:TSP)

10 15
0 25 10 20]
[1~ 30 0 5
15 10 20 0

Que2 a) Explain the concept of linear programming. 1M


b) Explain the graphical method and simplex method of LP. 3M
c) Explain the concept of duality in LP. 1M
d) Maximize: z =Zx.- x2+2x3using slack form 5M
Subject to: 2X,+X2<=10
X,+2X2-2X3~ 20
X,+2X3~ 5
xi X2.X3>=O
Que3 a) Differentiate between DFT and FFT 1M
b) Give the recursive algorithm of Fast Fourier Transform. 3M
c) Analyze the complexity of the recursive FFT algorithm. 1M
Que 4 Explain the following concept in brief. Give the naive approach to solve this
problem. Analyse the complexity of the same.
a) 3-CNF satisfiability problem 5M
b) Markov model and Markov inequality 5M
c) Interior point and Ellipsoid Algorithms 5M
d) subset sum problem 5M
e) Hamiltonian cycle problem 5M

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