edited by
576 views
4 votes
4 votes

Which of the following frequencies for A,B,C and D can generate the following Huffman tree? (Select all that apply.)

  1. $p_A=0.4, p_B=0.3, p_C=0.2, p_D=0.1$
  2. $p_A=0.35, p_B=0.25, p_C=0.2, p_D=0.2$
  3. $p_A=0.25, p_B=0.25, p_C=0.25, p_D=0.25$
  4. $p_A=0.2, p_B=0.35, p_C=0.2, p_D=0.25$
edited by

1 Answer

2 votes
2 votes
how can B be  answer if B needs to be pulled out first from priority queue....  other symmetry of A and B would lead to 2 different structure of binary tree and one of them would not match with given structure
Answer:

Related questions

712
views
2 answers
2 votes
GO Classes asked Feb 5
712 views
Consider the following array$: [32, 33, 5, 2, 14, -4, 22, 39, 34, -9].$ We apply a certain sorting algorithm and observe that the ... applied?Merge sort (top-down approach)Bubble sortQuicksort (Using First element as pivot)Insertion sort
790
views
2 answers
4 votes
GO Classes asked Feb 5
790 views
Consider the following network, which consists of two routers (R1 and R2), two switches (S1 and S2), and four hosts (H1, H2, H3, and H4). ... will have destination mac address of R2Packet leaving R2 will have destination mac address of S2
832
views
1 answers
13 votes
GO Classes asked Feb 5
832 views
Let $\mathrm{G}$ be a simple undirected graph on 8 vertices such that there is a vertex of degree 1 , a vertex of degree 2 , a vertex of degree 3 , ... the following can be the degree of the last vertex? (Select all that are possible)0348
459
views
1 answers
5 votes
GO Classes asked Feb 5
459 views
Let $A$ be a $20 \times 11$ matrix with real entries. After performing some row operations on $A$, we get a matrix $B$ which has 12 nonzero rows. Which of the following is/are ... $A v=0$ then $B v$ is also 0.The rank of $B$ is at most 11.