Design and Analysis of Algorithms MCA paper May 2021

  • Subject Code: - PGCA 1920
  • Subject Name: - Design and Analysis of Algorithms
  • Date of Examination: - May 2021
  • Class: - MCA 2nd
  • Exam Mode: - Online

Instructions to Candidates

  1. Attempt any FIVE question(s), each question carries 14 marks.

QUESTIONS

  1. How can you compare the performance of different algorithms for solving the problem? Give an appropriate illustrative example with order statistics to explain the concept.
  2. How does backtracking work on the 8 Queens problem? Explain with a suitable example.
  3. Order the following functions by growth rate : N, N1.5, N2, N log log N, N log2 N, N log (N2), 2/N.2N, 2N/2, 37, N2 log N, N3. Indicate which functions grow at the same rate.
  4. What are Asymptotic growth rates? Distinguish between recursion and iteration with example. Compare the asymptotic growth rates in these two types of approaches.
  5. If we are given a directed graph G with n vertices. Explain how will you find out the length of the shortest path between any pair of vertices in G. Justify your answer with an example.
  6. What is Heap? What are the different types of heaps? Explain how do you construct a heap? Explain the Heap Sort algorithm with an example.
  7. Explain the Merge Sort algorithm with an example and also draw the tree structure of the recursive calls made. Analyze the efficiency of Merge sort algorithm.
  8. Implement an algorithm for knapsack problem using NP-hard approach.

ANSWERS:

Q1.

Top

Comments

Popular posts from this blog

Programming in Python MCA paper Nov 2021

Advanced JAVA MCA paper May 2021

Computer Networks BCA paper Nov 2021