Engineering Student Sample Exam Paper 2026 (RGPV)

B.Tech IV Semester

CS402 - Analysis Design of Algorithm

Model Question Paper – Set A

Time : Three Hours Maximum Marks : 70

Note :

Attempt any five questions.
All questions carry equal marks.
Assume suitable data wherever required.
Draw neat diagrams wherever necessary.

Q.1

a) Explain Asymptotic Notations. Discuss Big-O, Big-Ω and Big-Θ notations with suitable examples. 7

b) Obtain the asymptotic bound of the recurrence relation T(n)=3T(n/3)+n using Substitution Method and represent the result in Θ notation. 7

Q.2

a) Design Merge Sort Algorithm and discuss Best Case, Average Case and Worst Case complexities. 7

b) Sort the following elements using Heap Sort and show all intermediate steps:

81, 39, 10, 36, 45, 15, 55, 23, 91, 88, 12

Q.3

a) Explain Prim’s Algorithm with suitable example. Construct the Minimum Spanning Tree for a weighted graph. 7

b) Apply Dijkstra’s Algorithm to find shortest path from source vertex A to all other vertices. 7

Q.4

a) Solve the following 0/1 Knapsack problem using Dynamic Programming:

n = 4

M = 10

Profits = (10, 15, 20, 25)

Weights = (2, 3, 5, 7)

b) Explain Floyd-Warshall Algorithm and demonstrate all-pairs shortest path computation with suitable example. 7

Q.5

a) Explain Travelling Salesman Problem. Solve a suitable TSP instance using Branch and Bound. 7

b) Explain 8-Queen Problem. Draw State Space Tree and solve using Backtracking. 7

Q.6

a) Explain Reliability Design using Dynamic Programming with suitable example. 7

b) What is Graph Coloring? Explain m-Coloring problem with suitable example. 7

Q.7

a) Explain AVL Trees and Balance Factor. Construct AVL tree by inserting:

45, 32, 56, 20, 40, 50, 60, 10

b) Differentiate between BFS and DFS algorithms. Discuss applications of both. 7

Q.8

Write short notes on any TWO:

Huffman Coding
B-Trees
NP-Completeness
Parallel Algorithms

Set B

Engineering Student Sample Exam Paper 2026 (RGPV)

New Scheme Based On AICTE Flexible Curricula

CS402 - Analysis Design of Algorithm

Model Question Paper – Set B

Time : Three Hours Maximum Marks : 70

Instructions

Attempt any five questions.
All questions carry equal marks.
Assume suitable data wherever required.
Draw neat diagrams wherever necessary.

Q.1

(a) Explain Divide and Conquer strategy. Discuss Binary Search Algorithm and analyze its time complexity. 7

(b) Explain Quick Sort Algorithm. Sort the following elements and show each partition step:

55, 20, 75, 10, 65, 35, 40, 90, 15

Q.2

(a) Explain Huffman Coding Algorithm with suitable example. Construct Huffman Tree for:

A=5, B=9, C=12, D=13, E=16, F=45

(b) Explain Job Sequencing with Deadline Problem. Solve the following instance using Greedy Method. 7

Q.3

(a) Explain Fractional Knapsack Problem and solve it using Greedy Strategy. 7

(b) Construct Minimum Spanning Tree using Kruskal’s Algorithm for a weighted graph. 7

Q.4

(a) Explain Dynamic Programming approach. Solve the Multistage Graph problem using Dynamic Programming. 7

(b) Explain Optimal Binary Search Tree (OBST). Construct OBST for the given probabilities. 7

Q.5

(a) Explain Hamiltonian Cycle Problem. Solve using Backtracking technique. 7

(b) Explain Branch and Bound Method. Differentiate between FIFO Branch and Bound and LC Branch and Bound. 7

Q.6

(a) Solve Travelling Salesman Problem using Least Cost Branch and Bound Method. 7

(b) Explain Knight’s Tour Problem with suitable example. 7

Q.7

(a) Construct B-Tree by inserting the following keys:

10, 20, 5, 6, 12, 30, 7, 17

(b) Explain Breadth First Search (BFS) Algorithm with suitable example and applications. 7

Q.8 Write short notes on any TWO

Strassen Matrix Multiplication
Reliability Design
AVL Tree Rotations
NP Complete Problems

