IT-403 · Analysis and Design of Algorithm/Unsolved PYQ Paper
IT-403 Analysis and Design of Algorithm - Dec 2024 Question Paper
-
Unit 17 MarksaSolve the following recurrence relation $$T(n)=7T\left(\frac{n}{2}\right)+2n^2$$
-
Unit 17 MarksbShow how quick sort sorts the following sequence of keys 65, 70, 75, 80, 85, 60, 55, 50, 45 Solve the recurrence relation of quick sort using substitution method.
-
Unit 17 MarksaExplain merge sort algorithm and find the complexity of the algorithm.
-
Unit 27 MarksbWrite an algorithm for single source shortest path and apply it for the following graph.
-
Unit 27 MarksaHow the Optimal Merge Pattern algorithm works? Explain with a suitable example.
-
Unit 27 MarksbApply Kruskal's algorithm to find the minimum spanning tree of a graph with weighted edges.
-
Unit 37 MarksaWhat is multistage graph problem? Discuss its solution based on dynamic programming approach. Also give a suitable algorithm and find its computing time.
-
Unit 27 MarksbCompute the optimal solution for knapsack problem using greedy method. Given N = 5, M = 10, (p1,p2,p3,p4,p5) = (10, 15, 10, 12, 8), (w1,w2,w3,w4,w5) = (3, 3, 2, 5, 1).
-
Unit 37 MarksaDesign a three stage system with device types D1, D2 and D3. The costs are $30, $15 and $20 respectively. The cost of the system is to be no more than $105. The reliability of each device is 0.9, 0.8 and 0.5 respectively.
-
Unit 47 MarksbBriefly explain the Hamiltonian cycle using backtracking with a example.
-
Unit 414 MarksSolve the following instance of travelling sales person problem using Branch Bound. $$\left[\begin{matrix} \infty & 20 & 30 & 10 & 11 \\\\ 15 & \infty & 16 & 4 & 2 \\\\ 3 & 5 & \infty & 2 & 4 \\\\ 19 & 6 & 18 & \infty & 3 \\\\ 16 & 4 & 7 & 16 & \infty \end{matrix}\right]$$
-
Unit 57 MarksaExplain the P, NP-Hard and NP-complete classes? Give the relation between them.
-
Unit 57 MarksbExplain the purpose of design and complexity of parallel algorithms in detail.
-
Unit 17 MarksaWrite short note on Logic Optimization.
-
Unit 27 MarksbWrite short note on Optimal merge patterns.
-
Unit 17 MarkscWrite short note on Data Transfer Optimization.
-
Unit 47 MarksdWrite short note on 8 queen's problem using backtracking.
Go to where you left off?
Quick Add to Notes
Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.
Create free accountHave an account? Log in
Notes Panel