Computer Logic Quiz

Computer Logic Quiz

12th Grade

17 Qs

quiz-placeholder

Similar activities

DATA STRUCTURES

DATA STRUCTURES

12th Grade

20 Qs

python quiz

python quiz

12th Grade

20 Qs

Excel

Excel

10th - 12th Grade

15 Qs

C-Programming Basics

C-Programming Basics

12th Grade

16 Qs

C++ Recursion

C++ Recursion

8th - 12th Grade

12 Qs

Python programming

Python programming

6th - 12th Grade

16 Qs

Data visualization

Data visualization

10th Grade - University

12 Qs

C Programming Quiz

C Programming Quiz

12th Grade - University

20 Qs

Computer Logic Quiz

Computer Logic Quiz

Assessment

Quiz

Computers

12th Grade

Medium

Created by

Joel Than

Used 4+ times

FREE Resource

17 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Who is this person?

Dr Joel Than Chia Ming

Lee Min Ho

Park Seo-joon

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the decimal equivalent of the binary number 1010?

1001

1100

1010

10

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Without doing conversion, what is your best guess of -35 in 8 bit 2's complement?

11011101

01011101

01110001

00001111

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Explain the process of converting a decimal number to IEEE 754 floating point representation.

The binary number is normalized and the sign, exponent, and mantissa are determined according to the IEEE 754 standard.

The sign, exponent, and mantissa are determined randomly

The decimal number is converted directly to a binary number without any normalization

The IEEE 754 standard is not used for converting decimal numbers to floating point representation

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are the truth values for the proposition NEGATED p AND NEGATED q, when p is true and q is false?

true

false

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In graph theory, what is an Eulerian path?

A path in a graph that visits every vertex exactly once

A trail in a graph that visits every edge more than once

A trail in a graph that visits every edge exactly once

A cycle in a graph that visits every vertex exactly once

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Imagine you have a Venn diagram (A and B that are not exclusive) to draw and you darken regions that the relationship represents. Which relationship below will not require you to darken any region to signify this region?

A AND B

A OR B

COMPLEMENT A AND B

A AND COMPLEMENT A

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?

Discover more resources for Computers