# Online courses directory (14)

Computer Sciences   Choose category
 -- all categories -- Agriculture Business Computer Sciences Education Engineering English & Literature Ethnic Studies Foreign Languages General & Interdisciplinary Studies Health and Welfare Life Sciences Mathematics Military Science & Protective Services Philosophy, Religion, & Theology Physical Sciences Public Affairs & Law Social Sciences Visual & Performing Arts [close]
Sort by: Name, Rating, Price
Start time: Any, Upcoming, Recent started, New, Always Open
Price: Any, Free, Paid

### Applied math: Ancient Cryptography

Khan Academy Free Popular Closed [?] Computer Sciences Advanced Cryptography Ancient Cryptography Applied Math Cryptography

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.

### Applied math: Journey into Cryptography

Khan Academy Free Closed [?] Computer Sciences Advanced Cryptography Applied Math Cryptography Journey into Cryptography

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?.

### Applied math: Journey into Information Theory

Khan Academy Free Closed [?] Computer Sciences Applied Math Information Theory Journey into Information Theory

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?.

### Artificial Intelligence (AI)

Starts : 2017-05-01
edX Free Closed [?] Computer Sciences English ColumbiaX Computer Science EdX

What do self-driving cars, face recognition, web search, industrial robots, missile guidance, and tumor detection have in common?

They are all complex real world problems being solved with applications of intelligence (AI).

This course will provide a broad understanding of the basic techniques for building intelligent computer systems and an understanding of how AI is applied to problems.

You will learn about the history of AI, intelligent agents, state-space problem representations, uninformed and heuristic search, game playing, logical agents, and constraint satisfaction problems.

Hands on experience will be gained by building a basic search agent. Adversarial search will be explored through the creation of a game and an introduction to machine learning includes work on linear regression.

### CS101: Introduction to Computer Science I

Saylor.org Free Closed [?] Computer Sciences Computer Computer Science Programming language Software Engineering

This course will introduce you to the field of computer science and the fundamentals of computer programming. Introduction to Computer Science I is specifically designed for students with no prior programming experience, and taking this course does not require a background in Computer Science. This course will touch upon a variety of fundamental topics within the field of Computer Science and will use Java, a high-level, portable, and well-constructed computer programming language developed by Sun Microsystems (now Oracle), to demonstrate those principles. We will begin with an overview of the course topics as well as a brief history of software development. We will cover basic object-oriented programming terminology and concepts such as objects, classes, inheritance, and polymorphism, as well as the fundamentals of Java, its primitive data types, relational operators, control statements, exception handling, and file input /output. By the end of the course, you should have a strong understanding of the fundam…

### CS401: Operating Systems

Saylor.org Free Closed [?] Computer Sciences Computer Science

This course will introduce you to modern operating systems.  We will focus on UNIX-based operating systems, though we will also learn about alternative operating systems, including Windows.  The course will begin with an overview of the structure of modern operating systems.  Over the course of the subsequent units, we will discuss the history of modern computers, analyze in detail each of the major components of an operating system (from processes to threads), and explore more advanced topics in the field, including memory management and file input/output.  The class will conclude with a discussion of various system-related security issues.

### CS403: Introduction to Modern Database Systems

Saylor.org Free Closed [?] Computer Sciences Beginner Computer Science Databases Software Engineering Systems & Security

Though we may not recognize them in our everyday activities, databases are everywhere.  They are hidden behind your online banking profile, airline reservation systems, medical records, and even employment records.  This course will provide students with a general overview of databases, introducing you to database history, modern database systems, the different models used to design a database, and Structured Query Language (SQL), which is the standard language used to access and manipulate databases.   Many of the principles of database systems carry to other areas in computer science, especially operating systems.  Databases are often thought of as one of the core computer science topics, since many other areas in the discipline have been derived from this area.

### Fundamentals of Computational Media Design

Starts : 2008-09-01
MIT OpenCourseWare (OCW) Free Computer Sciences Media Arts and Sciences MIT OpenCourseWare Undergraduate

This class covers the history of 20th century art and design from the perspective of the technologist. Methods for visual analysis, oral critique, and digital expression are introduced. Class projects this term use the OLPC XO (One Laptop Per Child) laptop, Csound and Python software.

### Internet History, Technology, and Security

Starts : 2015-10-05
Coursera Free Closed [?] Computer Sciences English Computer Science Information Systems & Security Tech & Design

What is the Internet? How was it created? How does it work? How do we secure communications on the Internet?

### Intro to Artificial Intelligence

Udacity Free Closed [?] Computer Sciences Software Engineering

Artificial Intelligence (AI) is a field that has a long history but is still constantly and actively growing and changing. In this course, you’ll learn the basics of modern AI as well as some of the representative applications of AI. Along the way, we also hope to excite you about the numerous applications and huge possibilities in the field of AI, which continues to expand human capability beyond our imagination. ***Note: Parts of this course are featured in the Machine Learning Engineer Nanodegree and the Data Analyst Nanodegree programs. If you are interested in AI, be sure to check out those programs as well!***

### Inventions and Patents

Starts : 2005-09-01
MIT OpenCourseWare (OCW) Free Computer Sciences Electrical Engineering and Computer Science MIT OpenCourseWare Undergraduate

This course explores the history of private and public rights in scientific discoveries and applied engineering, leading to the development of worldwide patent systems. The classes of invention protectable under the patent laws of the U.S., including the procedures in protecting inventions in the Patent Office and the courts will be examined. A review of past cases involving inventions and patents in:

1. the chemical process industry and medical pharmaceutical, biological, and genetic-engineering fields;
2. devices in the mechanical, ocean exploration, civil, and/or aeronautical fields;
3. the electrical, computer, software, and electronic areas, including key radio, solid-state, computer and software inventions; and also
4. software protection afforded under copyright laws.

Periodic joint real-time class sessions and discussions by video-audio Internet conferencing, with other universities will also be conducted.

### Logic II

Starts : 2004-02-01
MIT OpenCourseWare (OCW) Free Computer Sciences Linguistics and Philosophy MIT OpenCourseWare Undergraduate

This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can recognize as true even though they don't follow from the system of axioms. In my opinion, which is widely shared, this is the most important single result in the entire history of logic, important not only on its own right but for the many applications of the technique by which it's proved. We'll discuss some of these applications, among them: Church's theorem that there is no algorithm for deciding when a formula is valid in the predicate calculus; Tarski's theorem that the set of true sentence of a language isn't definable within that language; and Gödel's second incompleteness theorem, which says that no consistent system of axioms can prove its own consistency.