Gujarat Technological UniversityWinter 2024 examination

GTU 3150703 Analysis and Design of Algorithms (ADA) Winter 2024 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.

14 of 25 questions on this paper were also asked in other years. 5 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
Define the following terms:
i)Function in mathematics
ii)Linear inequalities
(b)
4 marksAsked in 2 of 7 papers
Explain the need of amortized notation. Explain with suitable example.

Also asked in Summer 2026 Q1b

(c)
7 marksAsked in 2 of 7 papers

Write an algorithm for insertion sort. Calculate the best, average and worst case complexity of it.

Also asked in Summer 2024 Q1c

Q.2

14 Marks
(a)
3 marksSame type asked in 3 of 7 papers

Sort the following elements using counting sort. 2, 5, 3, 0, 2, 3, 0,

Also asked in Summer 2026 Q2a, Winter 2023 Q3a OR

(b)
4 marksSame type asked in 2 of 7 papers

Sort the following elements using bucket sort. 10, 21, 29, 41, 52

Also asked in Summer 2023 Q1b

(c)
7 marksSame type asked in 4 of 7 papers
Write the Master theorem. Solve following recurrence using it.
i)T(n)= 3T(n/2) + n²
ii)T(n)=2T(n/2) + n log n

Also asked in Summer 2026 Q2b, Summer 2024 Q2b, Winter 2023 Q1b

(c)
7 marksAsked in 3 of 7 papers

Write binary search algorithm using recursion. Derive its recurrence relation. Calculate its complexity using master theorem.

Also asked in Summer 2025 Q1c, Summer 2023 Q2c

Q.3

14 Marks
(a)
3 marksAsked in 2 of 7 papers
Explain the steps of greedy strategy for solving a problem.

Also asked in Summer 2024 Q3a OR

(b)
4 marks

Write an algorithm for Max-Min problem using divide and conquer approach. Calculate its complexity.

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

The matrices A(5X10), B(10X15), C(15X20), and D(20X25) are given. Solve the matrix chain multiplication problem using dynamic programming.

Also asked in Summer 2025 Q4c, Winter 2023 Q3c

(a)
3 marksAsked in 3 of 7 papers
Enlist the general characteristics of greedy algorithms.

Also asked in Winter 2025 Q3a OR, Winter 2023 Q2a

(b)
4 marks

Write an algorithm for matrix multiplication using divide and conquer approach. Calculate its complexity.

(c)
7 marksAsked in 2 of 7 papers

For the given set of items and knapsack capacity = 5 kg, find the optimal solution for the 0/1 knapsack problem using dynamic programming.

ItemWeightValue
I123
I234
I345
I456

Also asked in Summer 2026 Q3c

Q.4

14 Marks
(a)
3 marksAsked in 2 of 7 papers
Explain DFS with suitable example.

Also asked in Summer 2023 Q4b

(b)
4 marksAsked in 2 of 7 papers
Enlist the advantages and disadvantages of dynamic programming.

Also asked in Summer 2023 Q3b

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

Define minimum spanning tree. Explain Prim’s algorithm with suitable example.

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

(a)
3 marksAsked in 2 of 7 papers
Explain BFS with suitable example.

Also asked in Summer 2026 Q4a OR

(b)
4 marksAsked in 6 of 7 papers

Define principal of optimality. Explain its use in Dynamic Programming Method.

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

(c)
7 marksAsked in 2 of 7 papers

"A greedy strategy will work for fractional Knapsack problem but not for 0/1", is this true or false? Explain with suitable example.

Also asked in Summer 2026 Q3b OR

Q.5

14 Marks
(a)
3 marks
Define string matching problem. Define valid shift and invalid shift.
(b)
4 marksAsked in 2 of 7 papers
Define the followings:
i)Articulation point
ii)Acyclic Directed Graph
iii)Back Edge
iv)Tree

Also asked in Winter 2025 Q4a OR

(c)
7 marksAsked in 3 of 7 papers
Explain P, NP, NP complete and NP-Hard problems. Give examples of each.

Also asked in Winter 2023 Q5c, Summer 2023 Q5c OR

(a)
3 marksAsked in 5 of 7 papers

Explain Backtracking Method. Give solutions for 4-queens problem using backtracking method.

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

(b)
4 marks
Explain in-order, pre-order and post-order traversals of the graph.
(c)
7 marks
Write short note on the followings:
i)Approximation algorithms
ii)Randomized algorithms

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
Winter 202570 marks · 5 questions
Summer 202570 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 2024, 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