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

What is seed fill, What is seed fill?  One way to fill a polygon is to ...

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel

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

Transformation for 3-d scaling, Transformation for 3-D Scaling As we a...

Transformation for 3-D Scaling As we already seen that the scaling process is mainly utilized to change the size of an object. The scale factors find out whether the scaling i

List out the merits and demerits of penetration methods, List out the merit...

List out the merits and demerits of Penetration methods?  The merits and demerits of the Penetration methods are as follows  It is a less expensive technique It has

Illustration of bezier curves - modeling and rendering, To prove ‾P (1) = p...

To prove ‾P (1) = p n Solution : since in the above case we determine each term excluding B n,n (u) will have numerous of (1 - u) i (i = 0 to n) consequently by using u = 1

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Normalization transformation, what is normalization transformation?why is i...

what is normalization transformation?why is it needed and important?give simple example also.

Taxonomy of projection - viewing transformation, Taxonomy of Projection - v...

Taxonomy of Projection - viewing transformation There are different types of projections as per to the view that is essential. The subsequent figure 3 demonstrates taxonomy o

Resolution-introduction to computer graphics, Resolution Graphic demons...

Resolution Graphic demonstrations are utilized in presentations to assist convey a concept or express a mood, two kinds of demonstrations graphics are: Vector, and B

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