1. Suppose A, B, C, D, E, F, G and H are 8 items and suppose they are assigned weights as follows: Data items: A BC D E F GH Weight: 5 7 21 14 2 21 10 8 Now construct the Tree by using Huffman Algorithm and encoding each node.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
1. Suppose A, B, C, D, E, F, G and H are 8 items and suppose they are assigned weights as
follows:
Data items: A в сD E FG H
Weight:
5 7 21 14 2 21 10 8
Now construct the Tree by using Huffman Algorithm and encoding each node.
2. Solve the following instance of the 0/1 knapsack problem using dynamic programming
approach. Assume that the knapsack capacity is 9.
Item
Weight
Benefit
1
$8
2
2
$4
3
5
$6
4
7
$10
3. Find the longest subsequence, where S1 = {B, C, D, A, A, C, D} and S2 = {A, C, D, B,
A, C}
%3D
Transcribed Image Text:1. Suppose A, B, C, D, E, F, G and H are 8 items and suppose they are assigned weights as follows: Data items: A в сD E FG H Weight: 5 7 21 14 2 21 10 8 Now construct the Tree by using Huffman Algorithm and encoding each node. 2. Solve the following instance of the 0/1 knapsack problem using dynamic programming approach. Assume that the knapsack capacity is 9. Item Weight Benefit 1 $8 2 2 $4 3 5 $6 4 7 $10 3. Find the longest subsequence, where S1 = {B, C, D, A, A, C, D} and S2 = {A, C, D, B, A, C} %3D
Expert Solution
steps

Step by step

Solved in 2 steps with 12 images

Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education