Q.1
14 Marks(a)
Define domain, co-domain, and range of a function.
(c)
Derive the time complexity of Heap Sort step by step with suitable justification.
Gujarat Technological UniversitySummer 2026 examination
GTU 3150703 Analysis and Design of Algorithms (ADA) Summer 2026 Question Paper & PDF
B.E. · Computer Engineering · Semester 5 · Subject code 3150703
- Total
- 70 marks
- To pass
- 23 marks (33%)
- Duration
- 2.5 Hours 2:30 PM – 5:00 PM
- Questions
- 5 with internal choice
No solutions on this paper yetNeed them for your exam? Ask once. Papers that students ask for are solved first, and we aim to add them within 24 hours.
Noted. This paper is in our queue now. Check back tomorrow.
We could not record that here. Email the paper name to hirenjsca@gmail.com and we will add it.
6 of 25 questions on this paper were also asked in other years. 7 more are types of question GTU sets again with new data. Each is marked below with the years it appeared.See all 39 repeated 3150703 questions, most asked first
Q.2
14 Marks(a)
Perform Counting Sort on the input array A = [4, 2, 2, 8, 3, 3, 1]. Show all steps counting array, cumulative count, and the final sorted output.
Also asked in Winter 2024 Q2a, Winter 2023 Q3a OR
(b)
Solve the recurrence relation T(n) = 2T(n/2) + n using the Master Theorem.
Also asked in Winter 2024 Q2c, Summer 2024 Q2b, Winter 2023 Q1b
(c)
Derive the recurrence relation and solve it for Merge Sort using the Master Theorem.
OR
(c)
Describe the Multiplying Large Integers Problem using Divide and Conquer.
Q.3
14 Marks(a)
Explain the Principle of Optimality in Dynamic Programming with a suitable example.
Also asked in Winter 2025 Q3a, Summer 2025 Q4a, Winter 2024 Q4b OR, Summer 2024 Q3a, Summer 2023 Q3a
(b)
Explain the Huffman Coding algorithm with a suitable example and construct the Huffman Tree.
Also asked in Winter 2025 Q4b OR, Summer 2024 Q4b OR, Winter 2023 Q3b OR, Summer 2023 Q4a
(c)
Solve the 0/1 Knapsack problem using dynamic programming for the given data:
Weights = [2, 3, 4, 5], Values = [3, 4, 5, 6], Capacity = 5.
Also asked in Winter 2024 Q3c OR
OR
(a)
State and explain the basic characteristics of problems that can be solved using Dynamic Programming.
(b)
Describe the Knapsack Problem and mention why the Greedy approach works for the fractional version but not for the 0/1 version.
Also asked in Winter 2024 Q4c OR
(c)
For the two strings X = AGGTAB and Y = GXTXAYB, find the Longest Common Sub-sequence using Dynamic Programming.
Also asked in Winter 2025 Q3c OR, Summer 2025 Q4c OR, Summer 2024 Q3c
Q.4
14 Marks(a)
Explain the basic concepts of graphs with suitable examples. Differentiate between directed and undirected graphs.
(b)
Perform Depth First Search (DFS) starting from vertex A for the graph:
Vertices: A, B, C, D, E Edges: (A, B), (A, C), (B, D), (C, D), (D, E). Write the order of traversal.
(c)
Find the Minimum Spanning Tree using Kruskal’s algorithm for the following graph:
Vertices = {A, B, C, D, E} Edges with weights: A-B: 2, A-C: 3, B-C: 1, B-D: 4, C-E: 5, D-E: 2.
Also asked in Winter 2025 Q4c OR, Summer 2025 Q4b OR, Winter 2023 Q4b OR, Summer 2023 Q4c OR
OR
(a)
Explain the Breadth First Search (BFS) algorithm. Illustrate the traversal process using an example graph.
Also asked in Winter 2024 Q4a OR
(b)
Find one possible topological ordering for the directed graph with edges: (5→2),(5→0), (4→0), (4→1), (2→3), (3→1).Also asked in Winter 2025 Q5b, Summer 2023 Q4b OR
(c)
Given items with weights (w) and profits (p): Item 1: (w=10, p=60), Item 2: (w=20, p=100), Item 3: (w=30, p=120), Capacity (W)=50. Solve using the Greedy method based on profit/weight ratio.
Q.5
14 Marks(a)
Discuss the Eight Queens Problem in detail. Write the backtracking algorithm and demonstrate the solution process.
Also asked in Summer 2023 Q5c
(b)
For the Rabin-Karp algorithm, given T = '31415926535', P = '26', base d = 10, and prime q = 13: Compute hash values of pattern and first few text substrings. Identify matching positions.
Also asked in Winter 2025 Q5c OR, Summer 2024 Q5c OR, Winter 2023 Q5c OR, Summer 2023 Q5a
(c)
Describe the Travelling Salesman Problem (TSP). Why is it considered NP-hard? Discuss any one approximation algorithm for TSP.
OR
(a)
Explain the Travelling Salesman Problem (TSP) using the Branch and Bound approach with a suitable example.
(b)
Given text T = 'AABAACAADAABAABA' and pattern P = 'AABA', trace the Knuth- Morris-Pratt algorithm execution step-by-step. Show all comparisons and matched positions.
(c)
Explain the class P SPACE and how it differs from P and NP. Provide suitable examples of P SPACE problems.
More Analysis and Design of Algorithms papers
Questions repeat across sessions. Working through two or three papers shows you which topics GTU asks most.
Other Semester 5 subjects
BE Computer
Preparing with friends?
Send this paper to your class group. Every question has its own link.
About this paper
Official Gujarat Technological University (GTU) examination paper for Analysis and Design of Algorithms (ADA) (Summer 2026, B.E. · Computer Engineering, Sem 5). Features complete 70-mark regular & remedial examination pattern, official marking distribution across all 5 questions, and direct 1-click official PDF download.
Transcribed for student exam preparation from Gujarat Technological University official examination archives. Questions, syllabus guidelines, and curriculum marking schemes remain the intellectual property of Gujarat Technological University.