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

Cohen sutherland, explain cohen sutherland line clipping algorithm

explain cohen sutherland line clipping algorithm

Advantages of the z-buffer method, Advantages of the z-buffer method:      ...

Advantages of the z-buffer method:              1) The z-buffer method or algorithm is easy to apply and it needs no sorting of surface in a scene. 2) In z-buffer algorithm

#, normal vector

normal vector

Derive the common transformation of parallel projection, Derive the common ...

Derive the common transformation of parallel projection into the xy-plane in the direction of projection d=aI+bJ+cK. Solution: The common transformation of parallel projection

Define computer graphics, Define Computer graphics.  Computer graphics ...

Define Computer graphics.  Computer graphics remains one of the most popular and rapidly growing computer fields. Computer graphics may be explained as a pictorial representati

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

Line drawing algorithm, Adavantage and disadvantages of DDA and Bresenhams ...

Adavantage and disadvantages of DDA and Bresenhams line drawing algorithm

Define affine transformation, Define Affine transformation?  A coordina...

Define Affine transformation?  A coordinate transformation of the form X= axxx +axyy+bx, y 'ayxx+ayy y+by  is known as a two-dimensional affine transformation. Every of the tra

For orthographic parallel projection, For orthographic parallel projection:...

For orthographic parallel projection:    glOrtho(left, right, bottom, top, near, far);  glOrtho2D(left, right, bottom, top);    Here left, right define the x-direction ex

Various ways of simulating motion, Various ways of simulating motion:- ...

Various ways of simulating motion:- -        Zero Acceleration (Constant Speed)           -        Non-Zero Accelerations -        Positive accelerations

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