Online courses directory (548)

This course provides students with a theoretical and conceptual understanding of the field of game design, along with practical exposure to the process of creating a game. Topics covered include iteration, rapid prototyping, mechanics, dynamics, flow theory, the nature of fun, game balance, and user interface design. Primary focus is on non-digital games. The course instructor recommends purchase of one or more textbooks or other course materials. Please see the details below. * Challenges for Game Designers, by Brathwaite & Schreiber. [Required; estimated cost $16.50] This book covers a lot of basic information on both practical and theoretical game design. It will be referenced heavily throughout the course. * Tabletop: Analog Game Design, edited by Costikyan [Required; free as PDF download] This is a collection of essays on tabletop game design and analysis. * Understanding Comics: The Invisible Art, by McCloud. [Recommended; estimated cost $12.50] While this book refers to comics, many of the lessons within it can be applied to game design and other forms of art. It also is written in a comic book format (which makes it fun to read). * A Theory of Fun for Game Design, by Koster. [Recommended; estimated cost $15.50] This book shows the similarities between game design and education. It also incorporated good discussions regarding the concept of Flow.

The course covers the basics: representing games and strategies, the extensive form (which computer scientists call game trees), repeated and stochastic games, coalitional games, and Bayesian games (modeling things like auctions).

This course is an introduction to game theory and strategic thinking. Ideas such as dominance, backward induction, Nash equilibrium, evolutionary stability, commitment, credibility, asymmetric information, adverse selection, and signaling are discussed and applied to games played in class and to examples drawn from economics, politics, the movies, and elsewhere.

This course is an introduction to the fundamentals of game theory and mechanism design. Motivations are drawn from engineered/networked systems (including distributed control of wireline and wireless communication networks, incentive-compatible/dynamic resource allocation, multi-agent systems, pricing and investment decisions in the Internet), and social models (including social and economic networks). The course emphasizes theoretical foundations, mathematical tools, modeling, and equilibrium notions in different environments.

Do you want to know what Gamification really is about? Do you want to learn how to design fun and engaging experiences? Are you ready to change your world with game design? Then join us in this MOOC!

Learn about General Game Playing (GGP) and develop GGP programs capable of competing against humans and other programs in GGP competitions .

Learn how to gather, clean, and manage data from a variety of sources. This is the third course in the Johns Hopkins Data Science Specialization.

GMAT: Data Sufficiency 1. GMAT: Data Sufficiency 2. GMAT: Data Sufficiency 3. GMAT: Data Sufficiency 4. GMAT: Data Sufficiency 5. GMAT: Data Sufficiency 6. GMAT: Data Sufficiency 7. GMAT: Data Sufficiency 8. GMAT: Data Sufficiency 9. GMAT: Data Sufficiency 10. GMAT: Data Sufficiency 11. GMAT: Data Sufficiency 12. GMAT: Data Sufficiency 13. GMAT: Data Sufficiency 14. GMAT: Data Sufficiency 15. GMAT: Data Sufficiency 16. GMAT: Data Sufficiency 17. GMAT: Data Sufficiency 18. GMAT: Data Sufficiency 19. GMAT: Data Sufficiency 20. GMAT: Data Sufficiency 21. GMAT Data Sufficiency 21 (correction). GMAT: Data Sufficiency 22. GMAT: Data Sufficiency 23. GMAT: Data Sufficiency 24. GMAT: Data Sufficiency 25. GMAT: Data Sufficiency 26. GMAT: Data Sufficiency 27. GMAT: Data Sufficiency 28. GMAT: Data Sufficiency 29. GMAT: Data Sufficiency 30. GMAT: Data Sufficiency 31. GMAT: Data Sufficiency 32. GMAT: Data Sufficiency 33. GMAT: Data Sufficiency 34. GMAT: Data Sufficiency 35. GMAT: Data Sufficiency 36. GMAT: Data Sufficiency 37. GMAT: Data Sufficiency 38. GMAT: Data Sufficiency 39. GMAT Data Sufficiency 40. GMAT Data Sufficiency 41.

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 a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of "computer science beyond computers": that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds. Beginning in antiquity—with Euclid's algorithm and other ancient examples of computational thinking—the course will progress rapidly through propositional logic, Turing machines and computability, finite automata, Gödel's theorems, efficient algorithms and reducibility, NP-completeness, the P versus NP problem, decision trees and other concrete computational models, the power of randomness, cryptography and one-way functions, computational theories of learning, interactive proofs, and quantum computing and the physical limits of computation. Class participation is essential, as the class will include discussion and debate about the implications of many of these ideas.

This course introduces students to both passive and active electronic components (op-amps, 555 timers, TTL digital circuits). Basic analog and digital circuits and theory of operation are covered. The labs allow the students to master the use of electronic instruments and construct and/or solder several circuits. The labs also reinforce the concepts discussed in class with a hands-on approach and allow the students to gain significant experience with electrical instruments such as function generators, digital multimeters, oscilloscopes, logic analyzers and power supplies. In the last lab, the students build an electronic circuit that they can keep. The course is geared to freshmen and others who want an introduction to electronics circuits.

This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

In this course, we will study security and trust from the hardware perspective. Upon completing the course, students will understand the vulnerabilities in current digital system design flow and the physical attacks to these systems. They will learn that security starts from hardware design and be familiar with the tools and skills to build secure and trusted hardware.

This course introduces concepts, languages, techniques, and patterns for programming heterogeneous, massively parallel processors. Its contents and structure have been significantly revised based on the experience gained from its initial offering in 2012. It covers heterogeneous computing architectures, data-parallel programming models, techniques for memory bandwidth management, and parallel algorithm patterns.

Programming-oriented course on effectively using modern computers to solve scientific computing problems arising in the physical/engineering sciences and other fields. Provides an introduction to efficient serial and parallel computing using Fortran 90, OpenMP, MPI, and Python, and software development tools such as version control, Makefiles, and debugging.

6.776 covers circuit level design issues of high speed communication systems, with primary focus being placed on wireless and broadband data link applications. Specific circuit topics include transmission lines, high speed and low noise amplifiers, VCO's, mixers, power amps, high speed digital circuits, and frequency synthesizers. In addition to learning analysis skills for the above items, students will gain a significant amount of experience in simulating RF circuits in SPICE and also building RF circuits within a lab project.

In the last half of the 20th century, the role of computation in the sciences grew rapidly, driven by advances in silicon-based processors, fiber-optic networks, a host of numerical algorithms, and sets of standard protocols for processing and exchanging data. Much of this digital technology now permeates everyday life. Building on these and emerging technologies, the 21st century is poised to unleash a new, data-intensive paradigm of scientific discovery that will dramatically enhance the scope and scale of data capture, curation, and analysis. In this new (4th) paradigm, cures for cancer might be found by the collective investigations of agents computing "in the cloud.

In an introduction to the basics of the famous Customer Development Process, Steve Blank provides insight into the key steps needed to build a successful startup. The main idea in this course is learning how to rapidly develop and test ideas by gathering massive amounts of customer and marketplace feedback. Many startups fail by not validating their ideas early on with real-life customers. In order to mitigate that, students will learn how to get out of the building and search for the real pain points and unmet needs of customers. Only with these can the entrepreneur find a proper solution and establish a suitable business model. Building a startup is not simply building an execution plan for a business model that the entrepreneur thinks will work, but rather, a search for the actual business model itself.

This course will walk you through the major components of building GRITS, an HTML5 game. We'll talk about how to take standard game development techniques, and use them to create high performance HTML5 applications.

Helping you build human-centered design skills, so that you have the principles and methods to create excellent interfaces with any technology.

Helping you build human-centered design skills, so that you have the principles and methods to create excellent interfaces with any technology.