Entropy, mutual information, and Shannon's coding theorems; lossless source coding, Huffman, Shannon-Fano-Elias, and arithmetic codes; Channel capacity; rate-distortion theory, and lossy source coding; source-channel coding; algorithmic complexity and information; applications of information theory in various fields.
4
UnitsLetter
Grading1, 2, 3
PasstimeNone
Level LimitEngineering
CollegeIgnore any rating before 2021. Professor Feng is an amazing lecturer and easy to follow along. He constantly underscores why the content of the class is useful for industry. Some concepts are initially confusing, but he broke it down very simply in office hours. He's very patient and eager to answer any questions. Amazing professor.
Very kind professor who is very passionate about what he is teaching (blockchain). His lecture slides are amazing and sometimes the material is difficult to understand but he will always be patient with your questions. He also is very humble and research things he is unsure of and will always try to give you the correct answer.
Final exam was very difficult. Lectures were good and the homework assignments were high quality. He has an adjusted grading scale where passing is easy but getting an A is hard.
The lecture is clear and easy to understand, however, the final is getting very hard, much harder than last year. (In case everyone gets an A)
Yu Feng was a very reasonable, engaging professor and his lectures were super clear, so I was never confused even when it got a bit abstract. He went through the entirety of last quarter's final so that we feel prepared. CS162 is much, much easier than CS160. No complaints from me.
grade was determined by 5 homework assignments, with the professor and TA's seemingly making it up as the quarter went on. lectures had little relation in content or difficulty to the hw, generally covered material significantly simpler than the knowledge required for the homework. assignment instructions were often vague or hard to follow.
Frederic Gibou
4.0