ICT Quiz

ICT Quiz

University

20 Qs

quiz-placeholder

Similar activities

MECH Quiz Round (3)

MECH Quiz Round (3)

University

20 Qs

Data Mining Terminology 1

Data Mining Terminology 1

University

15 Qs

Qualitative research

Qualitative research

University

16 Qs

Processing and Analysis of Data Quiz

Processing and Analysis of Data Quiz

University

16 Qs

EC8501 MCQ1

EC8501 MCQ1

University

20 Qs

IOT Quiz 727821TUCS220

IOT Quiz 727821TUCS220

University

15 Qs

Qualitative Analysis

Qualitative Analysis

University

15 Qs

DATA ANALYSIS

DATA ANALYSIS

University

20 Qs

ICT Quiz

ICT Quiz

Assessment

Quiz

Other

University

Hard

Created by

Vishva V

Used 2+ times

FREE Resource

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following best defines entropy in information theory?

The measure of energy in a system

The measure of uncertainty in a random variable

The measure of processing speed in a computer

The measure of redundancy in a system

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The entropy of a fair coin toss (head or tail) is:

0

0.5

1

2

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the relation between probability and information content?

Higher probability means higher information

Higher probability means lower information

Probability and information are unrelated

Probability always equals information

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Mutual information between two random variables measures:

The total information in both variables

The information shared between the two variables

The entropy of a single variable

The probability of occurrence of a variable

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a property of entropy?

Entropy is always negative

Entropy is independent of probability

Entropy is maximized for a uniform distribution

Entropy is always zero for random variables

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which coding technique provides optimal prefix codes?

Arithmetic coding

Huffman coding

Shannon coding

Run-length coding

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which theorem states that no compression scheme can transmit more than the channel capacity?

Nyquist theorem

Shannon's theorem

Huffman's theorem

Fanon's theorem

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?