0% found this document useful (0 votes)
14 views1 page

Advanced in Algorithm

This document outlines the examination details for the Master of Technology in Computer Science & Engineering at Dr. Babasaheb Ambedkar Technological University for Winter 2024. It includes instructions for students, the structure of the exam, and a list of topics and questions related to advanced algorithms, including sorting algorithms, asymptotic notations, and various algorithmic methods. Students are required to solve specific questions from each section of the exam.

Uploaded by

hhshaikh.spm
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
0% found this document useful (0 votes)
14 views1 page

Advanced in Algorithm

This document outlines the examination details for the Master of Technology in Computer Science & Engineering at Dr. Babasaheb Ambedkar Technological University for Winter 2024. It includes instructions for students, the structure of the exam, and a list of topics and questions related to advanced algorithms, including sorting algorithms, asymptotic notations, and various algorithmic methods. Students are required to solve specific questions from each section of the exam.

Uploaded by

hhshaikh.spm
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

DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE


Regular/Supplementary Winter Examination - 2024

06321945
Course :Master of Technology (Conpuler Science &Engineering) Branch: Engineering and Technology

06821945
Semester:SEMESTER - 1
Subject Code & Name: MTCSEPC104-ADVANCES IN ALGORITHM Date:

Time :3Hours) [Total Marks :60

Ins tructans to the Students:


1.Allthe qestions are compulsory.
2.Use afon-progranmable scientific calculators is allowed.
3.Assun suitable data wherever necessary and mention it clearly

Solve Any Two of the following.


QI(a)
Q1(b)
Qtte)
Explain Any two Sorting Algorithm with example.
Explain Asymptotic Notations in short.
Explain Amortized Analysis with(example
2 Solve AnyTwo of the following.
Q2fa) Explain Representation of Polynormials in detail.
06321945 6
6

Q24) Explain Edmond's Blossom Algorihm to Compute Augmenting Path.


ExplainFord-Fulkerson Method.O
3 Solve Any Two of the following.

0632T9452
Q3(a) Explain String-Matching Algorithms in short. 6
Q3(b) Explain Rabin - Karp Algorithm with example. 6
Q3(c) Explain Boyer - Moore Algorithms With Example. 6

063279
4 Solve Any Two of the following.
QAfa) Write a Short Note on Lup-Decomposition.
Q46) Explain Fast Fourier Transform Algorithm with example.
Q4te) Explain Relation Betweenthe Time Complexities of Basic Matrix and explein
with example.
5 Sotve Any Twoof the following.
Q5(a) Explain Formul ation of Problems as Linear Programs.
Q5(b) Write a Short Note on Interior Point with example
Q5(c) Explain Randomized Algorithms with Example. 6

You might also like