Scribd
Upload
26 views2 pages

Question Bank

The document is a question bank covering various topics in algorithms, including definitions and problem-solving techniques for algorithms, sorting methods like selection and bubble sort, and string matching. It also addresses specific problems such as the Traveling Salesman Problem (TSP), Knapsack problem, and graph algorithms like Dijkstra's and Floyd's algorithm. Additionally, it includes tasks for constructing Huffman codes and solving directed and undirected graphs using different algorithmic approaches.

Uploaded by

drivemaheshs
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
26 views2 pages

Question Bank

The document is a question bank covering various topics in algorithms, including definitions and problem-solving techniques for algorithms, sorting methods like selection and bubble sort, and string matching. It also addresses specific problems such as the Traveling Salesman Problem (TSP), Knapsack problem, and graph algorithms like Dijkstra's and Floyd's algorithm. Additionally, it includes tasks for constructing Huffman codes and solving directed and undirected graphs using different algorithmic approaches.

Uploaded by

drivemaheshs
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/ 2

Question Bank – 1

1. Define Algorithm. Explain the fundamentals of algorithmic problem solving


2. Explain asymptotic notations with example.
3. Explain selection sort with an example. Write an algorithm.
4. Explain bubble sort with an example. Write an algorithm.
5. Explain Brute Force String Matching with an example. Compare best case and worst case
efficiency of the algorithm.
6. Define TSP. Solve the following TSP which is represented as graph using Brute force approach

paka 6 or 7

6 Or 7

7. Define Knapsack problem. Solve the following instances of Knapsack problem using Brute force
approach paka 7

Item Weight Profit Item Weight Profit

1 3 $50 1 7 $42
2 4 $30 2 3 $12
3 2 $60 3 4 $40
4 5 $40 4 5 $25

8. Solve the following instances of Knapsack problem using Dynamic programming approach. And
Memory function method. Knapsack capacity M=10

Item Weight Profit Item Weight Profit


8 paka both approch 1 3 $50 1 7 $42
2 4 $30 2 3 $12
3 2 $60 3 4 $40
4 5 $40 4 5 $25

x Define Transitive closure. Build Warshall’s algorithm to compute Transitive Closure. Solve the
9.
following directed graph using Warshall’s algorithm.

this or 10
10. Define All Pair Shortest Path Problem .Write Floyd’s algorithm to compute All Pair
Shortest Path Problem. Solve the following directed graph using Floyd’s algorithm.

11. Write an algorithm and describe the time complexity for the following
11  Dijkstra’s algorithm
may be  Kruskal’s algorithm
 Prim’s algorithm

12. Solve the following directed graph using Dijkstra’s algorithm

12 or 13 --
i choose 13

13 - - - -12 or 13
Source – 5 Source – a

13. Solve the following undirected graph using Prim’s algorithm and Kruskal’s algorithm

read this 13

14. Define Huffman code. Construct Huffman tree and resulting code for the following
Character A B C D E
read this 14
Probability 0.4 0.1 0.2 0.15 0.15
i) Encode the text: ABACABAD read this
ii) Decode the text:100010111001010

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