Lectures in course CS-119(d): Information, Computation, Communication

Explores entropy, compression algorithms, and optimal coding methods for data compression.

Covers the basics of algorithms in computer science, including their formalization and complexity.

Introduces Computer Science, its role in society, technological advancements, and challenges in information storage.

Explores Shannon-Fano coding for efficient data compression and its comparison to Huffman coding.

Covers finding the maximum value in a list and related problems.

Covers scientific computing, process automation, and data management in computer science applications across different sectors.

Explores informatics as the fourth pillar of culture, its evolution, integration into society, and applications in modern physics and mathematics.

Demonstrates the calculation of entropy for a specific example, resulting in an entropy value of 2.69.

Explores the PageRank algorithm used by Google to rank web pages.

Explores the definition and origins of algorithms, including examples and types.

Explains binary codes, prefix-free codes, and representing letters with codes.

Explores the role of Computing in society and the basics of computing, algorithms, communication systems, and computer security.

Explores lossless data compression, entropy, and data loss thresholds.

Covers the basic elements of algorithms, including data handling, instructions, and control structures.

Covers the demonstration of Shannon's theorem, focusing on data compression.

Covers control structures, quadratic equation algorithm design, and correctness verification.

Explores Shannon's theorem on data compression and the performance of Shannon Fano codes.

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Explores the performance of Shannon-Fano algorithm and introduces Huffman codes for efficient data compression.