From the course: Programming Foundations: Discrete Mathematics
Unlock the full course today
Join today to access over 24,800 courses taught by industry experts.
Challenge: Advanced techniques
From the course: Programming Foundations: Discrete Mathematics
Challenge: Advanced techniques
- [Voiceover] Are you ready for the last challenge in this series? In this challenge, I have once again created a worksheet that has a few examples from all the topics in this chapter. They are using a tree with variable length encoding to translate a word to binary and vice versa, calculate the probability of events using set notation, and encrypting and decrypting a message using a Caesar cipher. For this challenge, you will need a pencil and paper to complete the worksheet provided in the exercise file. I have also created a separate solution worksheet, but try to complete the problems first and then, only review your completed answers with the solution once you are done. I estimate this challenge should take approximately 10 minutes. So, go ahead and give it a try. This is our last challenge.
Practice while you learn with exercise files
Download the files the instructor uses to teach the course. Follow along and learn by watching, listening and practicing.