What does Boolean algebra describe?
Boolean algebra describes variables that take one of two values, 0 or 1, and expressions that determine outputs from those values.
Study 2 Digital Logic with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What does Boolean algebra describe?
Boolean algebra describes variables that take one of two values, 0 or 1, and expressions that determine outputs from those values.
When does AND output 1?
AND outputs 1 only when both inputs are 1; its Boolean expression is A⋅B, or simply AB.
When does inclusive OR output 1?
OR outputs 1 when at least one input is 1, including when both inputs are 1; it is written A+B.
When does XOR output 1?
XOR outputs 1 when its inputs differ and 0 when they match; it is written A⊕B.
When does XNOR output 1?
XNOR outputs 1 when its inputs match and 0 when they differ; it is the complement of XOR.
How are NAND and NOR related to AND and OR?
NAND is the complement of AND, ¬(A⋅B); NOR is the complement of OR, ¬(A+B).
How many input combinations are there for n binary inputs?
A truth table has 2n input combinations for n binary inputs.
What are the Boolean identity rules for OR with 0 and AND with 1?
The identity rules are A+0=A and A⋅1=A: OR with 0 and AND with 1 leave A unchanged.
What happens when a Boolean value is ORed or ANDed with itself?
The idempotent rules are A+A=A and A⋅A=A.
What are the Boolean complement rules?
A value ORed with its complement is 1, while a value ANDed with its complement is 0: A+A′=1 and A⋅A′=0.
What do De Morgan’s laws say?
De Morgan’s laws are ¬(A⋅B)=¬A+¬B and ¬(A+B)=¬A⋅¬B.
What determines a combinational circuit’s outputs?
A combinational circuit’s outputs depend only on its current inputs, not on earlier inputs or stored state.
A progressive guide to how computers encode numbers, text, images, and sound as binary data, including the trade-offs and limits of digital representation.
A focused set of flashcards covering Python variables, data types, expressions, control flow, functions, input, output, and common programming practices.
A structured guide to the main data structures, their operations, efficiency trade-offs, representations, and practical selection criteria.
A progressive guide to tree structure, binary-tree traversals, binary search tree operations, deletion, balancing, and the way tree height determines time and space costs.
A focused review of propositional logic, quantifiers, sets, relations, functions, and foundational proof methods in discrete mathematics for computer science.
A progression through how data is organized, searched, exposed through software interfaces, and managed through abstraction layers in modern computer systems.
A medium-difficulty quiz on integrating problem definition, representation, algorithms, complexity analysis, testing, correctness, ethical evaluation, and documentation in a computer science capstone.
A practical guide to integrating problem definition, data representation, modular programming, algorithms, complexity analysis, testing, correctness, and ethical evaluation into a responsible computer science capstone.
This quiz covers process management, context switching and scheduling, multitasking, traps and interrupts, and RISC-V privilege transitions.