Online courses directory (684)

Sort by: Name, Rating, Price
Start time: Any, Upcoming, Recent started, New, Always Open
Price: Any, Free, Paid
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.

14 votes
ALISON Free Computer Sciences

ALISON ABC IT is a free online self-certifiable information technology (IT) course which comprehensively introduces you to IT literacy. ABC IT covers the basic concepts of computing and teaches how computing can be an everyday feature of life and work. It covers basic Microsoft Office computer applications and touch typing training.<br />

17 votes
Udemy $197 Closed [?] Computer Sciences Android+programming Counter+terrorism+course First+order+differential+equations Histology Java+videos

Bootcamp for NGO Reps, Global Citizens & Interns Leading Change At The UN & Intergovernmental Meetings

Starts : 2014-09-15
328 votes
Coursera Free Popular Computer Sciences English BabsonX Evaluation Nutrition Website Development

This course is designed to be a fun introduction to the basics of programming in Python. Our main focus will be on building simple interactive games such as Pong, Blackjack and Asteroids.

Starts : 2006-09-01
15 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Infor Information environments Information Theory International development Nutrition

This course is a comprehensive introduction to control system synthesis in which the digital computer plays a major role, reinforced with hands-on laboratory experience. The course covers elements of real-time computer architecture; input-output interfaces and data converters; analysis and synthesis of sampled-data control systems using classical and modern (state-space) methods; analysis of trade-offs in control algorithms for computation speed and quantization effects. Laboratory projects emphasize practical digital servo interfacing and implementation problems with timing, noise, and nonlinear devices.

Starts : 2003-09-01
12 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

6.374 examines the device and circuit level optimization of digital building blocks. Topics covered include: MOS device models including Deep Sub-Micron effects; circuit design styles for logic, arithmetic and sequential blocks; estimation and minimization of energy consumption; interconnect models and parasitics; device sizing and logical effort; timing issues (clock skew and jitter) and active clock distribution techniques; memory architectures, circuits (sense amplifiers) and devices; testing of integrated circuits. The course employs extensive use of circuit layout and SPICE in design projects and software labs.

Starts : 2013-10-21
No votes
Coursera Free Closed [?] Computer Sciences English BabsonX Customer Service Certification Program Nutrition

In this course we’ll explore complex analysis, complex dynamics, and some applications of these topics.

Starts : 2016-03-04
No votes
Coursera Free Closed [?] Computer Sciences English BabsonX Beginner Customer Service Certification Program Evaluation Nutrition

This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course 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.

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.

Starts : 2014-10-05
No votes
Coursera Free Computer Sciences English BabsonX Nutrition

This Capstone MOOC gives Signature Track students who passed all previous MOOCs in the MoCCA Specialization “with Distinction” an opportunity to integrate and demonstrate the knowledge they've acquired across the three earlier content area MOOCs.

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

Cryptography is present in everyday life, from paying with a credit card to using the telephone. Learn all about making and breaking puzzles in computing.

No votes
CourseSites Free Computer Sciences Accounting+capital

As the world's data grow exponentially, organizations across all sectors, including government and not-for-profit, need to understand, manage and use big, complex data sets—known as big data...

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.

No votes
Khan Academy Free Closed [?] Mathematics Business+Ethics Class2Go Common Core Communication WizIQ.htm%25252525253Fcategoryid%25252525253D20.htm%252525253Fcategoryid%252525253D7.htm%25253Fcateg

Solve problems using Mathematics, Computer Science and more!. Introduction. The Discovery. Clue #1. Clue #2. Clue #3. Crypto Checkpoint 1. Clue #4. Checkpoint. Crypto Checkpoint 2. Crypto Checkpoint 3. What's Next?. Introduction. The Discovery. Clue #1. Clue #2. Clue #3. Crypto Checkpoint 1. Clue #4. Checkpoint. Crypto Checkpoint 2. Crypto Checkpoint 3. What's Next?.

28 votes
Khan Academy Free Closed [?] Computer Sciences Class2Go Common Core Communication Urban Studies and Planning WizIQ.htm%25252525253Fcategoryid%25252525253D20.htm%252525253Fcategoryid%252525253D7.htm%25253Fcateg

