Skip to main content

Train Courses Problems Proof Blocks Tools Progress Account

⌄

AccountSign-in, membership, and settings Current courseCalculus IThemeAbout ProofAnvilLoading account…

Problem library

Find a problem

Search by course or topic.

Loading the problem library…

TrainCoursesProblemsProgressMoreTrain Courses Problems Progress

More

Proof Blocks Tools Account

ProofAnvil Practice$19 USD monthly · cancel any time

Pricing FAQ Features Roadmap Use with your agent Support Terms Privacy Refunds

Practice problems with hints and solutions · ProofAnvil

Problem library

Find a problem

Search by course or topic.

Search problems

Filters · 2 active

Area

AllMathPhysics

SubjectCourseTopic

Topic choices for Digital Logic are shortened. Search still covers every problem.

StatusSkill

Skills match the applied subject and course.

Problem styleFind a private labelPrivate labelPrivate labels are visible only to you.Private labels ready.Favorites

Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available.

Progress labels

IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due

Problem results

Sort

ProblemsClear skill: Minimization Build a practice set

ProblemCourse & topicStatus

DLOG:9918051Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918052A 4-bit input ABCD is interpreted as an unsigned binary integer N=8A+4B+2C+D.

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918053A 4-variable function F(A,B,C,D) equals 1 if and only if at least three of the four inputs are 1.

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918054Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918055Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918056Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918057Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918058Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918059Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918060Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918061A half adder has inputs A and B and outputs S (sum) and C (carry).

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918062Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918063Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918064Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918065Each full-adder cell of a 4-bit ripple-carry adder is the two-half-adder circuit of Problem 62: XOR delay…

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918066Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918067Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918068An 8-bit adder is built as two 4-bit carry-lookahead blocks with a second-level lookahead on the blocks.

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918069Unsigned 4-bit one's-complement addition uses an ordinary 4-bit adder followed by an end-around carry: if the…

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918070Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918071Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918072Mathematical problem title

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918073A 4-bit unsigned comparator is assembled from two copies of the 2-bit comparator of Problem 72.

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

DLOG:9918074Even parity on a bit string means that the total number of 1s, counting an appended parity bit, is even.

MinimizationDigital Logic Problem Solving

Logic minimization and hazardsDigital Logic · Calculation

—

Showing 24 of 50 matching problems.

Private labels

Edit private labels

Add labels that only you can see.

Problem

Current labels

Private labels are unavailable. Close this editor and try again.

New label

Use a short label.

Let

F(A,B,C,D)=\sum m(4,5,6,7,12,13)

with variable order

ABCD

(

A

most significant).

Let

F(A,B,C,D)=\sum m(0,1,2,8,10,11,14,15)

with variable order

ABCD

(

A

most significant).

A 5-variable function with variable order

ABCDE

(

A

most significant, so the minterm index is

16A+8B+4C+2D+E

)…

Let

F(A,B,C,D)=\sum m(1,5,6,7,8,9,10,14)

with variable order

ABCD

(

A

most significant).

Two 4-variable functions share the onset minterms

\{0,2,8,10,12,14\}

in variable order ABCD (A most significant).

An incompletely specified function of four variables is

F(A,B,C,D)=\sum m(0,1,2,5,8,9)+d(7,10,13,15)

with…

For Boolean variables A,B,C taking values in

\{0,1\}

, decide whether each of the following is an identity (true…

A 4-bit word ABCD is a valid excess-3 encoding of a decimal digit

k\in\{0,1,\ldots,9\}

when the unsigned integer…

A full adder with inputs A, B, and

C_{\mathrm{in}}

and outputs S and

C_{\mathrm{out}}

is built from two half…

A full adder has inputs A, B,

C_{\mathrm{in}}

and outputs S,

C_{\mathrm{out}}

.

A 4-bit ripple-carry adder is a chain of four full adders

\mathrm{FA}_0,\mathrm{FA}_1,\mathrm{FA}_2,\mathrm{FA}_3

…

A 4-bit carry-lookahead adder uses bitwise generate and propagate

g_i=a_ib_i,\qquad p_i=a_i\oplus b_i

, carries…

A 4-bit carry-lookahead unit uses

g_i=a_ib_i

and

p_i=a_i\oplus

b_i

.

An 8-bit two's-complement adder/subtractor computes R=A+B when M=0 and

R=A+\overline{B}+1

when M=1, using a single…

Four-bit two's-complement overflow for addition is defined by

V=C_4\oplus

C_3

, where

C_3

is the carry into the MSB…

A 2-bit unsigned magnitude comparator has inputs

A=a_1a_0

and

B=b_1b_0

(bit 0 the LSB) and outputs GT, EQ, and LT,…