3. Explain why a non-full binary tree cannot correspond to an optimal prefix-free code. (This is similar to problem 15.3-2 from CLRS) 4. Find an optimal Hoffman code for g:5, o:15, u:28, m:25, b:10, c:17. 5. Given an optimal Hoffman code represented by B(T) for characters C, what is the expected length in bits of a string of n characters?

3. Explain why a non-full binary tree cannot correspond to an optimal prefix-free code. (This is similar to problem 15.3-2 from CLRS) 4. Find an optimal Hoffman code for g:5, o:15, u:28, m:25, b:10, c:17. 5. Given an optimal Hoffman code represented by B(T) for characters C, what is the expected length in bits of a string of n characters?

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

b) Consider graph G=(V, E) with six nodes and eight edges. The edges have distinct integer weights. a 17 b 10 7 2 f 6 The minimum spanning tree of G is constructed by Kruskal's algorithm and is shown in tree MST below: a 17 101 10 7 C f d 6 The edge weights of only those edges that are in the MST are given in graph G. What is the minimum possible summation of edge weights for the edges (a, b), (e, d), (c, d)? (5 points) As you justify your answer for edge weights, please use graph G and apply Kruskal's algorithm to obtain the MST step by step (5 points). Show and explain all your work.
Consider eight points on the Cartesian two-dimensional x-y plane. a g C For each pair of vertices u and v, the weight of edge uv is the Euclidean (Pythagorean) distance between those two points. For example, dist(a, h) = V4? + 1² = v17 and dist(a, b) = v22 + 0² = 2. Using the algorithm of your choice, determine one possible minimum-weight spanning tree and compute its total distance, rounding your answer to one decimal place. Clearly show your steps.
Please provide a solution and avoid teaching here
Given an undirected weighted graph G with n nodes and m edges, and we have used Prim’s algorithm to construct a minimum spanning tree T. Suppose the weight of one of the tree edge ((u, v) ∈ T) is changed from w to w′, design an algorithm to verify whether T is still a minimum spanning tree. Your algorithm should run in O(m) time, and explain why your algorithm is correct. You can assume all the weights are distinct. (Hint: When an edge is removed, nodes of T will break into two groups. Which edge should we choose in the cut of these two groups?)
Based on Theorem 4.4.2 P.165, the average height of a leaf in a binary tree with 128 leaves is at least
Suppose there is undirected graph F with nonnegative edge weights we ≥ 0. You have also calculated the minimum spanning tree of F and also the shortest paths to all nodes from a particular node p ∈ V . Now, suppose that each edge weight is increased by 1, so the new weights are we′ = we + 1. (a) Will there be a change of the minimum spanning tree? Provide an example where it does or prove that it cannot change. (b) (3 points) Will the shortest paths from p change? Provide an example where it does or prove that it cannot change.
a. Write the Kruskal's Algorithm to find minimum spanning tree! b. Use Kruskal's algorithm to find a minimum spanning tree for the given weighted graph and list the stages! 2 1 b 2 1 d 3 1 If 3 8 2 3 4 3 li 4 k 3 4 2 2 3 m 2. 3. 3. 2. 3. 2. 3. 2.
In the Euclidean (metric) Traveling Salesperson Problem (TSP), we started with a DFS traversal of the minimum spanning tree (MST) and then skipped vertices that we had already visited. Why were we able to allow skipping of nodes? O Because DFS run on an MST adds an exponential number of vertices O In a metric space the triangle inequality states that removing a vertex cannot lengthen the path O In the Euclidean metric, distance in measured in the number of edges, so removing edges makes the path shorter O It feels right
Consider the Fibonacci sequence F(0)=0, F(1)=1 and F(i)=F(i-1)+F(i-2) for i > 1. For the sake of this exercise we define the height of a tree as the maximum number of vertices of a root-to-leaf path. In particular, the height of the empty tree is zero, and the height of a tree with a single vertex is one. Prove that the number of nodes of an AVL tree of height h is at least F(h) and this inequality is tight only for two values of h.
Consider the following graph. b Q 17 3 6 5 3 7 d 3 QU 2 g 7 h $ برا 3 N نی k 1 (i) Using either Prim's or Kruskal's algorithms, determine the minimum spanning tree of the tree given below. State which algorithm you used. (ii) Find the shortest path of the graph below from A to L. Use Dijsktra's algorithm and show all working.
(c) Consider a sort of items, according to their keys, that inserts all the items one at a time into an initially empty regular binary search tree and then applies an in-order traversal to complete the sort. Assume that all items have distinct keys. Using big-Theta notation.what is the worst-case complexity of the sort? What is the average-case complexity of the sort? Now answer the same two questions if an AVL tree is used instead of a regular binary search tree.
You are given a binary search tree root and two nodes p and q. Find the lowest common ancestor (LCA) of nodes p and q. The lowest common ancestor is defined as the lowest node in root that has both p and q as descendants (where we allow a node to be a descendant of itself). Select the optimal solution in terms of time complexity. If time complexities are same for multiple solutions, select the one with optimal space complexity. Include recursion stack in the space complexity. function lca(root, p, q): if not root: return None left = lca(root.left, p, q) right = lca(root.right, p, q) if left and right: return root return left if left else right function lca(root, p, q): if p.val < root.val and q.val < root.val: return lca(root.left, p, q) elif p.val > root.val and q.val > root.val: return lca(root.right, p, q) else: return root function lca(root, p, q): while root: if p.val < root.val and…