New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Digital Design True/False Challenge

Yes or No

Played 0

About this activity

Quick true/false quiz on combinational logic concepts.

Created by

Palestine

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Digital Design True/False Challenge
 

Digital Design True/False ChallengeOnline version

Quick true/false quiz on combinational logic concepts.

by Owais Alhgahmed
1

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

2

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

3

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

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.

5

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

6

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

7

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

8

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

9

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

10

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

Are you sure you want to leave the page?

If you leave, you will lose the game in progress.