Scribd
Upload
18 views2 pages

Design and Analysis of Algorithms Exam 2024 25

The document outlines the B. Tech (Sem V) Theory Examination for Design and Analysis of Algorithms for the academic year 2024-25, detailing the exam structure, including sections with varying marks. It includes instructions for the exam, topics for Section A, and specific problems for Sections B and C that cover various algorithmic concepts and techniques. The examination assesses knowledge on data structures, algorithm strategies, and problem-solving methods in computer science.

Uploaded by

vishalyaduvansi8081
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views2 pages

Design and Analysis of Algorithms Exam 2024 25

The document outlines the B. Tech (Sem V) Theory Examination for Design and Analysis of Algorithms for the academic year 2024-25, detailing the exam structure, including sections with varying marks. It includes instructions for the exam, topics for Section A, and specific problems for Sections B and C that cover various algorithmic concepts and techniques. The examination assesses knowledge on data structures, algorithm strategies, and problem-solving methods in computer science.

Uploaded by

vishalyaduvansi8081
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.

TECH (SEM V) THEORY EXAMINATION 2024-25

DESIGN AND ANALYSIS OF ALGORITHMS

Time: 3 Hours Total Marks: 100

Instructions:

1. Attempt all Sections.

2. Assume any missing data suitably.

3. All questions carry equal marks.

SECTION A (2 × 10 = 20 Marks)

Attempt all questions briefly:

1. Define/Explain the following:

(a) Difference between AVL Trees and Red-Black Trees.

(b) Solve the recurrence: T(n) = 2T(floor(n/2)) + n using the Master Theorem.

(c) Explain the Divide and Conquer strategy with an example.

(d) State the applications of Dynamic Programming.

(e) Define graph traversal techniques: BFS and DFS.

(f) Describe the characteristics of NP-Complete problems.

(g) Explain the steps of Kruskal's algorithm to find the Minimum Spanning Tree.

(h) Differentiate between Recursion and Iteration.

(i) Write a brief note on Greedy Algorithms.

(j) What is the importance of Big-O notation in analyzing algorithms?

SECTION B (10 × 3 = 30 Marks)

Attempt any three questions:

2. (a) Solve the recurrence T(n) = T(n/3) + T(2n/3) + n using the Recursion Tree method.

(b) Insert the following elements into an initially empty B-Tree of degree t = 2:
15, 8, 30, 5, 20, 25, 10, 12, 40, 35. Then delete 12 and 25.

(c) Write Kruskal's algorithm. Use it to find the Minimum Spanning Tree of the following graph:

(Provide a graph for reference).

(d) Write and explain the algorithm for the Longest Common Subsequence (LCS).

(e) Explain Heap Sort. Sort the array A = [20, 5, 15, 10, 25, 30, 12] using Heap Sort.

SECTION C (10 × 5 = 50 Marks)

Attempt any five questions:

3. (a) Apply the Floyd-Warshall Algorithm to find the All-Pairs Shortest Paths for the following graph:

(Provide a weighted graph for reference).

(b) Solve the Knapsack Problem for W = 50, with the following data using the Greedy approach:

- Items: 1, 2, 3, 4

- Weights: [10, 20, 30, 40]

- Profits: [60, 100, 120, 200]

(c) Compare Backtracking and Branch-and-Bound methods. Solve the Subset Sum Problem using

Backtracking.

(d) Define the Convex Hull problem. Explain and apply the Graham Scan algorithm for the

following points:

(0, 3), (1, 1), (2, 2), (4, 4), (0, 0), (1, 2), (3, 1), (3, 3).

(e) Prove that the Travelling Salesman Problem is NP-Complete.

(f) Explain the KMP Algorithm. Compute the prefix function for the pattern P = 'aabac' and find its

occurrence in T = 'aaabaacaba'.

(g) Discuss Approximation Algorithms and their significance. Provide an example of an

Approximation Algorithm for the Vertex Cover Problem.

You might also like