Crash Course Computer Science - Season 1 Episode 3 Boolean Logic & Logic Gates
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.
Year: 2017
Genre:
Country: United States of America
Studio: YouTube, PBS Digital Studios
Director:
Cast: Carrie Anne Philbin
Crew:
First Air Date: Feb 22, 2017
Last Air date: Dec 21, 2017
Season: 1 Season
Episode: 40 Episode
Runtime: 12 minutes
IMDb: 0.00/10 by 0.00 users
Popularity: 2.4799
Language: English
Keyword :
Episode
Early Computing
Electronic Computing
Boolean Logic & Logic Gates
Representing Numbers and Letters with Binary
How Computers Calculate - the ALU
Registers and RAM
The Central Processing Unit (CPU)
Instructions & Programs
Advanced CPU Designs
Early Programming
The First Programming Languages
Programming Basics: Statements & Functions
Intro to Algorithms
Data Structures
Alan Turing
Software Engineering
Integrated Circuits & Moore’s Law
Operating Systems
Memory & Storage
Files & File Systems
Compression
Keyboards & Command Line Interfaces
Screens & 2D Graphics
The Cold War and Consumerism
The Personal Computer Revolution
Graphical User Interfaces
3D Graphics
Computer Networks
The Internet
The World Wide Web
Cybersecurity
Hackers & Cyber Attacks
Cryptography
Machine Learning & A.I.
Computer Vision
Natural Language Processing
Robots
Psychology of Computing
Educational Technology
The Future of Computing