Computer Logic Quiz

Computer Logic Quiz

12th Grade

17 Qs

quiz-placeholder

Similar activities

Five Nights At Freddy's: Security Breach Quiz

Five Nights At Freddy's: Security Breach Quiz

KG - Professional Development

13 Qs

Lecture Exercise Topic 1.3

Lecture Exercise Topic 1.3

12th Grade

21 Qs

Logika & Pemrograman (ID)

Logika & Pemrograman (ID)

10th Grade - Professional Development

20 Qs

Quiz ASJ

Quiz ASJ

12th Grade

20 Qs

4.6.4 Logic Gates

4.6.4 Logic Gates

10th Grade - Professional Development

15 Qs

Wee Word Intro

Wee Word Intro

7th - 12th Grade

12 Qs

Google

Google

7th - 12th Grade

20 Qs

Excel

Excel

12th Grade

15 Qs

Computer Logic Quiz

Computer Logic Quiz

Assessment

Quiz

Computers

12th Grade

Practice Problem

Medium

Created by

Joel Than

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?