Scribd
Upload
41 views3 pages

IAT 3 EXPECTED QUESTIONS II AI&DS With NM

Hi nm

Uploaded by

lekha10102005
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
41 views3 pages

IAT 3 EXPECTED QUESTIONS II AI&DS With NM

Hi nm

Uploaded by

lekha10102005
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/ 3

(Approved by AICTE, Affiliated to Anna University & Accredited by NBA)

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

IAT 3 -EXPECTED QUESTIONS

Part-A

1. What is Dijkstra algorithm used for?


2. Define principle of optimality.
3. What is memorization?
4. Differentiate Dynamic Programming and Greedy Technique.
5. Discuss about two types of encoding methods in Huffman codes.
6. Write the algorithm for 0/1 knapsack memory function.
7. What is the applications use of dynamic programming for the solution?
8. What are the problems solved in dynamic programming?
9. Define coin changing problem with example? What are the two ways?
10. How dynamic programming approach is used?
11. What is adjacency matrix, digraph transitive closure?
12. Write the applications of Huffman trees.
13. List the complexity of warshall and Floyd alg and list its adv and disadv.
14. Write the difference between divide and conquer and greedy algorithm.
15. Compare feasible and optimal solution.
16. what is weighted graph?
17. Outline a directed graph with an example
18. Write the applications of greedy method.
PART-B & C
1. Explain about the multistage graph in detail and solve the following using backward
approach with appropriate steps.

2. Construct all possible subsets of weights that sum to M for the given instance n=6.
M=30 and weights (1: 6) = (5,10,12,13,15,18).
3. Explain how Huffman trees are constructed for assigning shorter bit strings to high-
frequency symbols and longer ones to low-frequency symbols. Generate the Huffman
tree and code for the following.
character A B C D E

Probability 0.4 0.1 0.2 0.15 0.15

4. Apply the bottom-up dynamic programming algorithm to the following instance


of the knapsack problem with the capacity W=6.
Item 1 2 3 4 5

Weight 3 2 1 4 5

Value $25 $20 $15 $40 $50

5. Solve the all-pair shortest path problem for the digraph using Floyd’s algorithm
and also explain the same with respective algorithm.
6. Evaluate the optimal solution to the fractional knapsack problem with given data and
the capacity of knapsack, W=50 using greedy technique and write the algorithm.

7. Draw and outline the step-by-step successive key insertions of the Optimal Binary Search
tree (OBST) for the given nodes and their respective probabilities are (do, int, if, while)
& P (0.1,0.2,0.4,0.3). Explain the algorithm for the same.
8. Write the Huffman’s Algorithm. Construct the Huffman’s tree for the following data
and obtain its Huffman’s code.

Character A B C D E --

Probability 0.5 0.35 0.5 0.1 0.4 0.2

9.Solve the following instance of the 0/1, knapsack problem given the knapsack
capacity is W = 5 using dynamic programming .
ITEM WEIGHT VALUE
1 4 10
2 3 20
3 2 15
4 5 25

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