I want the question paper of Design Analysis Of Algorithms of B.E. (Computer Engineering) of Pune University so can you provide me?

Ok, here I am providing you the question paper of Design Analysis Of Algorithms of B.E. (Computer Engineering) of Pune University so here I am providing you.

Pune University B.E. (Computer Engineering) question paper

Design Analysis Of Algorithms

Total No. of Questions : 12

Time : 3 Hours

Max. Marks : 100

Answer any three questions from section 1 and questions
from section 2

Answers to the two sections should be written in
separate answer-books

Neat diagrams must be drawn wherever necessary.

Q1
a) Prove by contradiction that “there are infinitely many prime numbers”. (6)
b)Write and explain Dijkstra’s algorithm for a directed graph. (6)
c) Write an algorithm for merge sort. State its time complexity.

a) For a directed graph the edge length matrix is given below. Solve the
Travelling Salesperson problem using dynamic programming method.
Specify its complexity. (8)
0 10 15 20
5 0 9 10
6 13 0 12
8 8 9 0
b) What is the optimal binary search tree problem? Explain how it is solved using dynamic programming.

Q. 3. a) Explain backtracking strategy and write general recursive and iterative
backtracking algorithms. (8)
b) Write the control abstractions for LC-search. (6)
c) Differentiate between “backtracking” and “branch and bound”strategies.


Pune University B.E. (Computer Engineering) question paper





Contact-

Savitribai Phule Pune University
Ganeshkhind
Pune, Maharashtra 411007