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
ProblemCourse & topicStatus
Boolean algebra and combinational logicDigital Logic · Mixed review
—Boolean algebra and combinational logicDigital Logic · Mixed review
—Boolean algebra and combinational logicDigital Logic · Mixed review
—Logic minimization and hazardsDigital Logic · Mixed review
—Logic minimization and hazardsDigital Logic · Mixed review
—Latches, flip-flops, and sequential circuitsDigital Logic · Mixed review
—Latches, flip-flops, and sequential circuitsDigital Logic · Mixed review
—Latches, flip-flops, and sequential circuitsDigital Logic · Mixed review
—Finite-state-machine designDigital Logic · Mixed review
—Finite-state-machine designDigital Logic · Mixed review
—Arithmetic units and datapath compositionDigital Logic · Mixed review
—Arithmetic units and datapath compositionDigital Logic · Mixed review
—Arithmetic units and datapath compositionDigital Logic · Mixed review
—Timing, clocking, and HDL verificationDigital Logic · Mixed review
—Timing, clocking, and HDL verificationDigital Logic · Mixed review
—DLOG:9918001Mathematical problem title
Boolean CombinationalDigital Logic Problem Solving
Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Boolean algebra and combinational logicDigital Logic · Calculation
—Showing 24 of 315 matching problems.
Shannon cofactors wire a 4:1 MUX; they do not approximate the function
A silent request is a defined zero, not a one-hot don't-care
MSB equality sits on the GT path; LSB-first cascade is a different function
Three outputs share three products; a two-term AND plane cannot
Bubble-push the factored form; a four-term SOP is the expensive NAND net
Convert one next-state map through D, JK, and T excitation
A long enable is not an edge: expose latch transparency and race-through
A tap set decides the cycle: trace a maximal LFSR and a lockup
Detect every 1011, including the one that shares its last 1
From prose to a 20-cent Mealy vender that returns one nickel
Generate and propagate make a 4-bit lookahead faster than a ripple carry
A Booth shift-add controller multiplies two's-complement 4-bit operands
A 2-read 1-write file forces a 7-cycle schedule and forbids a 1-cycle MAC
A registered ready/valid stage must hold when the consumer is not ready
Incomplete combinational assignment latches; an enabled flip-flop does not
The unsigned binary quantity N=1101011.1011_{2} is given.
Convert the unsigned decimal integer 86 to binary.
The unsigned octal quantity Q=653.24_{8} is given.
The unsigned hexadecimal quantity H=\mathrm{C5.A}_{16} is given.
The unsigned octal integer P=1752_{8} is given.
Interpret A=10110101_{2} and B=01101110_{2} as unsigned 8-bit integers.
Interpret X=11001000_{2} and Y=01011101_{2} as unsigned 8-bit integers.
An 8-bit sign-magnitude encoding uses the most significant bit as the sign (0 for nonnegative, 1 for negative) and…
An 8-bit ones'-complement encoding represents a nonnegative integer k by the ordinary 8-bit unsigned encoding of k,…