Multimedia Networking Principles homework. IT & Computer Science Essay (Essay Sample)

Student's Name
Professor's Name
Course Number
Date
Problem 1
The following steps are involved for the Huffman tree:
Step 1: For each unique character, make a node and precede with a min-heap of the nodes
Step 2: Achieve two nodes from the min-heap using the minimum frequency possible
Step 3: create a unique node that corresponds with the sum of the two nodes' preceding frequency. The first node that is extracted makes it the left child, and the child on the right will be the remaining extracted node and include this said node to the min-heap.
412750504825GDECABFH: 28CABFH: 18GDE: 10H: 10CABF: 8DE: 5G: 5D:2E:3F: 5CAB: 3C: 1AB: 2A:1B:100GDECABFH: 28CABFH: 18GDE: 10H: 10CABF: 8DE: 5G: 5D:2E:3F: 5CAB: 3C: 1AB: 2A:1B:1Step 4: Repeat steps 2 and 3 just before the heap that consists of a single node. Now the root node is the node that remains, meaning the tree is complete.
Problem 2
Planning a successful and elite organization network requires an exact portrayal and demonstrating of organization traffic. The displaying of video outline sizes is regularly applied in reenactment examines and numerical examination and creating streams for testing and consistency purposes. Plus, video traffic is accepted as a significant wellspring of sight and sound traffic in future heterogeneous organizations. In this way, the factual dispersion of video information can be utilized as the contributions for organizations' execution. They utilized the fitting conveyance for three frame sizes; B frames, Iframe and P frames. The analysis of generated traces are as below: