Complete the sentence.

ossless compression tools generally use either Huffman coding or Lempel-Ziv-Welch (LZW) coding. Discuss the advantages and disad

anygoal [31]

Answer:

It we were asked to develop a new data compression tool, it is recommended to use Huffman coding since it is easy to implement and it is widely used.

Explanation:

The pros and the cons of Huffman coding

Huffman coding is one of the most simple compressing encoding schemes and can be implemented easily and efficiently. It also has the advantage of not being patented like other methods (e.g. arithmetic codingfor example) which however are superior to Huffman coding in terms of resulting code length.

One thing not mentioned so far shall not be kept secret however: to decode our 96 bit of “brief wit” the potential receiver of the bit sequence does need the codes for all letters! In fact he doesn’t even know which letters are encoded at all! Adding this information, which is also called the “Huffman table” might use up more space than the original uncompressed sentence!

However: for longer texts the savings outweigh the added Huffman table length. One can also agree on a Huffman table to use that isn’t optimized for the exact text to be transmitted but is good in general. In the English language for example the letters “e” and “t” occur most often while “q” and “z” make up the least part of an average text and one can agree on one Huffman table to use that on average produces a good (=short) result. Once agreed upon it doesn’t have to be transmitted with every encoded text again.

One last thing to remember is that Huffman coding is not restricted to letters and text: it can be used for just any symbols, numbers or “abstract things” that can be assigned a bit sequence to. As such Huffman coding plays an important role in other compression algorithms like JPG compression for photos and MP3 for audio files.

The pros and the cons of Lempel-Ziv-Welch

The size of files usually increases to a great extent when it includes lots of repetitive data or monochrome images. LZW compression is the best technique for reducing the size of files containing more repetitive data. LZW compression is fast and simple to apply. Since this is a lossless compression technique, none of the contents in the file are lost during or after compression. The decompression algorithm always follows the compression algorithm. LZW algorithm is efficient because it does not need to pass the string table to the decompression code. The table can be recreated as it was during compression, using the input stream as data. This avoids insertion of large string translation table with the compression data.

3 0

3 years ago

Polymorphism means ______________.

Westkost [7]

Answer:

Polymorphism means that a variable of supertype can refer to a subtype object.

Explanation:

For example, in Python programming language, a function that accepts an iterable object uses the concept of polymorphism because that function can accept strings, lists, tuples as arguments.

5 0

3 years ago

Read 2 more answers

Write a complete Java program called Rooter that gets a positive integer called "start" from the user at the command line and th

Nataly_w [17]

Answer:

The program in Java is as follows:

import java.util.*;

import java.lang.Math;

public class Rooter{

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

int start;

System.out.print("Start: ");

start = input.nextInt();

while(start<=0){

System.out.print("Number must be positive\nStart: ");

start = input.nextInt(); }

while(start>=0){

System.out.println(Math.sqrt(start));

start--; }

}

Explanation:

This declares start as integer

int start;

This prompts the user for input

System.out.print("Start: ");

This gets input for start

start = input.nextInt();

The following is repeated until the user input is valid i.e. positive

while(start<=0){

System.out.print("Number must be positive\nStart: ");

start = input.nextInt(); }

The following while loop prints the square root of each number till 0

while(start>=0){

System.out.println(Math.sqrt(start));

start--; }

4 0

3 years ago

After class, Anita and Bev make plans to study for their psychology exam together but cannot decide on a time or location. In ad

Paladinen [302]

Answer:

Option B; 30 SECONDS OR LESS.

Explanation:

Short-term memory, also known as primary or active memory, is the information we are currently aware of or thinking about.

When short-term memories are not rehearsed or actively maintained, they last mere seconds.

Most of the information kept in short-term memory will be stored for less than 30 seconds (approximately 20 to 30 seconds), but it can be just seconds if rehearsal or active maintenance of the information is not done.

Therefore, Anita likely will be able to retain the information in short-term memory, without additional processing, for 30 SECONDS OR LESS.

8 0

3 years ago

Casey Griggs is a very capable computer engineer. Recently, he noticed a problem that computer engineers have, and thought of a

diamong [38]

Answer:

serendipitous

Explanation:

this happened by chance in a positive manner.

8 0

3 years ago