
CS2110 Spring 24 Final Exam Prep
Authored by Sara Enright
Computers
University
Used 86+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
35 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Convert 42 to 8-bit unsigned binary
00101010
01010100
00101100
00100110
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is 8 in 4-bit 2's complement binary?
0000
0111
1000
You cannot represent 8 in 4-bit 2's complement binary
3.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
Given 8-bit unsigned binary numbers: A = 1001 0100 B = 0110 1101 C = 1011 1011, calculate (A & B) ^ C
(NOTE: ^ is XOR)
0000 0100
1011 1011
1011 1111
1011 0111
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following bit masks will clear bit 5 of A?
A | ~(1 << 5)
A | (1 << 5)
A & ~(1 << 5)
A & (1 << 5)
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Using DeMorgan's Law, find the equivalent boolean expression to: ~(~A & (B | ~C))
A & ~(B & ~C)
~A | ~(B | ~C)
A | (~B | C)
A | (~B & C)
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How many of each transistor type do you need to make a NOT gate?
1 N-type, 2 P-type
1 P-type, 2 N-type
1 P-type, 1 N-type
2 P-type, 2 N-type
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What type of gate is this circuit?
AND
OR
NAND
NOR
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?