Udacity sigue mejorando,y a una semana escasa de acabar los cinco cursos que comenzaron hace siete semanas. Ayer anunciaron en su blog que iban a impartir otros cinco cursos a partir del 25 de Junio. A continuación dejo una descripción de cada uno de los cursos.

Software Testing (CS258)


When writing software, destruction can be just as valuable as creation. Learn how to catch bugs and break software as you discover different testing methods that will help you build better software.


  • Unit 1: Introduction

    How to become a great software tester

  • Unit 2: Domains, Ranges, Oracles, and Kinds of Testing

    How to think about the different elements of software testing

  • Unit 3: Code Coverage

    How to find parts of a program that need more testing

  • Unit 4: Random Testing

    How to automatically generate test cases that break code in unexpected ways

  • Unit 5: Advanced Random Testing

    How to engineer a sophisticated random test case generator

  • Unit 6: Consequences

    How to deal with lots of bugs, how to take a big input that triggers a bug and make it smaller, how to report a bug, and more!

  • Unit 7: Conclusion

    Summary and tournament results

Algorithms (CS215)


Ever played the Kevin Bacon game? This class will show you how it works by giving you an introduction to the design and analysis of algorithms that enable you to discover how individuals are connected.


  • Unit 1: A Social Network Magic Trick

    Becoming familiar with algorithm analysis

  • Unit 2: Growth Rates in Social Networks

    Using mathematical tools to analyze how things are connected

  • Unit 3: Basic Graph Algorithms

    Finding the quickest route to Kevin Bacon

  • Unit 4: It’s Who You Know

    Keeping track of your best friends using heaps

  • Unit 5: Strong and Weak Bonds

    Working with social networks with edge weights.

  • Unit 6: Hardness of Network Problems

    Exploring what it means for a social network problem to be harder than other.

  • Unit 7: Conclusion

    Using your knowledge

Intro to Physics (PH100)


Study physics abroad in Europe — virtually! Learn the basics of physics on location in Italy, the Netherlands and the UK, by answering some of the discipline’s major questions from over the last 2000 years.


  • Unit 1: How can we measure the circumference

    of the Earth?

    Basics of geometry and trigonometry

  • Unit 2: How do objects move?

    Data analysis and kinematics

  • Unit 3: What causes motion?

    Forces, acceleration, and Newton’s Laws

  • Unit 4: How can we use motion?

    Work, energy, and simple machines

  • Unit 5: How can we determine our longitude at sea?

    Simple harmonic motion

  • Unit 6: What is electricity?

    Charge and electric fields

  • Unit 7: What is left to discover?

    Modern physics and open questions

Introduction to Statistics (ST101)


Statistics is about extracting meaning from data. In this class, we will introduce techniques for visualizing relationships in data and systematic techniques for understanding the relationships using mathematics.


  • Unit 1: Visualizing relationships in data

    Seeing relationships in data and predicting based on them; dealing with noise

  • Unit 2: Processes that generates data

    Random processes; counting, computing with sample spaces; conditional probability; Bayes Rule

  • Unit 3: Processes with a large number of events

    Normal distributions; the central limit theorem; adding random variables

  • Unit 4: Real data and distributions

    Sampling distributions; confidence intervals; hypothesis tests; outliers

  • Unit 5: Systematically understanding relationships

    Least squares;residuals; inference

  • Unit 6: Understanding more complex relationships

    Transformation; smoothing; regression for two or more variables, categorical variables

  • Unit 7: Where to go next

    Statistics vs machine learning; what to study next; where statistics is used Final exam

Logic & Discrete Mathematics (CS221)


“Discrete mathematics, ” also known as “combinatorics, ” is a broad term. In this course, learn the basics of Boolean algebra and discrete mathematics with an emphasis on their connections with computer science.


  • Unit 1: Induction

    Techniques in enumerative combinatorics, including the counting of lattice paths, Pascal-like triangles, and the principle of inclusion-exclusion (Moebius inversion)

  • Unit 2: Sets

    Basic combinatorics of finite sets, including Hall’s Marriage Theorem, Sperner’s Lemma, elements of matroid theory and results about cutsets in graphs

  • Unit 3: Propositional Logic

    Elementary propositional logic

  • Unit 4: Posets and Lattices

    The basics of posets and lattices as a unifying theme

  • Unit 5: Graph Theory

    Elements of graph theory, including results about trees and planar graphs

  • Unit 6: Number Theory

    Some elementary number theory leading up to the Euclidean algorithm for computing greatest common divisors and modular arithmetic

  • Unit 7: Review

    An overview of the course material