Needless to say, CS majors need to speak “discrete” in today’s modern world.
Likewise, cryptography is based on number theory, which is essential to keeping our passwords safe in the digital world. Just think about how many algorithms are running within self-driving cars trying to determine the moving landscape at 55 mph. And set theory deals with object classification. To put it simply, it’s because computers work in binary (i.e., digital 0s and 1s), unlike the natural world, which revolves around continuous functions (i.e., analog), and discrete math helps us to bridge the gap.įor starters, sorting algorithms (a considerable part of computer science) utilize graph theory to design and solve their traveling salesman-type problems. Why do computer science majors need to learn discrete math? Discrete math focuses on concepts, theorems, and proofs therefore, it’s important to read the textbook, practice example problems, and stay ahead of your assignments. This course is different for most students as it doesn’t build upon prior classes.
Read your textbook, complete examples and practice exercises, and have a willingness to learn. What’s the best way to learn discrete mathematics? The following sections provide links to the complete lessons on all course topics. This course covers everything you need to tackle those questions that keep you up at night. If you need help in discrete math, you’re in the right place.
0 kommentar(er)
