ÑÝËã·¨ÅÅÐòÓ¦ÓÃ˵Ã÷½éÉÜ(ÒÔѹËõžéÀý)
?Download as PPTX, PDF?
0 likes?206 views
This document discusses different sorting algorithms and their applications. It introduces Huffman compression, which is used in multimedia streaming to reduce resources, and Kruskal's and Prim's algorithms, which are used in graphing problems like laying cable networks. Specific applications of these algorithms mentioned include JPEG, PNG, MP3, and ZIP files for Huffman compression, and networking for the graphing algorithms.
ÑÝËã·¨ÅÅÐòÓ¦ÓÃ˵Ã÷½éÉÜ(ÒÔѹËõžéÀý)
- 2. Define A Problem ? How is it used in Multimedia Steaming?
- 3. Introduction ? Huffman compression (Data Compression) ? Kruskal¡¯s and Prim's algorithms (Graphing)
- 4. Examples ? Compression is useful because it helps reduce the consumption of expensive resources, such as disk space or transmission bandwidth ? Graphing would be useful for a cable TV company laying cable to a new neighborhood.
- 5. Other Applications ? Huffman compression ? JPEG, PNG ? MP3 ? ZIP Files ? Kruskal¡¯s and Prim's algorithms ? networking