Skip to content
IT-403 · Analysis and Design of Algorithm/Unsolved PYQ Paper

IT-403 Analysis and Design of Algorithm - Jun 2024 Question Paper

  1. Unit 1
    7 Marks
    aDefine Time Complexity. Describe different notations used to represent these complexities.
  2. Unit 1
    7 Marks
    bWrite an algorithm for Strassen's matrix multiplication and analyze the complexity of algorithm.
  3. Unit 1
    7 Marks
    aShow that the average case time complexity of quick sort is $\left(O(n\log n)\right).$
  4. Unit 2
    7 Marks
    bDescribe in detail job sequencing with deadlines problem. Let n = 4, $\left(P_1, P_2, P_3, P_4\right) = \left(100, 10, 15, 27\right)$ and $\left(d_1, d_2, d_3, d_4\right) = \left(2, 1, 2, 1\right)$ find the optimal solution for the given values.
  5. Unit 2
    7 Marks
    aWrite an algorithm for single source shortest path and apply it for the following graph.
  6. Unit 2
    7 Marks
    bDiscuss the importance of proving both the greedy choice property and the optimal substructure property for establishing the correctness of a greedy algorithm.
  7. Unit 3
    7 Marks
    aExplain Floyd Warshall algorithm problem with the graph given in figure.
  8. Unit 2
    7 Marks
    bWrite an algorithm to solve Knapsack problem using Greedy technique. Find the optimal solution to the Knapsack instance n = 7, m = 15 $\left(P_1, P_2, P_3, \ldots, P_n\right) = \left(10, 5, 15, 7, 6, 18, 3\right)$ $\left(W_1, W_2, W_3, \ldots, W_n\right) = \left(2, 3, 5, 7, 1, 4, 1\right)$.
  9. Unit 3
    7 Marks
    aDescribe how dynamic programming can be used to solve reliability design problems.
  10. Unit 4
    7 Marks
    bDescribe graph coloring problem and write an algorithm for m-coloring problem.
  11. Unit 4
    7 Marks
    aExplain the 4-queen problem using backtracking algorithm.
  12. Unit 4
    7 Marks
    bExplain the method of reduction to solve travelling sales person problem using branch and bound.
  13. Unit 5
    7 Marks
    aCompare and contrast NP-Hard and NP-Complete classes.
  14. Unit 5
    7 Marks
    bWhat are B-trees? How are they created? Explain with a suitable example.
  15. Unit 5
    7 Marks
    aData Stream Algorithms
  16. Unit 5
    7 Marks
    bApproximations Algorithms
  17. Unit 1
    7 Marks
    cData Transfer Optimization
  18. Unit 2
    7 Marks
    dHuffman coding
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 account

Have an account? Log in