Scribd
Upload
197 views2 pages

DAA Assignment 2 2020

This document contains an assignment for a Design and Analysis of Algorithms course. It includes 11 questions related to algorithms topics like divide and conquer, greedy techniques, minimum spanning trees, job sequencing, and Huffman coding. Students are asked to explain concepts, provide examples, solve problems, write algorithms, and construct a Huffman tree from given text frequencies. The assignment is for semester 4 and aims to assess various course outcomes through questions at different cognitive levels from Bloom's taxonomy.

Uploaded by

bsharsh
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
197 views2 pages

DAA Assignment 2 2020

This document contains an assignment for a Design and Analysis of Algorithms course. It includes 11 questions related to algorithms topics like divide and conquer, greedy techniques, minimum spanning trees, job sequencing, and Huffman coding. Students are asked to explain concepts, provide examples, solve problems, write algorithms, and construct a Huffman tree from given text frequencies. The assignment is for semester 4 and aims to assess various course outcomes through questions at different cognitive levels from Bloom's taxonomy.

Uploaded by

bsharsh
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

RNS Institute of Technology

(VTU Affiliated, AICTE Approved, NAAC ‘A’ Grade Accredited)


(UG Programs- CSE, ECE, ISE, EIE & EEE have been Accredited by NBA for the Academic Year 2018-19, 2019-20 & 2020-21)
DR. VISHNUVARDHAN ROAD, CHANNASANDRA, RR NAGAR POST, BENGALURU – 560098

Department of Computer Science and Engineering


(NBA Accredited for the Academic Years 2018-19, 2019-20, 2020-21)

ASSIGNMENT-II
(Submission Date: 2nd May - 2020)

SUBJECT TITLE Design & Analysis of Algorithms

SUBJECT TYPE Core

SUBJECT CODE 18CS42

ACADEMIC YEAR 2020 BATCH 2018-2022

SCHEME CBCS Scheme (Effective from the academic year 2017)

SEMESTER IV Sections A
FACULTY NAME and
Dr. Bhavanishankar K, Assistant Professor
DESIGNATION

Q. Bloom’s
Questions COs
No. LL

1 How decrease and conquer method is different from divide and conquer
L2 CO2
method. Explain the three variations of this technique.
What is topological ordering problem? Solve the given graph using
source removal method.

2 L3 CO2

3 Explain General Method of Greedy Technique along with the control


L2 CO3
abstraction.

4 Define feasible and optimal solutions. Write the algorithm for greedy
knapsack to obtain the optimal solution. L2 CO3
Find the optimal solution of the knapsack instance n=7, M=15,
5 (p1,p2,p3,p4,p5,p6,p7) = (10,5,15,7,6,18,3) and
L3 CO3
(w1,w2,w3,w4,w5,w6,w7) = (2,3,5,7,1,4,1).

6 Define the following: i) Spanning tree ii) Minimum cost spanning tree
L2 CO3
iii) Weight matrix. iv) Adjacency Linked list v) Adjacency Matrix
RNSIT – Department of CSE Subject Code: 18CS42 Assignment-II

Give appropriate examples for each

7
L3 CO3

a. Using Prim’s and Kruskal’s algorithm obtain the minimum cost


spanning tree for the graph given above and discuss about its
time complexity.
b. Compare Prim’s and Kruskal’s Algorithm.
a. Define job sequencing with deadline problem.
8. b. Elaborate on the solution approach to obtain the optimal
L1 CO3
sequencing of the jobs.
Write an algorithm for job sequencing with deadlines. Obtain optimal
9. solution for the given following jobs, profits and deadlines. n=5, P
(20, 15, 10, 5, 1) , D(2, 2, 1 , 3, 3). L3 CO3

Define the following with appropriate example


a. Fixed length coding
10. L2 CO3
b. Variable length coding
c. Prefix codes
a. Write the sequence of steps to construct the Huffman Tree for the
given text and their frequencies.
b. Obtain the Huffman Tree and hence the code to the following
instance
character Frequency
11 a 5
b 9 L3 CO3
c 12
d 13
e 16
f 45

Page | 2

You might also like