Scribd
Upload
481 views1 page

Adsa Imp Questions For Semester

This document outlines the topics and questions covered in 6 modules. Module 1 covers solving recurrences with examples and analyzing time complexity. Module 2 builds a max heap and covers B-trees with insertion/deletion examples. Module 3 differentiates greedy and dynamic programming, covers divide and conquer strategies and using both approaches to solve knapsack. Module 4 covers the travelling salesman problem, optimal binary search trees and matrix chain multiplication. Module 5 covers longest common subsequence, Huffman coding, and Rabin-Karp/KMP algorithms. Module 6 explains genetic algorithms and the vertex cover problem.

Uploaded by

Hacker Ranjan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
481 views1 page

Adsa Imp Questions For Semester

This document outlines the topics and questions covered in 6 modules. Module 1 covers solving recurrences with examples and analyzing time complexity. Module 2 builds a max heap and covers B-trees with insertion/deletion examples. Module 3 differentiates greedy and dynamic programming, covers divide and conquer strategies and using both approaches to solve knapsack. Module 4 covers the travelling salesman problem, optimal binary search trees and matrix chain multiplication. Module 5 covers longest common subsequence, Huffman coding, and Rabin-Karp/KMP algorithms. Module 6 explains genetic algorithms and the vertex cover problem.

Uploaded by

Hacker Ranjan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MODULE 1

1. LIST DIFFERENT METHODS OF SOLVING RECURRENCES AND EXPLAIN WITH EXAMPLE –10 MARKS
2. COMPUTE WORST CASE COMPLEXITY OF FOLLOWING PROGRAM

MODULE 2
1. BUILD A MAX HEAP FOR FOLLOWING 45,65,34,25,78,56,15 – 5 MARKS
2. DEFINE B- TREE AND EXPLAIN INSERTION AND DELETION OPERATIONS OF B TREE WITH AN EXAMPLE OF
EACH – 10 MARKS

3. --10 MARKS
MODULE 3
1) GREEDY AND DYNAMIC PROGRAMMING APPROACH FOR ALGORITHM DESIGN – 5 MARKS
2) DIFFERENTIATE BETWEEN GREEDY METHOD AND DYNAMIC PROGRAMMING– 5 MARKS
3) EXPLAIN DIVIDE AND CONQUER STRATEGY IN BINARY SEARCH—5 MARKS
4) GREEDY AND DYNAMIC PROGRAMMING APPROACH FOR ALGORITHM DESIGN EXPLAIN HOW BOTH CAN BE
USED TO SOLVE KNAPSACK PROBLEM– 10 MARKS
5) EXPLAIN KNAPSACK PROBLEM WITH AN EXAMPLE OR
KNAPSACK SUM

--10 MARKS
6) WRITE ALGORTIHM ON QUICKSORT AND COMMENT ON COMPLEXITY
OR SUM OF QUICKSORT –10 MARKS [PLEASE
DO TIME COMPLEXITY OF IT MIGHT BE ASKED]
MODULE 4
1) EXPLAIN TRAVELLING SALESMAN PROBLEM OR YOU GET A SUM –10 MARKS

2) WRITE A NOTE ON OPTIMAL BINARY SEARCH TREE –10 MARKS


3) EXPLAIN MATRIX CHAIN MULTIPLICATION IN DETAIL –10 MARKS
MODULE 5
1) LCS SUM –10 MARKS

2) HUFFMAN CODE SUM –10 MARKS

3) EXPLAIN RABIN KARP ALGORITHM IN DETAIL –10 MARKS


4) EXPLAIN KMP ALGORITHM WITH AN EXAMPLE AND ALSO STATE ITS TIME COMPLEXITY
–10 MARKS
MODULE 6
1) EXPLAIN GENETIC ALGORITHMS IN DETAIL–10 MARKS
2) EXPLAIN VORTEX – COVER PROBLEM IN DETAIL –10 MARKS

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy