Explain shannon -fano algorithm, Computer Graphics

Assignment Help:

(a) Differentiate between the following compression algorithm:

1. Shannon -Fano Algorithm and
2. Huffman Encoding

(b) A statistical encoding algorithm is being considered for the transmission of a large number of long text files over a public network. Part of the file content .is as follows:

DODOCOCORICO

Using the Shannon - Fano algorithm compute the following:

i) the average number of bits per codeword

ii) the entropy of the source

iii) the minimum number of bits required assuming fixed-length codeword

iv) the compression ratio based on this algorithm if we assume an ASCII of 8 bits representation


Related Discussions:- Explain shannon -fano algorithm

Transformation for 3-d rotation, Transformation for 3-D Rotation Rotat...

Transformation for 3-D Rotation Rotation in 3-dimensions is considerably more complicated then rotation in 2-dimensions. In 2-Dimentional, a rotation is prescribed via an angl

Briefly describe what you understand by smoothing, Question: (a) List a...

Question: (a) List and explain different types of lights that can be used in After Effects. (b) How is the density of dots between the boxes in a motion path related to th

Perspective distortion - ray tracing methods , Perspective Distortion - Pol...

Perspective Distortion - Polygon Rendering and Ray Tracing Methods Anomalies are introduced since interpolation is performed after perspective transformation in the 3-D scree

Define octrees, Define Octrees?  Hierarchical tree structures called oc...

Define Octrees?  Hierarchical tree structures called octrees, are used to show solid objects in some graphics systems. Medical imaging and other applications that needs display

Tcp connection, what is the opengl code for tcp connection?

what is the opengl code for tcp connection?

Lamberts cosine law - diffuse reflection, Lamberts Cosine Law - Diffuse Ref...

Lamberts Cosine Law - Diffuse Reflection "LAMBERTS COSINE LAW" specify that the radiant energy from any minute surface area dA in any direction θ relative to the surface usual

2d clipping, What is 2d clipping in computer graphics

What is 2d clipping in computer graphics

High level techniques (motion generalized), High level techniques (motion g...

High level techniques (motion generalized) Techniques utilized to explain general motion behavior of any of graphic object, such techniques are algorithms or models utilized to

Trivial acceptance case of cohen sutherland line clippings, Trivial accepta...

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd