Online courses directory (548)

Introduction to Computer Science for a zero-prior-experience audience. Play with little phrases of code to understand what computers are all about.

This course discusses ideas in the implementation of compilers. Learn how a program for humans is translated into a program more suited to machines!

LaTeX (читается «латех») — научная издательская система. На этом курсе вы узнаете, как оформить ваши идеи в виде красивого, профессионально сверстанного текста или слайдов презентации. LaTeX ('lay-tech') is a desktop publishing system for academic publications. Learn how to put your research into professionally looking form of a printed text or presentation slides.

Whether you are 13 or 113, this Google Ninja course is for you. Most people THINK they know how to use many of Google's free tools, but they actually only use a small portion of what's possible. This course will help you become a near-expert at using the main Google programs, including email and calendaring, video conferencing and chat, spreadsheets, word processing, slide presentations, drawing, survey forms, drive storage, photo editing, blogging, and much more!

This course provides an overview of the evolving field of cybersecurity, with an introduction to cybersecurity standards and law. Students will learn about common cyber attacks and the techniques for identifying, detecting, and defending against cybersecurity threats. They will also gain a basic understanding of personal, physical, network, web, and wireless security, as well as a foundation for more advanced study of cybersecurity.

A graduate level course on convex optimization, with applications in signal processing, machine learning, control, finance, and other areas.

Learn how to transform information from a format efficient for computation into a format efficient for human perception, cognition, and communication. Explore elements of computer graphics, human-computer interaction, perceptual psychology, and design in addition to data processing and computation.

Cryptography is essentially the science of writing in secret code.  In data and telecommunications, cryptography has specific security requirements, such as authentication, privacy or confidentiality, integrity, and non-repudiation.  To meet these security requirements, we employ secret key (or symmetric) cryptography, public-key (or asymmetric) cryptography, and hash functions. In the first part of the course, we will review a number of different ciphers that were used before World War II.  These ciphers would be easily broken nowadays, since cryptography has advanced quickly over the past couple of decades with the advent of modern computers.  We will cover block cipher algorithms and describe the advanced encryption standard for a symmetric-key encryption adopted by the U.S. government.  We will also learn about the important MD5 and SHA-1 hash functions as well as the message authentication code. This course will focus on public key cryptography, which is best exemplified by the RSA algorithm (na…

This course is designed for the novice who has little or no word processing experience.  The course provides an introduction to word processing.  You will explore word processing skills while also learning to create a basic business letter and a business memo.  Although the resources in this course use Microsoft Word 2010, it should be noted that all of the basic skills and tasks that you will be asked  can be done on any word processing program.  If you stay flexible enough in your own word processing program to search out the commands and icons on whatever software you are using, you will succeed.  The most current version of Microsoft Word was selected, because it would be most beneficial to the job seeker.  In addition most colleges, universities, and some public libraries are using a newer version of Word.  You can complete this course using any word processing software, but if you are using an older version of Word, you may also want to seek out a resource where you can interact with the newer v…

This course will provide you with a comprehensive introduction to spreadsheets. The course is designed for first-time users with very little or no exposure to the subject. For this course, you will use Microsoft Excel as the software. The course will explore the following fundamental topics: an introduction to spreadsheets, terminology in Excel, components of a spreadsheet, what a cell consists of, and the creation of a spreadsheet for practical use.  You will examine sample files, videos, and books that will enable you to gain practical knowledge about spreadsheets that can be used in daily life, either at work, school, or home.

This class is intended for students who have a basic understanding of spreadsheets and are now ready to delve deeper into formatting, formulas and functions, multi-page spreadsheets, charting data, creating tables that have database features, and be introduced to pivot tables. This class was designed to be an active, hands-on class. You will be creating Excel® spreadsheets and have files to open and follow along as you progress through the units. This class is not intended for a specific occupation or activity, but when you are finished with this class, you will be able to use Excel® in a variety of circumstances to format and manipulate numerical data. Although the resources in this course use Microsoft Excel® 2010, it should be noted that all of the skills and tasks that you will be asked to complete can be done in any version of Excel®. If you stay flexible enough in your thinking and search out the commands and icons on whatever software you are using, you will succeed.

Exploring geographic information systems (GIS) is a self-paced course where participants will learn about GIS and how the technology is being used in the real world to support problem-solving and decision-making. Participants will create and manage spatial databases, produce well-designed maps, and undertake spatial data analysis using free online software tools. These activities require proficiency in fundamental computer and Internet skills. Participants will have the opportunity to obtain digital badges throughout the course. This course is offered through Canvas Network as a non-credit course created by Simon Fraser University. Students enrolled in only this course are not considered students of Simon Fraser University.

This course is designed as an introduction to computer programming using Java. Students will learn how to a) analyze a problem, and identify and define the computing requirements appropriate to its solution b) design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs, and c) apply design and development principles in the construction of software systems of varying complexity. Topics include Computers, programs, Java, input and output, identifiers, variables, assignment statements, constants, memory diagrams, primitive data types, conditional statements, repetition, methods, parameters, arguments, return values, one dimensional arrays, objects, classes, and classes from the Java Application Programmers Interface (API).

