1. Suppose A, B, C, D, E, F, G and H are 8 items and suppose they are assigned weights asfollows:Data items: A в сD E FG HWeight:5 7 21 14 2 21 10 8Now construct the Tree by using Huffman Algorithm and encoding each node.2. Solve the following instance of the 0/1 knapsack problem using dynamic programmingapproach. Assume that the knapsack capacity is 9.ItemWeightBenefit1$822$435$647$103. Find the longest subsequence, where S1 = {B, C, D, A, A, C, D} and S2 = {A, C, D, B,A, C}%3D

in the following section we will see problem 1 in detail

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.

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

See similar textbooks

Similar questions

Please help with d, , and f
7 Write an insertion algorithm for B+ tree and Construct a tree for thefollowing set of key values: 2, 3, 5, 7, 11, 17, 19, 23, 29, 31 Assumethat the tree is initially empty and values are added in ascending order.Let the number of points that will fit in one node to be 5.
Suppose we have the following Binary Search Tree. 12 4 16 14 18 10 11 Algorithm Write up. Write an algorithm to determine the leaf nodes of the given tree reclusively. Output: The leaf nodes of the given tree are: 29 11 14 18
Consider the B-tree above. An internal node can have 2 to 4 children. A leaf node can hold 3 to 5 keys. Show the resulting B-tree after the deletion of each one of the following in the given order: 18, 12, 33, 19 33 18 23 48 10 12 15 18 19 20 21 22 23 30 31 33 45 47 48 50 52
Perform an inorder traversal of the tree to reveal a message.
Q1. Consider the following sequence of numbers: 15, 20, 24, 10, 13, 7, 30, 36, and 25. Insert these numbers one by one into an initially empty red-black tree, and illustrate the tree after each insertion. rotation is needed, present the status before and after the rotation and indicate which rotation is applied. For each node, indicate the color for each node like 15(RED) or 30(BLACK), Ensure that the tree maintains its red-black properties throughout the process. Q2. Given the following sets: A = {2, 4, 6, 8, 10}, B = {1, 3, 5, 7, 9}, C = {1, 2, 3, 4, 5}, and D = {5, 6, 7, 8, 9). Calculate the following set operations and provide the resulting sets: A U B, An C, B n D, (A U B) - C, and (C n D) A (AN B).
Use Prim's algorithm to find the minimum spanning tree, write the sum of the weights of the resulting tree.
- What is the number of leaf nodes in a 2-3-Tree with height k. - You are given a series of records whose keys are numbers. The records arrive in the following order : 15, 4, 21, 12, 10, 0, 9, 7, 3. Show all the steps of the construction of the Binary tree that results from inserting these records (assume that insertion preserves order). Show all the steps of the construction of the 2-3 tree that results from inserting these records.
A11 The following is a Huffman tree. Each node has a letter and a frequency, such as (T:2), which indicates that "T" has frequency 2, or simply a frequency when it is not a leaf node. In each iteration of Huffman's algorithm, two nodes from the priority queue are dequeued and combined into a new parent node with these nodes as two children and a frequency equal to the sum of their frequencies. (T:2) and (O:3) are combined into a new node with frequency 5 = 2+3 in the first iteration. Q: The sequence 1111011110011101110101001010 is decoded to ?