Scribd
Upload
56 views3 pages

Screenshot 2023-09-06 at 11.01.09 PM

1. This document is a test from the Department of Artificial Intelligence and Machine Learning Engineering at Guru Nanak Dev Engineering College for the course DAA. It contains 6 full questions across 3 modules testing algorithms like Huffman coding, greedy algorithms, dynamic programming, and NP-hard problems. 2. Students must answer any 3 full questions, choosing one from each module, testing their knowledge of topics like shortest paths, graph coloring, knapsack problems, traveling salesman problem, and backtracking within a time limit of 90 minutes. 3. The test aims to evaluate students' understanding of core concepts in algorithms and data structures like trees, graphs, heuristics, and computational complexity through practical problems involving

Uploaded by

sohailaftab810
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
56 views3 pages

Screenshot 2023-09-06 at 11.01.09 PM

1. This document is a test from the Department of Artificial Intelligence and Machine Learning Engineering at Guru Nanak Dev Engineering College for the course DAA. It contains 6 full questions across 3 modules testing algorithms like Huffman coding, greedy algorithms, dynamic programming, and NP-hard problems. 2. Students must answer any 3 full questions, choosing one from each module, testing their knowledge of topics like shortest paths, graph coloring, knapsack problems, traveling salesman problem, and backtracking within a time limit of 90 minutes. 3. The test aims to evaluate students' understanding of core concepts in algorithms and data structures like trees, graphs, heuristics, and computational complexity through practical problems involving

Uploaded by

sohailaftab810
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

GURU NANAK DEV ENGINEEERING

COLLEGE, BIDAR 585403


Affiliated to VTU Belgaum & approved by AICTE
New Delhi
Department of Artificial Intelligence and Machine Learning Engineering
B.E. 2021 Scheme – IPCC Courses
Continuous Internal Evaluation (CIE) Test – II
Academic Year: 2022-23
Course Name: DAA Course Code:
21CS42
Date: 08-9-2023 Time: 90 minutes
Max. Marks: 50 Semester: IV
Note: Answer any THREE full questions, choosing ONE full question from each module
Q. No Questions Marks CO BL
Module - 3
1.a) A document contains the letters “A” through “E” with 05 CO1 L6
frequencies is follows:
A:22,B:13,c:18,D:16,E:31
Construct a Huffman tree and codes,and

Encode:CAB,ADD,BAD,ACE
Decode:110011 & 1000110001

1.b) Find the optimal solution to the knapsack instance 05 CO1 L3


n=7,m=15 using greedy method

objects 1 2 3 4 5 6 7

Weight 2 3 5 7 1 4 1

Profits 10 05 15 07 06 18 03

OR
2.a) Apply heapsort for the list[9,7,1,8,3,6,2,4,10,5]using 05 CO1 L6
bottom up approach?

2.b) Find the optimal solution for the greedy job sequencing 05 CO1 L3
problem given n=4,profits[10,30,60,40],deadlines[2,3,1,3]

Module - 4
3.a) Explain the general procedure to solve a multistage graph 10 CO2 L2
problem using backward approach with an example?
3.b) Construct an Optimal binary search tree for the following 05 CO2 L6

3.c) Slove the instance of 0/1 knapsack problem using Dynamic 05 CO2 L3
programming approach
OR
4.a) Explain and Design Floyds algorithm to find shortest 10 CO2 L2
distances from all nodes to all other nodes
4.b) Apply Dynamic programming approach to solve the given 05 CO2 L6
travelling salesman problem

4.c) Find the shortest path from node 1 to every other node in 05 CO2 L3
the given graph using Bellman-Ford algorithm

Module - 5
5.a) Apply and Discuss What is hamiltonian circuit problem? 10 CO3 L6
What is the procedure to find Hamiltonian circuit of a
graph.Explain with example graphs also write its algorithm
and time complexity?

5.b) Explain and Color the regions in the map given in figure by 05 CO3 L2
applying backtracking graph color algorithm .Color=[RGB
& Y]

5.c) Apply branch and bound approach to solve the instance of 05 C03 L6
0/1 knapsack problem.

Knapsack capacity m=10

items 1 2 3 4

weights 4 7 5 3

value $40 $42 $25 $12

OR
6.a) Apply the branch and bound algorithm to solve the TSP 10 CO3 L6
problem for the graph below

6.b) Explain the classes of NP-hard and NP-complete? 05 CO3 L2

6.c) Apply and Explain What is the central principle of 05 CO3 L6


backtracking? Apply backtracking to solve the below
instance of sum of subset problem S = {5, 10, 12, 13, 15,
18} d = 30.
Name of the Course Teacher: Name of Course coordinator:

Signature with Date: ………………… Signature with Date:


……………….

Signature of PAC member \ HOD with date

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