GTU · BE Computer · Semester 5
GTU 3150703 Analysis and Design of Algorithms (ADA) Old Question Papers PDF
Official Gujarat Technological University (GTU) old question papers PDF (Regular & Remedial) and step-by-step solved questions for Analysis and Design of Algorithms (ADA) across 2023 – 2026 examinations.
39 questions GTU asked more than onceAsked in 6 of 7 papers: Explain the Principle of Optimality in Dynamic Programming with a suitable example.See listExam papers
Most repeated questions
39 questions GTU set in two or more of 7 papers, most repeated first. Tap a year to open that paper at the question.
Explain the Principle of Optimality in Dynamic Programming with a suitable example.
Summer 2026 Q3a Winter 2025 Q3a Summer 2025 Q4a Winter 2024 Q4b OR Summer 2024 Q3a Summer 2023 Q3a
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.
Summer 2026 Q4c Winter 2025 Q4c OR Summer 2025 Q4b OR Winter 2023 Q4b OR Summer 2023 Q4c OR
Explain backtracking method. What is 4 queen problem? Show its all possible solutions.
Winter 2025 Q5c Summer 2025 Q5b Winter 2024 Q5a OR Summer 2024 Q5b Winter 2023 Q4c OR
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.
Summer 2026 Q5b Winter 2025 Q5c OR Summer 2024 Q5c OR Winter 2023 Q5c OR Summer 2023 Q5a
Explain the Huffman Coding algorithm with a suitable example and construct the Huffman Tree.
Summer 2026 Q3b Winter 2025 Q4b OR Summer 2024 Q4b OR Winter 2023 Q3b OR Summer 2023 Q4a
Solve following instance of knapsack problem using dynamic programming: W = [1, 2, 5, 6, 10], V = [1, 6, 18, 22, 30] and Knapsack capacity M =
Winter 2025 Q3c Summer 2024 Q4c OR Winter 2023 Q3c OR Summer 2023 Q3c OR
For the two strings X = AGGTAB and Y = GXTXAYB, find the Longest Common Sub-sequence using Dynamic Programming.
Summer 2026 Q3c OR Winter 2025 Q3c OR Summer 2025 Q4c OR Summer 2024 Q3c
Outline algorithm for Prim’s method and find MST for given graph using Prim’s method
Winter 2025 Q4c Winter 2024 Q4c Summer 2024 Q3c OR Summer 2023 Q4c
Solve the recurrence relation T(n) = 2T(n/2) + n using the Master Theorem.
Summer 2026 Q2b Winter 2024 Q2c Summer 2024 Q2b Winter 2023 Q1b
Explain polynomial time reduction
Winter 2025 Q5a OR Summer 2025 Q5a OR Winter 2023 Q5a OR Summer 2023 Q5a OR
Show 29 more repeated questionsHide the 29 more
Show naïve string matching algorithm with example.
Winter 2025 Q5a Summer 2025 Q5c Summer 2024 Q5b OR Summer 2023 Q5b
Explain P, NP, NP complete and NP-Hard problems. Give examples of each.
Find the optimal way of multiplying following matrices using dynamic programming. Also indicate optimal number of multiplications required. A:2 x 3, B: 3 x 5, C:5 x 6, D: 6 x 2, E: 2 x
Write binary search algorithm and analyze it for worst case time complexity. Represent its time complexity using Big-oh (O) notation.
Find one possible topological ordering for the directed graph with edges: (5→2), (5→0), (4→0), (4→1), (2→3), (3→1).
Summarize and explain the properties of algorithm
Define the characteristics of greedy algorithms
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.
Illustrate the working of the quick sort on input instance: 25, 29, 30, 35, 42, 47, 50, 52, 60. Comment on the nature of input i.e. best case, average case or worst case.
Solve the following Knapsack Problem using greedy method. Number of items = 5, knapsack capacity W = 100, weight vector = {50, 40, 30, 20, 10} and profit vector = {1, 2, 3, 4, 5}.
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.
Write an algorithm for insertion sort. Calculate the best, average and worst case complexity of it.
Construct solution using Merge sort on the given data sequence: 88, 77, 22, 55, 11, 33, 66, 99, 44. Also state its recurrence and solve it.
Describe the Knapsack Problem and mention why the Greedy approach works for the fractional version but not for the 0/1 version.
Compare and contrast: Backtracking vs. Branch and Bound
Differentiate: BFS vs DFS
Explain the amortized analysis technique with an example.
Sort the following elements using bucket sort. 10, 21, 29, 41, 52
Demonstrate Binary Search method to search Key = 14, form the array A=<2,4,7,8,9,10,12,14,18>
Enlist the advantages and disadvantages of dynamic programming.
Given coins of denominations 2, 3 and 4 with amount to be pay is 5. Find optimal no. of coins and sequence of coins used to pay given amount using dynamic method.
Explain Binomial Coefficient algorithm using dynamic programming.
Explain activity selection problem.
Explain the steps of greedy strategy for solving a problem.
Discuss the Eight Queens Problem in detail. Write the backtracking algorithm and demonstrate the solution process.
Define Articulation point, Acyclic Directed Graph, Back Edge
Explain DFS with suitable example.
Explain the Breadth First Search (BFS) algorithm. Illustrate the traversal process using an example graph.
What are the disadvantages of greedy method over dynamic programming method?
Which branches take this subject
GTU's syllabus lists 3150703 for 6 branches. One set of papers serves all of them.
Semester 5: 6 branches
Computer Engineering, Computer Science & Design, Computer Science & Engineering, Computer Science & Engineering (Data Science), Information & Communication Technology, Information Technology
Other Semester 5 subjects
Common questions
Are these GTU 3150703 Analysis and Design of Algorithms papers valid for both Regular and Remedial exams?
Yes. Gujarat Technological University (GTU) follows the same 70-mark syllabus, exam blueprint, and 23-mark passing cutoff for both Regular and Remedial (ATKT/backlog) examinations. All 7 past exam sessions (2023 – 2026) serve as comprehensive preparation for either attempt.
How can I download GTU 3150703 Analysis and Design of Algorithms old question papers PDF?
You can download official GTU 3150703 original question paper PDFs directly from the table above with 1 click and zero deceptive ads or wait timers. Every paper also includes interactive online questions with AI study prompts.
What is the passing mark for GTU Analysis and Design of Algorithms (3150703)?
The external theory exam carries 70 marks. The minimum passing cutoff is 23 marks (33%). Exam duration is 2.5 hours.
What is the GTU exam pattern for 3150703?
The examination contains 5 main questions of 14 marks each, totaling 70 marks. Questions 2 through 5 provide internal OR choices, typically split into 3-mark, 4-mark, and 7-mark questions.