How many distinct patterns can n bits form, and what unsigned range do 8 bits cover?
Reveal answer & explanation
2^n patterns; 8 bits give 256 patterns naming 0 through 255, one less than the pattern count.
Recall first, then reveal the answer. Browse 8 sample cards below, or use spaced review to save your personal review schedule.
Start with 12 original questions on data, code and networks. Selected foundations; check coverage for the full scope.
8 cards due or new · Ready when you are
Version sample-r02 · Original foundation materials · No sign-up
Try recalling the idea before revealing it. Browsing these examples does not change your saved review schedule.
2^n patterns; 8 bits give 256 patterns naming 0 through 255, one less than the pattern count.
It tests equality and evaluates to a Boolean; assignment uses the left arrow ←.
Bandwidth is the maximum amount of data that can be sent in a fixed amount of time.
1 through n; an index below 1 or above n produces an error and the program terminates.
Place row 8, 4, 2, 1 under 1101: 8 + 4 + 1 = 13.
Exactly one: the IF block when the condition is true, otherwise the ELSE block.
Shifts them one position right, places value at index i, and increases the length by 1.
An address (IP address) assigned to the device on the network.
Original foundation lessons and 12-question representative sample of a planned 48-question MCQ practice across selected goals; not complete CED coverage..
The cards preview selected ideas; they do not measure readiness for the whole examination. Your personal review schedule is available in the review tool.
Author-reviewed learning materials. Independent educator review is pending; question difficulty has not been calibrated with learner results. Check coverage and gaps before planning your preparation.
These prompts and explanations are the site's original learning materials. The reference links below support the selected skills; they are not endorsements or official examination questions.