Online courses directory (684)

Sort by: Name, Rating, Price
Start time: Any, Upcoming, Recent started, New, Always Open
Price: Any, Free, Paid
Starts : 2010-09-01
14 votes
MIT OpenCourseWare (OCW) Free Closed [?] Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This course relies on primary readings from the database community to introduce graduate students to the foundations of database systems, focusing on basics such as the relational algebra and data model, schema normalization, query optimization, and transactions. It is designed for students who have taken 6.033 (or equivalent); no prior database experience is assumed, though students who have taken an undergraduate course in databases are encouraged to attend.

Starts : 2009-09-01
9 votes
MIT OpenCourseWare (OCW) Free Business Infor Information environments Information Theory Journalism Nutrition

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

Starts : 2000-09-01
7 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Infor Information environments Information Theory Janux Nutrition

This is a foundation subject in modern software development techniques for engineering and information technology. The design and development of component-based software (using C# and .NET) is covered; data structures and algorithms for modeling, analysis, and visualization; basic problem-solving techniques; web services; and the management and maintenance of software. Includes a treatment of topics such as sorting and searching algorithms; and numerical simulation techniques. Foundation for in-depth exploration of image processing, computational geometry, finite element methods, network methods and e-business applications. This course is a core requirement for the Information Technology M. Eng. program.

This class was also offered in Course 13 (Department of Ocean Engineering) as 13.470J. In 2005, ocean engineering subjects became part of Course 2 (Department of Mechanical Engineering), and the 13.470J designation was dropped in lieu of 2.159J.

Starts : 2015-02-01
17 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information control Information Theory Nutrition

This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.

100 votes
Udacity Free Closed [?] Computer Sciences CMS Nutrition Website Development

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, enabling you to discover how individuals are connected.

Starts : 2015-09-04
308 votes
Coursera Free Popular Closed [?] Computer Sciences English BabsonX Beginner Evaluation Evaluation Nutrition Website Development

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers basic iterable data types, sorting, and searching algorithms.

Starts : 2016-03-16
306 votes
Coursera Free Popular Closed [?] Computer Sciences English BabsonX Beginner Evaluation Evaluation Nutrition Website Development

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations.

Starts : 2015-10-05
297 votes
Coursera Free Popular Closed [?] Computer Sciences English BabsonX Beginner Evaluation Nutrition

In this course you will learn several fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures (heaps, hash tables, search trees), randomized algorithms, and more.

Starts : 2015-03-16
105 votes
Coursera Free Closed [?] Computer Sciences English BabsonX Beginner Evaluation Nutrition

In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more.

Starts : 2013-02-08
99 votes
Coursera Free Closed [?] Computer Sciences BabsonX Customer Service Certification Program Endocrine+glands

This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. Part I covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.

109 votes
Khan Academy Free Closed [?] Computer Sciences 1500-1600+End+of+the+Renaissance+and+the+Reformation Class2Go Common Core EdX.htm%25252525253Fcategoryid%25252525253D7.htm%252525253Fdatetype%252525253Dupcoming%2525252526.ht Statistics

Why do Primes make some problems fundamentally hard? Build algorithms to find out!. Primality Test. Running Time. Computer Memory (space). Algorithmic Efficiency. Sieve of Eratosthenes. Primality Test with Sieve. The Prime Number Theorem. Time Space Tradeoff. Conditional Probability Visualized.

333 votes
Khan Academy Free Popular Closed [?] Computer Sciences -1 Class2Go Common Core Communication WizIQ.htm%25252525253Fcategoryid%25252525253D20.htm%252525253Fcategoryid%252525253D7.htm%25253Fcateg

Explore how we have hidden secret messages through history. What is Cryptography?. Probability Space. The Caesar Cipher. Polyalphabetic Cipher. The One-Time Pad. Frequency Stability. The Enigma Encryption Machine (case study). Perfect Secrecy. Pseudorandom Number Generators.

Starts : 2014-09-12
324 votes
Coursera Free Popular Closed [?] Business English BabsonX Basic Genetics Biology Evaluation Nutrition

Find out how modern electronic markets work, why stock prices change in the ways they do, and how computation can help our understanding of them.  Build algorithms and visualizations to inform investing practice.

102 votes
Khan Academy Free Closed [?] Computer Sciences Class2Go Vision for the classroom

Introduction to programming and computer science. Introduction to Programs Data Types and Variables. Binary Numbers. Python Lists. For Loops in Python. While Loops in Python. Fun with Strings. Writing a Simple Factorial Program. (Python 2). Stepping Through the Factorial Program. Flowchart for the Factorial Program. Python 3 Not Backwards Compatible with Python 2. Defining a Factorial Function. Diagramming What Happens with a Function Call. Recursive Factorial Function. Comparing Iterative and Recursive Factorial Functions. Exercise - Write a Fibonacci Function. Iterative Fibonacci Function Example. Stepping Through Iterative Fibonacci Function. Recursive Fibonacci Example. Stepping Through Recursive Fibonacci Function. Exercise - Write a Sorting Function. Insertion Sort Algorithm. Insertion Sort in Python. Stepping Through Insertion Sort Function. Simpler Insertion Sort Function. Introduction to Programs Data Types and Variables. Binary Numbers. Python Lists. For Loops in Python. While Loops in Python. Fun with Strings. Writing a Simple Factorial Program. (Python 2). Stepping Through the Factorial Program. Flowchart for the Factorial Program. Python 3 Not Backwards Compatible with Python 2. Defining a Factorial Function. Diagramming What Happens with a Function Call. Recursive Factorial Function. Comparing Iterative and Recursive Factorial Functions. Exercise - Write a Fibonacci Function. Iterative Fibonacci Function Example. Stepping Through Iterative Fibonacci Function. Recursive Fibonacci Example. Stepping Through Recursive Fibonacci Function. Exercise - Write a Sorting Function. Insertion Sort Algorithm. Insertion Sort in Python. Stepping Through Insertion Sort Function. Simpler Insertion Sort Function.

Starts : 2013-01-01
94 votes
Coursera Free Closed [?] Computer Sciences BabsonX Basic Genetics Evaluation

This course delivers a systematic overview of computer vision, emphasizing two key issues in modeling vision: space and meaning. We will study the fundamental theories and important algorithms of computer vision together, starting from the analysis of 2D images, and culminating in the holistic understanding of a 3D scene.

Starts : 2012-04-23
98 votes
Coursera Free Closed [?] Computer Sciences BabsonX Basic Genetics Evaluation

In this course, we will study the concepts and algorithms behind some of the remarkable successes of computer vision - capabilities such as face detection, handwritten digit recognition, reconstructing three-dimensional models of cities and more.

Starts : 2016-01-04
116 votes
Coursera Free Closed [?] Computer Sciences English BabsonX Basic Genetics Customer Service Certification Program Evaluation How to Succeed Nutrition

In this class you will look behind the scenes of image and video processing, from the basic and classical tools to the most modern and advanced algorithms.

115 votes
Udacity Free Closed [?] Computer Sciences CMS Nutrition Website Development

This class teaches you about basic concepts in theoretical computer science -- such as NP-completeness -- and what they imply for solving tough algorithmic problems.

106 votes
Coursera Free Closed [?] Computer Sciences English BabsonX Basic Genetics Evaluation Nutrition Web Design

Why write programs when the computer can instead learn them from data? In this class you will learn how to make this happen, from the simplest machine learning algorithms to quite sophisticated ones. Enjoy!

Starts : 2012-03-12
95 votes
Coursera Free Closed [?] Computer Sciences English BabsonX Basic Genetics Evaluation Nutrition

In this class, you will learn fundamental algorithms and mathematical models for processing natural language, and how these can be used to solve practical problems.