Introduction to Computer Graphics is a free, on-line textbook covering the fundamentals of computer graphics and computer graphics programming. This book is meant for use as a textbook in a one-semester course that would typically be taken by undergraduate computer science majors in their third or fourth year of college.

Lecture for the course "CS 217 – Probability and Statistics for Computer Science" delivered at the City College of New York in Spring 2019 by Evan Agovino as part of the Tech-in-Residence Corps program.

Lecture for the course "CS 217 – Probability and Statistics for Computer Science" delivered at the City College of New York in Spring 2019 by Evan Agovino as part of the Tech-in-Residence Corps program.

Lecture for the course "CS 217 – Probability and Statistics for Computer Science" delivered at the City College of New York in Spring 2019 by Evan Agovino as part of the Tech-in-Residence Corps program.

In this course, we will present the theory of Probabilistically Checkable Proofs (PCPs), and prove some fundamental consequences of it as well as more recent advances. More specifically, the first half of the course will be devoted to the (algebraic) proof of the basic PCP Theorem and basic relation to approximation problems. We will then move on to more advanced topics, such as hardness amplification, the long-code framework, the Unique-Games Conjecture and its implications, and the 2-to-2 Games Theorem.

Today, Carrie Anne is going to take a look at how those transistors we talked about last episode can be used to perform complex actions. With the just two states, on and off, the flow of electricity can be used to perform a number of logical operations, which are guided by a branch of mathematics called Boolean Algebra. We’re going to focus on three fundamental operations - NOT, AND, and OR - and show how they were created in a series of really useful circuits. And its these simple electrical circuits that lay the groundwork for our much more complex machines.

*CORRECTION* AT the graph says "Quinary System" but then the graph shows 10 possible states - which is actually decimal. Technically, there should be only 5 possible values there, but the overall concept is still the same.

Students learn about the similarities between the human brain and its engineering counterpart, the computer. Since students work with computers routinely, this comparison strengthens their understanding of both how the brain works and how it parallels that of a computer. Students are also introduced to the "stimulus-sensor-coordinator-effector-response" framework for understanding human and robot actions.

Design for Electrical and Computer Engineers is written for students and teachers engaged in electrical and computer engineering design projects, primarily in the senior year. It guides students and faculty through the steps necessary for the successful execution of design projects. The objective is to provide a treatment of the design process with a sound academic basis that is integrated with practical application. The foundation of the book is a strong vision — that a solid understanding of the Design Process, Design Tools, and the right mix of Professional Skills are critical for project and career success. This text is unique in providing a comprehensive design treatment for electrical and computer engineering.

This material enable the user to understand clearly the computer networks in detail.

Lecture for the course "CS 217 – Probability and Statistics for Computer Science" delivered at the City College of New York in Spring 2019 by Evan Agovino as part of the Tech-in-Residence Corps program.

This course provides a challenging introduction to some of the central ideas of theoretical computer science. Beginning in antiquity, the course will progress through finite automata, circuits and decision trees, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography and one-way functions, computational learning theory, and quantum computing. It examines the classes of problems that can and cannot be solved by various kinds of machines. It tries to explain the key differences between computational models that affect their power.

This interactive book is a product of the Runestone Interactive Project at Luther College, led by Brad Miller and David Ranum. There have been many contributors to the project. Our thanks especially to the following:



This book is based on the Original work by: Jeffrey Elkner, Allen B. Downey, and Chris Meyers

Activecode based on Skulpt

Codelens based on Online Python Tutor

Many contributions from the CSLearning4U research group at Georgia Tech.

ACM-SIGCSE for the special projects grant that funded our student Isaac Dontje Lindell for the summer of 2013.

NSF

The Runestone Interactive tools are open source and we encourage you to contact us, or grab a copy from GitHub if you would like to use them to write your own resources.

This book was developed in an attempt to maintain in one location the information and references that point to the many important historical developments of the short life of the computer graphics world as we know it.

This course provides an introduction to the theory and practice of quantum computation. Topics covered include: physics of information processing, quantum logic, quantum algorithms including Shor’s factoring algorithm and Grover’s search algorithm, quantum error correction, quantum communication, and cryptography.

This is a learner workbook for students to learn Scratch that links the Computer Science standards as identified by the Harvard Graduate School of Education

This course will introduce students to architectural design and computation through the use of computer modeling, rendering and digital fabrication. The course focuses on teaching architectural design with CAD drawing, 3-D modeling, rendering and rapid prototyping. Students will be required to build computer models that will lead to a full package of architectural explorations with computers. Each semester we will explore the design process of a particular building type and building material.
The course also investigates a few design processes of selected architects. The course is critical of design principles and building production methods. Student assignments are graded based on the quality of design, representation and constructability. Great design input is always encouraged.

For all intents and purposes, this show is the fourth edition of the textbook Computer Organization and Design Fundamentals by David Tarnoff. Since the first edition came out in 2005, the PDFs have been made free for download to anyone interested in computer organization. With the trend toward audio and video instructional material, it was time for an update.

The presentation of the material in this series will be similar to that of the original textbook. In the first third, we will discuss the mathematical foundation and design tools that address the digital nature of computers. This will include an introduction to the differences between the physical world and the digital world, how those differences affect the way the computer represents and manipulates data, and the use and design of digital logic and logic gates. In the second third, the fundamentals of the digital logic and design will be used to design common circuits such as binary adders, describe checksums and cyclic redundancy checks, network addressing, storage devices, and state machines. The final third will examine the top-level view of the computer. This will include a discussion of the memory hierarchy and its components, the components of a CPU, and maybe even a discussion of assembly language along with some examples.

The single most important skill for a computer scientist is problem solving. The goal of this book is to teach you to think like a computer scientist.