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

Related questions

Q: Given an m-by-n chocolate bar, you need to break it into mn 1-by-1 pieces. You can break a bar only…

A: Breaking an existing piece horizontally or vertically will only increase the total number of pieces…

Q: Remove any node from the tree from #1. And replace it with a new value. Draw the resulting BST.

A: Deletion algorithm to delete a node from Binary search tree. Locate the node, which you want to…

Q: The following three are the traversal sequence for preorder, inorder and postorder of a binary tree.…

A: a.

Q: Consider the following game tree. The root is a maximizing node, and children are visited left to…

A: This algorithm follows bottom-up approach, so first from leaf nodes we will compare 2 values and…

Q: Let n be 22 . Let T be a binary rooted tree with n vertices. (a) What is the least number of levels…

A: We have given a rooted binary tree T with n=22 vertices. Least levels when each level is full means…

Q: In Python , Write a program to use Alpha-Beta algorithm to compute the Alpha-Beta value for the root…

A: In Python , Write a program to use Alpha-Beta algorithm to compute the Alpha-Beta value for the root…

Q: Using the height and level of a binary tree, compute the maximum number of internal, external, and…

A: Given :- Using the height and level of a binary tree, compute the maximum number of internal,…

Q: 3. Determine ONE rotation which reduces the height of the following binary search tree. Give the…

A: The given binary search tree is already fairly balanced, but we can still apply rotations to further…

Q: Create a divide-and-conquer method for determining the level count of a binary tree. Your method…

A: The divide-and-conquer algorithm can be defined as the it divides a problem into sub problems and…

Q: 12. Use Prim's algorithm to construct a minimum spanning tree starting with node a. Indicate the…

Q: root M D G Given that when a choice is available, nodes are visited left to right, what is the…

A: At first we need to divide them levelAt level 1 : Node AAt level 2: Node M,Node D,Node BAt level…

Q: a) What is the number of nodes with 0 child: Answer must be a numeric value. b) What is the number…

A: NOTE: We are authorized to answer only the first three questions at a time when multi-part questions…

Q: Suppose we have an AVL tree of height h storing n entries. Mark all of the following statements as…

A: An AVL Tree is a type of tree which check whether the left and right subtree doesn't have a…

Q: a pair, print the smaller element first. Order of different pairs doesn't matter. Input format : The…

A: Explanation:The code uses the BinaryTreeNode class to define the structure of a binary tree node.The…

Q: Find the post order tree traversal of the below tree from the following? 14 O a. 1 4 7 6 3 13 14 10…

A: Explanation: given tree is: 8,3,10,1,6,14,4,7,13 Post-order: 1 4 7 6 3 13 14 10 8 so option b,c,d…

Q: Question2 (Adversarial Search): 1. Perform MinMax search by filling in the internal node values in…

Q: Construct a B+-tree for the following set of search key values, where each node can contain at most…

A: Initially root is NULL. Let us first insert 10.

Q: 11. Show by induction that the number of nodes in a binary tree of height h is at most 24*1 – 1.

Q: Create a SINGLE, binary search tree using the following three groups of input. For EACH of the three…

A: The answer for the given question is as follows.

Q: AVL tree with a height of 3

A: bf ( Branching factor) = height of left subtree - height of right subtree

Q: • List all labeled trees on 4 vertices, and write their Prüfer codes. (There should be 42 = 16 of…

A: According to the question, we have to List all labeled trees of 4 vertices with their Prufer code…

Q: Please draw the following: Form a binary tree with the root node holding 20, the left and right…

A: Form a binary tree with the root node.

Q: At the most, each node in a Binary tree may contain the following attributes: children.

A: Given: Each node in a Binary tree can have the following properties at most: children.

Q: Construct a Huffman tree for the given eight leaf nodes (a, b, c, d, e, f, g, h} with weights of 5,…

Q: 17 65 84 94 98 Node 84 is to be removed from the above BST Tree. The first step is to find the…

A: Here in this question we have given a BST and we have asked to remove node 84 from the BST and also…

Q: Q: Draw the tree for the following sequence of keys using postorder traversing. D,H,E,F,B,I,J,G,C,A…

A: Given : D,H,E,F,B,I,J,G,C,A

Q: Perform the given task. Tree

A: In computer science, a tree is an abstract data type that displays a hierarchical tree structure…

Q: Draw a non-empty B-Tree where the degree is 4 and the height is 3. Place some keys to the nodes.…

A: the answer is an given below :

Q: Data Structure and algorithms

A: Data Structure and algorithms

Q: A) Let A={1,2, 3, 4, 5} and T = {(5, 1), (4, 2), (1, 3), (1,4)}. Find the root and height of the…

Q: Given 8 red nodes, design a red-black tree with

Q: 3. Given the sequence of numbers, use appropriate data structure concepts and develop a Binary…

A: Note: As per company policy, the answer of the first question is given in this solution. Kindly…

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

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 12 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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

Q4:
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.
Use Prim's algorithm to find the minimum spanning tree, write the sum of the weights of the resulting tree.
Please show steps clearly
- 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 ?