Huffman

In 1903 Orville and Wilbur Wright returned to their hometown of Dayton, Ohio, from North Carolina, where they had piloted their powered flying machine for several short flights. They wanted to continue their research closer to home and chose a flat expanse called Huffman Prairie, eight miles east of Dayton, to continue their experiments. Here, in 1904 and 1905, the brothers refined their machine, creating the world's first practical powered aircraft.

This course will cover “What is TREE data structure?”, "Huffman Algorithm" and get you prepare for the interview

In 1948 Claude Shannon published a landmark paper "A mathematical theory of communication" that signified the beginning of both information theory and coding theory. Given a communication channel which may corrupt information sent over it, Shannon identified a number called the capacity of the channel and proved that arbitrarily reliable communication is possible at any rate below the channel capacity. For example, when transmitting images of planets from deep space, it is impractical to retransmit the images. Hence if portions of the data giving the images are altered, due to noise arising in the transmission, the data may prove useless. Shannon's results guarantee that the data can be encoded before transmission so that the altered data can be decoded to the specified degree of accuracy. Examples of other communication channels include magnetic storage devices, compact discs, and any kind of electronic communication device such as cellular telephones (ISBN2: 0521782805).

Tries Data Structures, Ternary Search Trees, Data Compression, Substring Search and Sorting Algorithms