How have humans protected their secret messages through history? What has changed today?. What is Cryptography?. Probability Space. The Caesar Cipher. Caesar Cipher Exploration. Frequency Fingerprint Exploration . Polyalphabetic Cipher. Polyalphabetic Exploration. The One-Time Pad. Perfect Secrecy Exploration. Frequency Stability. Coin flip sequences. Frequency Stability Exploration. The Enigma Encryption Machine (case study). Perfect Secrecy. Pseudorandom Number Generators. Random Walk Exploration. Ciphers vs. Codes. Shift Cipher. Caesar cipher encryption. Caesar Cipher Decryption. Caesar cipher frequency analysis. Vigenere cipher encryption. XOR Bitwise Operation. XOR & the One-Time Pad. XOR Exploration. Bitwise Operators. What's Next?. The Fundamental Theorem of Arithmetic. Public Key Cryptography: what is it?. The Discrete Logarithm Problem. Diffie-Hellman Key Exchange. RSA Encryption: step 1. RSA Encryption: step 2. RSA Encryption: step 3. Time Complexity (Exploration). Euler's Totient Function. Euler Totient Exploration. RSA Encryption: step 4. What should we learn next?. What is Modular Arithmetic?. Modulo Operator. Congruence Modulo. Congruence Relation. Equivalence Relations. The Quotient Remainder Theorem. Modular Addition & Subtraction. Modular Addition. Modular Multiplication. Modular Multiplication. Modular Exponentiation. Fast Modular Exponentiation. Fast Modular Exponentiation. Modular Inverses. Introduction. Primality Test Challenge. Trial Division. Level 1: Primality Test. Running Time. Level 2: measuring running time. Computer Memory (space). Binary Memory Exploration. Algorithmic Efficiency. Level 3: Challenge. Sieve of Eratosthenes. Level 4: Sieve of Eratosthenes. Primality Test with Sieve. Level 5: Trial division using sieve. The Prime Number Theorem. Prime density spiral. Prime Gaps. Time Space Tradeoff. Summary (what's next?). Randomized Algorithms (intro). Conditional Probability (Bayes Theorem) Visualized. Guess the coin. Random Primality Test (warm up). Level 9: Trial Divison vs Random Division. Fermat's Little Theorem. Fermat Primality Test. Level 10: Fermat Primality Test. What's Next?. What is Cryptography?. Probability Space. The Caesar Cipher. Caesar Cipher Exploration. Frequency Fingerprint Exploration . Polyalphabetic Cipher. Polyalphabetic Exploration. The One-Time Pad. Perfect Secrecy Exploration. Frequency Stability. Coin flip sequences. Frequency Stability Exploration. The Enigma Encryption Machine (case study). Perfect Secrecy. Pseudorandom Number Generators. Random Walk Exploration. Ciphers vs. Codes. Shift Cipher. Caesar cipher encryption. Caesar Cipher Decryption. Caesar cipher frequency analysis. Vigenere cipher encryption. XOR Bitwise Operation. XOR & the One-Time Pad. XOR Exploration. Bitwise Operators. What's Next?. The Fundamental Theorem of Arithmetic. Public Key Cryptography: what is it?. The Discrete Logarithm Problem. Diffie-Hellman Key Exchange. RSA Encryption: step 1. RSA Encryption: step 2. RSA Encryption: step 3. Time Complexity (Exploration). Euler's Totient Function. Euler Totient Exploration. RSA Encryption: step 4. What should we learn next?. What is Modular Arithmetic?. Modulo Operator. Congruence Modulo. Congruence Relation. Equivalence Relations. The Quotient Remainder Theorem. Modular Addition & Subtraction. Modular Addition. Modular Multiplication. Modular Multiplication. Modular Exponentiation. Fast Modular Exponentiation. Fast Modular Exponentiation. Modular Inverses. Introduction. Primality Test Challenge. Trial Division. Level 1: Primality Test. Running Time. Level 2: measuring running time. Computer Memory (space). Binary Memory Exploration. Algorithmic Efficiency. Level 3: Challenge. Sieve of Eratosthenes. Level 4: Sieve of Eratosthenes. Primality Test with Sieve. Level 5: Trial division using sieve. The Prime Number Theorem. Prime density spiral. Prime Gaps. Time Space Tradeoff. Summary (what's next?). Randomized Algorithms (intro). Conditional Probability (Bayes Theorem) Visualized. Guess the coin. Random Primality Test (warm up). Level 9: Trial Divison vs Random Division. Fermat's Little Theorem. Fermat Primality Test. Level 10: Fermat Primality Test. What's Next?.

40 votes
Khan Academy Free Closed [?] Computer Sciences Class2Go Common Core Community engagement Sap faculty

We've always been communicating.... as we moved from signal fires, to alphabets & electricity the problems remained the same. What is Information Theory?. Prehistory: Proto-writing. Ptolemaic: Rosetta Stone. Ancient History: The Alphabet. Source Encoding. Visual Telegraphs (case study). Decision Tree Exploration. Electrostatic Telegraphs (case study). The Battery & Electromagnetism. Morse Code & The Information Age. Morse code Exploration. What's Next?. Symbol Rate. Symbol Rate Exploration. Introduction to Channel Capacity. Message Space Exploration. Measuring Information. Galton Board Exploration. Origin of Markov Chains. Markov Chain Exploration. A Mathematical Theory of Communication. Markov Text Exploration. What's Next?. What is Information Theory?. Prehistory: Proto-writing. Ptolemaic: Rosetta Stone. Ancient History: The Alphabet. Source Encoding. Visual Telegraphs (case study). Decision Tree Exploration. Electrostatic Telegraphs (case study). The Battery & Electromagnetism. Morse Code & The Information Age. Morse code Exploration. What's Next?. Symbol Rate. Symbol Rate Exploration. Introduction to Channel Capacity. Message Space Exploration. Measuring Information. Galton Board Exploration. Origin of Markov Chains. Markov Chain Exploration. A Mathematical Theory of Communication. Markov Text Exploration. What's Next?.

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

20th century solutions to new problems in Cryptography. The Fundamental Theorem of Arithmetic. Public Key Cryptography: what is it?. The Discrete Logarithm Problem. Diffie-Hellman Key Exchange. RSA Encryption: step 1. RSA Encryption: step 2. RSA Encryption: step 3. Euler's Totient Function. RSA Encryption: step 4. What should we learn next?.

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.

Trusted paper writing service WriteMyPaper.Today will write the papers of any difficulty.