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 you mean by parallel projection, What you mean by parallel projection?...

What you mean by parallel projection?  Parallel projection is one in which z coordinates is discarded and parallel lines from every vertex on the object are extended unless the

Three dimensional transformations, Three Dimensional Transformations A ...

Three Dimensional Transformations A 3D geometric transformation is used extensively in object modelling and rendering.2D transformations are naturally extended to 3D situations

., Define the working procedure of CRT with diagram

Define the working procedure of CRT with diagram

Pitfalls in computer simulation - computer aided design, Pitfalls in comput...

Pitfalls in computer simulation Though generally avoided in computer simulations, in strict logic the rules governing floating point arithmetic even apply. For illustration, t

Transformation for 3-d reflection, Transformation for 3-D Reflection F...

Transformation for 3-D Reflection For 3-Dimensions reflections, we should to know the reference plane, which is a plane about that reflection is to be considered. Remember tha

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Exemplify bresenham line generation algorithm by digitizing, Example: Exem...

Example: Exemplify the Bresenham line generation algorithm through digitizing the line along with end points (20, 10) and (30, 18) Solution: m =    (y2 - y1)/( x2 - x1)  =

Modify the dda algorithm for negative sloped lines, 1. Modify the DDA algo...

1. Modify the DDA algorithm for negative sloped lines; discuss both the cases i.e., slope > 1 and 0   Ans. For the generation of lines along with negative slopes as:

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