Compression: Crash Course Computer Science #21

Compression: Crash Course Computer Science #21

9th - 12th Grade

10 Qs

quiz-placeholder

Similar activities

Syllabus Scavenger Hunt – English I  with Mrs. Lacy-Scott

Syllabus Scavenger Hunt – English I with Mrs. Lacy-Scott

9th Grade - University

10 Qs

Understanding Engines

Understanding Engines

12th Grade

11 Qs

(1/8)APCS 17 WEEKS until AP EXAM (old 7 wks)

(1/8)APCS 17 WEEKS until AP EXAM (old 7 wks)

10th Grade - University

9 Qs

Understanding Digital Images

Understanding Digital Images

11th Grade

11 Qs

Marine Food Webs and Seaspiracy Test Review

Marine Food Webs and Seaspiracy Test Review

9th Grade

14 Qs

Understanding Digital Audio

Understanding Digital Audio

11th Grade

10 Qs

   DHS Library quiz

DHS Library quiz

9th Grade

14 Qs

RETAKE AG MECH!

RETAKE AG MECH!

12th Grade

7 Qs

Compression: Crash Course Computer Science #21

Compression: Crash Course Computer Science #21

Assessment

Quiz

others

9th - 12th Grade

Easy

Created by

Tamara Stewart

Used 1+ times

FREE Resource

10 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

Ideally, we want __________________ to be as small as possible, so we can store lots of them without filling up our hard drives and also transmit them more quickly.

2.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

To know where rows end, image files have __________________, which defines properties like dimensions.

3.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

One way to compress data is to reduce repeated or __________________ information.

4.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

A compression technique that has this characteristic is called __________________ compression, because we don't lose anything.

5.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

To do this, we need a __________________ that stores the mapping from codes to data.

6.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

One method for generating efficient codes is building a Huffman __________________, invented by David Huffman while he was a student at MIT in the 1950's.

7.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

Both run-length __________________ and dictionary coders are lossless compression techniques.

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?