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: Boolean Combinational Build a practice set

ProblemCourse & topicStatus

DLOG:9918001Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918002Convert the unsigned decimal integer 86 to binary.

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918003Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918004Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918005Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918006Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918007Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918008An 8-bit sign-magnitude encoding uses the most significant bit as the sign (0 for nonnegative, 1 for negative) and…

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918009An 8-bit ones'-complement encoding represents a nonnegative integer k by the ordinary 8-bit unsigned encoding of k,…

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918010An 8-bit two's-complement encoding is used.

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918011Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918012Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918013An unsigned 12-bit fixed-point format U8.4 uses eight bits to the left of the binary point and four bits to the right.

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918014An 8-bit two's-complement Q4.4 format uses four bits to the left of the binary point, including the sign bit, and…

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918015Packed binary-coded decimal (BCD) represents each decimal digit by its 4-bit unsigned binary encoding, more…

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918016Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918017Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918018Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918019A Boolean function f(A,B,C) of three variables is 1 exactly on the input combinations ABC=001, 010, and 111, and…

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918020Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918021Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918022Variables are W,X,Y,Z in that order, with W most significant for minterm and maxterm numbering.

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918023Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital Logic · Calculation

—

DLOG:9918024Mathematical problem title

Boolean CombinationalDigital Logic Problem Solving

Boolean algebra and combinational logicDigital 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.

The unsigned binary quantity

N=1101011.1011_{2}

is given.

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.

The 8-bit pattern

11010110_{2}

is interpreted in four ways: as an unsigned integer, as sign-magnitude, as ones'…

The 8-bit two's-complement encoding of an integer N is

10110101_{2}

.

The n-bit binary-reflected Gray code of an unsigned n-bit integer B is

G=B\oplus(B

shifted right by one bit), with…

The Excess-3 code of a decimal digit

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

is the 4-bit unsigned binary representation of the…

A 7-bit data word

D=1010011_{2}

is to be stored with a single parity bit placed as a new most significant bit…

Using only Boolean algebra (identities, not a map), reduce

F=(X+Y)(X+\overline{Y})(\overline{X}+Z)

to a…

Let

F=A(\overline{B}+C)+\overline{A}C

.

Let

\oplus

denote XOR and let juxtaposition denote AND.

Let

F=XY+\overline{X}Z+YZ

.