To tell a computer to do something, a program must be written to tell it exactly what to do and how to do it. If an algorithm has been designed, the computer program will follow this algorithm ...

A broad survey of the computer science discipline, focusing on the computer's role in representing, storing, manipulating, organizing and communicating information. Topics include hardware, software, ...

Making the real-world connection, the guide then walks programmers through implementing the algorithms on IBM's publicly available 5-qubit IBMQX4 quantum computer and others.

Instructors of a new self-paced version of Introduction to Computer Programming found that three weeks before the end of classes, about half of the students enrolled were halfway through the course ...

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

For 20 years, Paul Gries, a University of Toronto associate professor of computer science, teaching stream, has wanted to introduce a “self-paced” version of Introduction to Computer Programming, ...

The type of algorithm we need to solve this problem is called a computer program. This computer program is a list of instructions, in the right order, that makes the girl move on the screen.

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...

An introduction to the programming principles, methods and techniques of computer graphics. The course covers general graphics methods and techniques, graphics transformations, drawing algorithms, 3D ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.