Gujarat Technological UniversitySummer 2023 examination

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

11 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
Define following terms:
i)Big O Notation,
ii)Big Theta Notation,
iii)Big Omega Notation.
(b)
4 marksSame type asked in 2 of 7 papers

Perform Bucket sort for following sequence: 30, 12, 22, 66, 48, 27, 35, 43, 47, 41.

Also asked in Winter 2024 Q2b

(c)
7 marks

Explain the bubble sort algorithm and derive its best case, worst case, and average case time complexity.

Q.2

14 Marks
(a)
3 marksAsked in 3 of 7 papers
Define Algorithms and characteristics of algorithms.

Also asked in Winter 2025 Q1b, Winter 2023 Q1a

(b)
4 marks

What is a recurrence? Solve recurrence equation for T (n) =T (n-1) + 1 using substitution method.

(c)
7 marksAsked in 3 of 7 papers

Discuss Binary search algorithm, also write and solve its recurrence relation.

Also asked in Summer 2025 Q1c, Winter 2024 Q2c OR

(c)
7 marks
Explain Merge Sort algorithm with suitable example.

Q.3

14 Marks
(a)
3 marksAsked in 6 of 7 papers
Explain principle of optimality with suitable example.

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

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

Also asked in Winter 2024 Q4b

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

Given the denominations: d1=1, d2=4, d3=6. Calculate for making change of Rs. 8 using dynamic programming.

Also asked in Winter 2023 Q4b

(a)
3 marks
Explain Weighted Graph, Undirected Graph, Directed Graph.
(b)
4 marksAsked in 2 of 7 papers
Discuss advantages and disadvantages of greedy algorithm.

Also asked in Summer 2024 Q4a OR

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

Consider weights w=(3,4,6,5) and profit v=(2,3,1,4) and Knapsack capacity W=8. Find the maximum profit using dynamic approach.

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

Q.4

14 Marks
(a)
3 marksSame type asked in 5 of 7 papers
Find an optimal Huffman code for the following set of frequency. a :

40, b: 20, c: 15, d: 30, e: 10.

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

(b)
4 marksAsked in 2 of 7 papers
Explain depth first traversal using suitable example.

Also asked in Winter 2024 Q4a

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

Draw the minimum spanning tree correspond to following graph using Prim’s algorithm and find the MST weight:

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

(a)
3 marks

Differentiate between Kruskal’s algorithm and Prim’s algorithm for finding MST.

(b)
4 marksSame type asked in 3 of 7 papers
Explain the need of topological Sort with example.

Also asked in Summer 2026 Q4b OR, Winter 2025 Q5b

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

Draw the minimum spanning tree correspond to following graph using Kruskal’s algorithm and find weight of MST:

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

Q.5

14 Marks
(a)
3 marksSame type asked in 5 of 7 papers
Explain Spurious hits with an example.

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

(b)
4 marksAsked in 4 of 7 papers
Write the pseudocode for Naïve String-Matching Algorithm.

Also asked in Winter 2025 Q5a, Summer 2025 Q5c, Summer 2024 Q5b OR

(c)
7 marksAsked in 2 of 7 papers

What is state space tree. How do you solve the Eight queens problem using backtracking with the help of state space tree.

Also asked in Summer 2026 Q5a

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

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

(b)
4 marksAsked in 2 of 7 papers

Differentiate between Backtracking and Branch-and-Bound algorithms.

Also asked in Winter 2025 Q5b OR

(c)
7 marksAsked in 3 of 7 papers

Define P, NP, NP complete and NP-Hard problems. Give examples of each.

Also asked in Winter 2024 Q5c, Winter 2023 Q5c

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
Winter 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) (Summer 2023, 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