Engineering and Technology
Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.
The course Computability, Complexity & Algorithms on Udacity covers a range of topics essential to understanding the foundations of computer science. Starting with an exploration of computability, students will learn about languages and countability, as well as the concept of Turing Machines and the Church-Turing Thesis. Moving on to complexity, the course delves into the P and NP problems, including NP-Complete Problems and the intriguing concept of the Golden Ticket. Finally, students will gain a solid understanding of algorithms, including dynamic programming, the Fast Fourier Transform, and Maximum Flow. By the end of this course, students will have a comprehensive understanding of these fundamental concepts and their applications in computer science.
by Udacity
Learn tools and techniques that will help you recognize when problems you encounter are intractable...
by Udacity
Learn how to model problems, and how to optimize performance by using some of the advanced features...
by Udacity
Master critical cloud computing skills used to deploy, build, migrate, and monitor applications on A...