***** End of Model Question Paper – Set B *****

Engineering Student Sample Exam Paper 2026 (RGPV)

New Scheme Based On AICTE Flexible Curricula

CS402 – Analysis Design of Algorithm

Model Question Paper – Set C

Time : Three Hours Maximum Marks : 70

Instructions

Attempt any five questions.
All questions carry equal marks.
Assume suitable data wherever required.
Draw neat diagrams wherever necessary.

Q.1

(a) Explain Asymptotic Notations. Differentiate between Big-O, Big-Ω and Big-Θ notations with suitable examples. 7

(b) Solve the recurrence relation:

T(n)=2T(n/2)+n

using Substitution Method and determine its asymptotic complexity. 7

Q.2

(a) Explain Quick Sort Algorithm. Sort the following elements using Quick Sort and show all partitioning steps:

42, 17, 93, 58, 26, 71, 35, 64, 12

(b) Explain Strassen Matrix Multiplication Algorithm. Compare it with conventional matrix multiplication. 7

Q.3

(a) Construct Huffman Code for the following symbols:

A=10, B=15, C=12, D=3, E=4, F=13, G=1

(b) Explain Dijkstra’s Algorithm and determine shortest paths from source vertex for a weighted graph. 7

Q.4

(a) Solve the following 0/1 Knapsack problem using Dynamic Programming:

Capacity = 8

Profit = (1, 2, 5, 6)

Weight = (2, 3, 4, 5)

(b) Explain Floyd-Warshall Algorithm. Illustrate all-pairs shortest path computation with suitable example. 7

Q.5

(a) Explain Graph Coloring Problem. Solve m-Coloring problem using Backtracking. 7

(b) Explain 8-Queen Problem and solve it using Backtracking technique. 7

Q.6

(a) Explain Travelling Salesman Problem. Solve it using Least Cost Branch and Bound Technique. 7

(b) Differentiate between FIFO Branch and Bound and LC Branch and Bound methods. 7

Q.7

(a) Construct AVL Tree by inserting the following keys:

30, 20, 40, 10, 25, 35, 50, 5

(b) Explain Breadth First Search (BFS) and Depth First Search (DFS). Compare both algorithms with suitable examples. 7

Q.8 Write short notes on any TWO

Optimal Binary Search Tree (OBST)
Reliability Design
B-Tree
NP Complete Problems

***** End of Model Question Paper – Set C *****

Analysis and Design of Algorithms | Concepts, Techniques & Applications Question Papers - Computer Science Engineering Tutorials in Hindi

Download Analysis and Design of Algorithms | Concepts, Techniques & Applications previous year question papers for Computer Science Engineering Tutorials in Hindi 4th Semester Notes in Hindi. These RGPV question papers help you understand the exam pattern, important topics, and question distribution.

How to Use These Question Papers Effectively

Solve papers in exam-like conditions with time limits

Identify your weak areas and focus on them

Compare your answers with standard solutions

Practice all three sets (Set A, Set B, Set C) to cover different question patterns

Revise important concepts before attempting papers

Analysis and Design of Algorithms | Concepts, Techniques & Applications

Set A

Engineering Student Sample Exam Paper 2026 (RGPV)

CS402 - Analysis Design of Algorithm

Q.1

Q.2

Q.3

Q.4

Q.5

Q.6

Q.7

Q.8

Set B

Engineering Student Sample Exam Paper 2026 (RGPV)

New Scheme Based On AICTE Flexible Curricula

CS402 - Analysis Design of Algorithm

Model Question Paper – Set B

Instructions

Q.1

Q.2

Q.3

Q.4

Q.5

Q.6

Q.7

Q.8 Write short notes on any TWO

Set C

Engineering Student Sample Exam Paper 2026 (RGPV)

New Scheme Based On AICTE Flexible Curricula

CS402 – Analysis Design of Algorithm

Model Question Paper – Set C

Instructions

Q.1

Q.2

Q.3

Q.4

Q.5

Q.6

Q.7

Q.8 Write short notes on any TWO

Exam Tip

Study Smart

Practice All Sets

Analysis and Design of Algorithms | Concepts, Techniques & Applications Question Papers - Computer Science Engineering Tutorials in Hindi

How to Use These Question Papers Effectively

Join With