Why are NAND and NOR called universal gates?
NAND and NOR are universal gates: either gate type alone can implement NOT, AND, and OR.
Study 12 Discrete Structures and Algorithms with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
Why are NAND and NOR called universal gates?
NAND and NOR are universal gates: either gate type alone can implement NOT, AND, and OR.
What is an algorithm?
An algorithm is a precisely specified finite procedure that transforms input into output and produces a prescribed result.
What precondition makes binary search valid?
Binary search requires a sorted array; this lets it discard half of the remaining interval after each comparison.
When is an algorithm correct?
An algorithm is correct when it produces the required output for every valid input and terminates.
What are the three steps of a loop-invariant proof?
A loop-invariant proof uses initialization, maintenance, and termination to connect a persistent statement to the desired postcondition.
What must a recursive correctness proof establish?
A recursive correctness proof verifies a base case, a recursive step using smaller inputs, and progress toward the base case.
What are De Morgan’s laws in Boolean algebra?
De Morgan’s laws state A+B=AB and AB=A+B.
How many rows does a complete truth table with n inputs have?
A circuit with n input variables has 2n possible input combinations, so its complete truth table has 2n rows.
What does f(n)=Θ(g(n)) mean?
f(n)=Θ(g(n)) means both f(n)=O(g(n)) and f(n)=Ω(g(n)); the functions have the same asymptotic order.
How many bits are needed to represent N in binary?
A binary representation of the integer N requires Θ(logN) bits, not Θ(N)\\) bits.
Simplify A+AB.
The expression simplifies to A, because A+AB=A(1+B)=A.
What is a sum-of-products expression?
A sum-of-products expression is an OR of AND terms, such as (A∧¬B)∨(¬A∧C).
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to solving linear equations, rearranging formulas, using proportions and percents, and modeling everyday applications with equations.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A medium-difficulty quiz on double and triple integrals, including regions of integration, applications, density, average value, moments, and integral setup.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to defining sequences, evaluating their limits, and proving convergence or divergence using limit laws, bounds, monotonicity, the Squeeze Theorem, and recursive methods.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A 14-question assessment on power series, convergence, term-by-term operations, Taylor and Maclaurin series, polynomial approximation, and error bounds. The questions progress from foundational interpretation to applied convergence and approximation problems.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A structured guide to simplifying rational expressions, solving rational equations, analyzing rational functions, graphing their key features, and applying them to rates, work, and cost models.
A connected guide to modeling geometry, motion, mass, fields, work, flux, and optimization with the main tools of multivariable calculus.