Key term
WJEC A-Level Computer Science 601-5345-3
Hardware: Architecture, Memory and Storage
Networks and Data Transmission
Logic Gates and Boolean Algebra
Data Representation and Data Types
Data Structures
Organisation of Data: Files and Records
Database Systems
The Operating System
Algorithms and Programs
Principles of Programming
Systems Analysis
Software Engineering and Program Construction
Topic overviewIntegrated development environments and their purposeEditors, syntax highlighting and code entry toolsDebugging tools: breakpoints, stepping and watchesTranslation, source code and object codeLexical analysis and the symbol tableSyntax and semantic analysisCode generation and optimisation
Types of Software System
Practical Programming
Data Security and Integrity
Computing, Society and the Law
Topic overviewSocial and economic change from computingComputers and the nature of employmentThe digital divide and cultural changeEnvironmental cost of computingData protection and freedom of information lawThe Computer Misuse Act 1990 and computer crimeCopyright, surveillance and professional codes
Advanced Data Structures and Logic
Recursion, Sorting and Searching
Programming Paradigms and Translators
Topic overviewFunctional, declarative and imperative paradigmsClasses, methods and object-oriented designStandardisation of computer languagesAmbiguity in natural language and unambiguous notationBackus-Naur form and syntax diagramsCompilers, interpreters and assemblersTranslation and execution errors
System Design and Human-Computer Interaction
Software Engineering Tools and Professional Practice
Topic overviewSoftware tools for the software engineering processSoftware packages in systems analysis and specificationSoftware packages in systems designTesting tools and testing strategiesProgram version managementProgram libraries and project management toolsCodes of conduct and professional behaviour
Advanced Architecture and Assembly Language
Communication Networks and File Organisation
Number Representation and Floating Point
Databases and Distributed Systems
Topic overviewConsistency, redundancy and data independenceRelational organisation and normalisationRestructuring data into third normal formEntity relationship modellingQuery languages and SQLValidation, verification and the DBMSBig Data, data warehousing and miningDistributed systems and distributed databases
Operating System Management
Software Systems and Applications
Data Security, Cryptography and Attack
Logic Gates and Boolean Algebra
Logic gates and their truth tables
- 3 things to know
- AS Unit 1
Overview
Recall questions on when AND, OR, NOT and XOR each output 1, the four rows of each two-input truth table, the one case where OR and XOR disagree, everyday situations that behave like each gate, and why XOR is the natural way to compare two bit patterns.
What you need to know
Answer each one before you reveal it.
Your recallNot started
Key term
State the four rows of the truth table for a two-input OR gate.
Key term
State the four rows of the truth table for a two-input XOR gate.
Questions from this subtopic
Each one with the model answer underneath.
- 1
Under what condition does an AND gate output 1?
Model answer
It outputs 1 only when every one of its inputs is 1, and 0 in all other cases.
- 2
Under what condition does an OR gate output 1?
Model answer
It outputs 1 when at least one of its inputs is 1, and gives 0 only when all of them are 0.
- 3
What does a NOT gate do?
Model answer
It takes a single input and outputs the opposite value, turning a 0 into a 1 and a 1 into a 0.
- 4
Under what condition does an XOR gate output 1?
Model answer
It outputs 1 when its two inputs are different, and 0 when they are the same.
- 5
State the four rows of the truth table for a two-input AND gate.
Model answer
Inputs 0 and 0 give 0, inputs 0 and 1 give 0, inputs 1 and 0 give 0, and inputs 1 and 1 give 1.
- 6
State the four rows of the truth table for a two-input OR gate.
Model answer
Inputs 0 and 0 give 0, inputs 0 and 1 give 1, inputs 1 and 0 give 1, and inputs 1 and 1 give 1.
Other ways to work this
The same content, four other ways.
What is inside Levo
Six ways to work the same material.
Every question in Logic Gates and Boolean Algebra, on a schedule.
Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.
Or £46 a year, about £3.83 a month. Cancel anytime.