JNTU
JNTU B.Tech IV ADVANCED ALGORITHMS Previous Question Paper (June - 2024 - R16)
Note: i) Question paper consists of Part A, Part B.
ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.
Part A
Define dynamic programming.
Answer
Dynamic programming is an algorithmic paradigm that solves complex problems by breaking them down into simpler overlapping subproblems, solving each subproblem once, and storing the results to avoid redundant computations.
Discuss the role of algorithms in computing.
Answer
Algorithms serve as the fundamental building blocks of computing, providing a systematic, step-by-step procedure to transform input data into a desired output. They determine the efficiency of software by optimizing resource usage, such as time and memory, and enable the automation of complex decision-making processes across all domains of computer science.
Define greedy method.
Answer
Sign in to view the complete answer paper.
Discuss about maximum flow algorithm.
Answer
Sign in to view the complete answer paper.
What is linear equation?
Answer
Sign in to view the complete answer paper.
Give a brief summary on merging network.
Answer
Sign in to view the complete answer paper.
What is the best case of Naive algorithm for pattern searching?
Answer
Sign in to view the complete answer paper.
What is the average and best-case running time of the Rabin-Karp algorithm?
Answer
Sign in to view the complete answer paper.
What is non-deterministic algorithm?
Answer
Sign in to view the complete answer paper.
Discuss about vertex cover problem.
Answer
Sign in to view the complete answer paper.
Part B
Compute the following sequences of keys in ascending order with quick sort method: 21, 54, 34, 10, 91, 70, 50, 65, 53, 23, 33.
Answer
Sign in to view the complete answer paper.
Give an example to explain in detail matrix chain multiplication using dynamic programming.
Answer
Sign in to view the complete answer paper.
What is Topological sorting? Illustrate topological sorting with algorithm.
Answer
Sign in to view the complete answer paper.
What is minimum cost spanning tree? Write algorithm for Kruskal’s technique with illustration.
Answer
Sign in to view the complete answer paper.
Discuss in detail bitonic Sorting Networks with an example.
Answer
Sign in to view the complete answer paper.
Explain in detail about the representation of inverting matrices.
Answer
Sign in to view the complete answer paper.
Describe briefly about Knuth-Morris-Pratt algorithm with a suitable example.
Answer
Sign in to view the complete answer paper.
Discuss in detail about matching of a string using finite automata. Give example.
Answer
Sign in to view the complete answer paper.
Explain about Polynomial time and polynomial time verification.
Answer
Sign in to view the complete answer paper.
Distinguish between NP-hard and NP-complete.
Answer
Sign in to view the complete answer paper.
Write an approximation algorithm for Travelling Sales person problem and implement for the given graph.
Answer
Sign in to view the complete answer paper.