ADA GTU Summer 2026
Shared by a Veda learner · Generated with Veda AI
What you'll study, topic by topic
ADA GTU Summer 2026
This is the complete GTU Semester 5 exam paper for Analysis and Design of Algorithms (3150703). The paper is divided into five main questions (Q.1 to Q.5), each with three sub-parts (a, b, c). Sub-part (c) of Q.2, Q.3, Q...
Sample questions with model answers
Every question in the paper gets a full exam-length answer in the app — organised by marks, the way a topper writes it.
Derive the time complexity of Heap Sort step by step with suitable justification.
Show answer outline
Heap Sort has O(n) for building the heap and O(n log n) for the extraction phase, resulting in a total time complexity of O(n log n).
The full exam-length answer is in the app.
Derive the recurrence relation and solve it for Merge Sort using the Master Theorem.
Show answer outline
The recurrence is T(n) = 2T(n/2) + n, which solves to O(n log n) using the Master Theorem.
The full exam-length answer is in the app.
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.
Show answer outline
The maximum value is 7 (items 1 and 2).
The full exam-length answer is in the app.
For the two strings X = AGGTAB and Y = GXTXAYB, find the Longest Common Sub-sequence using Dynamic Programming.
Show answer outline
The LCS length is 4 (e.g., 'GTAB').
The full exam-length answer is in the app.
Study it properly — free, in the app
The full Veda Bites deck, complete notes, spaced-repetition flashcards, leveled MCQs, tests and games for this kit — plus Daily Facts and the Arena, every day.