This course presents material in discrete mathematics and computation theory with a strong emphasis on practical algorithms and experiential learning. Discrete mathematics, also called finite mathematics or decision mathematics, is the study of mathematical structures that are fundamentally discrete in the sense of not supporting or requiring the notion of continuity. Objects studied in finite mathematics are largely countable sets such as integers, finite graphs, and formal languages. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages. The CDM course is currently under development and we are making the course available while it is under development. Only one of the planned fifteen modules is currently available. The module on Groups that is currently available would appear mid-way through the complete course.

This course provides an introduction to Python and elementary principles of computing, including iteration, recursion, and binary representation of data. Additional topics on cellular automata, encryption, and the limits of computation are also introduced. The goal of this course is to introduce some of the techniques used in computer science to solve complex problems, with or without a computer. The Python modules are used to introduce and illustrate conditionals and iteration; additional topics are provided without using a specific programming language and can be incorporated into classes that do not use Python.

The Diploma in Information Technology Management is a free online course that explains why managers must understand how Information Technology plays a fundamental role in both the structure and control of the modern business. A successful manager must have an excellent grasp of the functionality, capabilities and effects of the technology that he or she must implement and manage. This free online course presents an array of the core concepts of Information Technology management. The course will review such key areas as corporate frameworks, software, databases, information systems, communications and management of personnel in relation to technology and from the point of view of the business manager. This course is ideal for management professionals who wish to gain an in depth understanding of the management of Information Technology in the modern corporation. The course is also ideal for those who would like to learn about the central role of Information Technology in today’s workplace.<br />

Algorithms power the biggest web companies and the most promising startups. Interviews at tech companies start with questions that probe for good algorithm thinking.

In this computer science course, you will learn how to think about algorithms and create them using sorting techniques such as quick sort and merge sort, and searching algorithms, median finding, and order statistics.

The course progresses with Numerical, String, and Geometric algorithms like Polynomial Multiplication, Matrix Operations, GCD, Pattern Matching, Subsequences, Sweep, and Convex Hull. It concludes with graph algorithms like shortest path and spanning tree.

Topics covered:

• Sorting and Searching
• Numerical Algorithms
• String Algorithms
• Geometric Algorithms
• Graph Algorithms

This course is part of the Fundamentals of Computer Science XSeries Program: 

• Programming Basics
• Object-Oriented Programming
• Foundations of Data Structures
• Implementation of Data Structures

6.00.2x will teach you how to use computation to accomplish a variety of goals and provides you with a brief introduction to a variety of topics in computational problem solving . This course is aimed at students with some prior programming experience in Python and a rudimentary knowledge of computational complexity. You will spend a considerable amount of time writing programs to implement the concepts covered in the course. For example, you will write a program that will simulate a robot vacuum cleaning a room or will model the population dynamics of viruses replicating and drug treatments in a patient's body.

Topics covered include:

• Advanced programming in Python 3
• Knapsack problem, Graphs and graph optimization
• Dynamic programming
• Plotting with the pylab package
• Random walks
• Probability, Distributions
• Monte Carlo simulations
• Curve fitting
• Statistical fallacies