Gujarat Technological UniversityWinter 2025 examination

GTU 3150703 Analysis and Design of Algorithms (ADA) Winter 2025 Question Paper & PDF

B.E. · Computer Engineering · Semester 5 · Subject code 3150703
Download official PDFView PDF here
Share with your class
Total
70 marks
To pass
23 marks (33%)
Duration
2.5 Hours 10:30 AM – 1: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.

10 of 25 questions on this paper were also asked in other years. 8 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.1

14 Marks
(a)
3 marks
State the time complexity of following problems in descending order:

Matrix multiplication, inserting element in binary search tree, inert node at beaning in linked list, linear search, selection sort, merge sort.

(b)
4 marksAsked in 3 of 7 papers
Summarize and explain the properties of algorithm

Also asked in Winter 2023 Q1a, Summer 2023 Q2a

(c)
7 marks
Apply bubble sort on the given data sequence: 77, 22, 55, 11, 33, 66, 44

Q.2

14 Marks
(a)
3 marks
Write the algorithm for binary search
(b)
4 marks
Identify the constant c, n0 and upper bound for given recurrences:

T(n) = 4n² + 3n – 4 T(n) = 6n³ – 8n² + 9n +

(c)
7 marks
Illustrate and solve recurrence for best and worst case of quick sort
(c)
7 marksSame type asked in 2 of 7 papers

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.

Also asked in Winter 2023 Q3a

Q.3

14 Marks
(a)
3 marksAsked in 6 of 7 papers
Define principle of Optimality. Discuss with example.

Also asked in Summer 2026 Q3a, Summer 2025 Q4a, Winter 2024 Q4b OR, Summer 2024 Q3a, Summer 2023 Q3a

(b)
4 marks
Differentiate: Dynamic programming vs divide and conquer
(c)
7 marksSame type asked in 4 of 7 papers

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 =

Also asked in Summer 2024 Q4c OR, Winter 2023 Q3c OR, Summer 2023 Q3c OR

(a)
3 marksAsked in 3 of 7 papers
Define the characteristics of greedy algorithms

Also asked in Winter 2024 Q3a OR, Winter 2023 Q2a

(b)
4 marksAsked in 2 of 7 papers
Explain activity selection problem.

Also asked in Summer 2025 Q3c

(c)
7 marksSame type asked in 4 of 7 papers

Infer the Longest Common Subsequence for following strings: X = 10010100 Y = 10011

Also asked in Summer 2026 Q3c OR, Summer 2025 Q4c OR, Summer 2024 Q3c

Q.4

14 Marks
(a)
3 marks
State and explain methods to represent the graph
(b)
4 marksAsked in 2 of 7 papers
Differentiate: BFS vs DFS

Also asked in Summer 2024 Q5a OR

(c)
7 marksSame type asked in 4 of 7 papers

Outline algorithm for Prim’s method and find MST for given graph using Prim’s method

GTU Analysis and Design of Algorithms (3150703) Winter 2025 Question 4(c) Diagram

Also asked in Winter 2024 Q4c, Summer 2024 Q3c OR, Summer 2023 Q4c

(a)
3 marksAsked in 2 of 7 papers
Define Articulation point, Acyclic Directed Graph, Back Edge

Also asked in Winter 2024 Q5b

(b)
4 marksSame type asked in 5 of 7 papers
Find prefix code for given data. A: 45, B: 30, C: 15, D: 12, E:

Also asked in Summer 2026 Q3b, Summer 2024 Q4b OR, Winter 2023 Q3b OR, Summer 2023 Q4a

(c)
7 marksSame type asked in 5 of 7 papers

Outline algorithm for Kruskal’s method and find MST for the graph given in Figure 1, using Kruskal’s method

GTU Analysis and Design of Algorithms (3150703) Winter 2025 Question 4 OR (c) Diagram

Also asked in Summer 2026 Q4c, Summer 2025 Q4b OR, Winter 2023 Q4b OR, Summer 2023 Q4c OR

Q.5

14 Marks
(a)
3 marksAsked in 4 of 7 papers
Show naïve string matching algorithm with example.

Also asked in Summer 2025 Q5c, Summer 2024 Q5b OR, Summer 2023 Q5b

(b)
4 marksSame type asked in 3 of 7 papers
Find topological sequence of vertices for the graph given in Figure 1.

Consider A is starting vertex.

GTU Analysis and Design of Algorithms (3150703) Winter 2025 Question 5(b) Diagram

Also asked in Summer 2026 Q4b OR, Summer 2023 Q4b OR

(c)
7 marksAsked in 5 of 7 papers

Explain backtracking method. What is 4 queen problem? Show its all possible solutions.

Also asked in Summer 2025 Q5b, Winter 2024 Q5a OR, Summer 2024 Q5b, Winter 2023 Q4c OR

(a)
3 marksAsked in 4 of 7 papers
Explain polynomial time reduction

Also asked in Summer 2025 Q5a OR, Winter 2023 Q5a OR, Summer 2023 Q5a OR

(b)
4 marksAsked in 2 of 7 papers
Compare and contrast: Backtracking vs. Branch and Bound

Also asked in Summer 2023 Q5b OR

(c)
7 marksSame type asked in 5 of 7 papers

What do you mean by spurious hits? For modulo q=13, how many spurious hits does the Rabin-Karp encounters for the text T = 4359023141526739921 when looking for the pattern P = 31415?

Also asked in Summer 2026 Q5b, Summer 2024 Q5c OR, Winter 2023 Q5c OR, Summer 2023 Q5a

More Analysis and Design of Algorithms papers

Questions repeat across sessions. Working through two or three papers shows you which topics GTU asks most.

Summer 202670 marks · 5 questions
Summer 202570 marks · 5 questions
Winter 202470 marks · 5 questions
Summer 202470 marks · 5 questions

Other Semester 5 subjects

BE Computer

2150703
Analysis and Design of Algorithms
2150704
Object Oriented Programming using JAVA
2150707
Microprocessor and Interfacing
3150709
Professional ethics

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) (Winter 2025, 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.

Download official PDF All Analysis and Design of Algorithms Papers (7) →Report a typo or correction
ViewDownload PDF