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

Computations with phong shading, Computations with Phong Shading Compu...

Computations with Phong Shading Computations involved along with Phong Shading:  i)   Find out average unit normal vector at each polygon vertex. ii)   Linearly interpol

Briefly explain color profile, Question 1) Why are selection tools useful?...

Question 1) Why are selection tools useful? Describe them based on different categories Question 2) What are the different types of layers? Describe each type Quest

Reflecting the ball off of a polyline, To reflect the ball off of the polyl...

To reflect the ball off of the polyline, we need to re?ect it off of the segment that had the minimum thit. But the reflection computation depends only on t hit , n, P and v, so th

Define picture composition, QUESTION 1 Assume you work as Producer for...

QUESTION 1 Assume you work as Producer for the national TV channel in Mauritius. As such, you have been requested by the Director of Production to submit a proposal in the for

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.

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

Time delay and busy flag method, 1. Using a time Delay Method The delay...

1. Using a time Delay Method The delay required between issuing each character to the LCD is about 5-10ms (it's simply known as DELAY). When programming an LCD, a long delay is

Animation, name some of the standard motion in key frames

name some of the standard motion in key frames

Briefly explain how the median filter works, QUESTION 1 (a) Write a run...

QUESTION 1 (a) Write a run method in Image J environment for the following cases Contrast and Brightness Histogram Generation Histogram Equalisation   (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