Digital Design True/False Challenge

Sí o No

Jugadas 0

Crear copia

Sobre esta actividad

Quick true/false quiz on combinational logic concepts.

Creada por

Owais Alhgahmed

Palestina

Descarga la versión para jugar en papel

Top 10 resultados

Todavía no hay resultados para este juego. ¡Sé el primero en aparecer en el ranking! Inicia sesión para identificarte.

Crea tu propio juego gratis desde nuestro creador de juegos

Compite contra tus amigos para ver quien consigue la mejor puntuación en esta actividad

Crear reto


Digital Design True/False ChallengeVersión en línea Quick true/false quiz on combinational logic concepts. por Owais Alhgahmed 1 A 3-state gate guarantees a defined output of 0 or 1 even when it is disabled. Yes No 2 In a 4-bit adder/subtractor using two's complement, the final carry can be ignored for subtraction. Yes No 3 For subtraction A - B using two's complement, compute A + (2's complement of B). Yes No 4 A 3-state gate can be wired together with other gates, but at most one gate can be enabled at a time to avoid conflicts. Yes No 5 A 7-segment decoder outputs the same pattern for all input codes regardless of the BCD value. Yes No 6 The final carry in an n-bit adder is never used or considered for any operation. Yes No 7 A ripple-carry adder propagates the carry from least significant to most significant through each full adder. Yes No 8 A combinational circuit's outputs are determined only by the present inputs. Yes No 9 A 2-to-4 decoder has no enable input and always activates one of its outputs. Yes No 10 A ripple-carry adder has a constant delay regardless of the number of bits. Yes No

Digital Design True/False ChallengeVersión en línea

Quick true/false quiz on combinational logic concepts.

por Owais Alhgahmed

A 3-state gate guarantees a defined output of 0 or 1 even when it is disabled.

Yes

In a 4-bit adder/subtractor using two's complement, the final carry can be ignored for subtraction.

Yes

For subtraction A - B using two's complement, compute A + (2's complement of B).

Yes

A 3-state gate can be wired together with other gates, but at most one gate can be enabled at a time to avoid conflicts.

Yes

A 7-segment decoder outputs the same pattern for all input codes regardless of the BCD value.

Yes

The final carry in an n-bit adder is never used or considered for any operation.

Yes

A ripple-carry adder propagates the carry from least significant to most significant through each full adder.

Yes

A combinational circuit's outputs are determined only by the present inputs.

Yes

A 2-to-4 decoder has no enable input and always activates one of its outputs.

Yes

A ripple-carry adder has a constant delay regardless of the number of bits.

Yes

Puedes integrar el juego en un LMS compatible con LTI 1.1 o LTI 1.3 como Canvas, Moodle, o Blackboard. De esta manera podrás guardar las puntuaciones automáticamente en el libro de calificaciones de esa plataforma.

Digital Design True/False Challenge

Sí o No

Sobre esta actividad

Creada por

Descarga la versión para jugar en papel

Top juegos

Sí o No

¿Es verdad?

Sí o No

¿Está creado con Inteligencia Artificial?

Sí o No

Preguntas sobre futbol para niños

Sí o No

Grammys a mejor canción/grabación

Sí o No

OPEN UP 5 UNIT 3: THERE IS/ARE, THERE WAS, THERE WERE

Digital Design True/False ChallengeVersión en línea

por Owais Alhgahmed

A 3-state gate guarantees a defined output of 0 or 1 even when it is disabled.

In a 4-bit adder/subtractor using two's complement, the final carry can be ignored for subtraction.

For subtraction A - B using two's complement, compute A + (2's complement of B).

A 3-state gate can be wired together with other gates, but at most one gate can be enabled at a time to avoid conflicts.

A 7-segment decoder outputs the same pattern for all input codes regardless of the BCD value.

The final carry in an n-bit adder is never used or considered for any operation.

A ripple-carry adder propagates the carry from least significant to most significant through each full adder.

A combinational circuit's outputs are determined only by the present inputs.

A 2-to-4 decoder has no enable input and always activates one of its outputs.

A ripple-carry adder has a constant delay regardless of the number of bits.

		%
	Anónimo	%
		%
		%