AP CS Principal : 2.2 Data Compression

AP CS Principal : 2.2 Data Compression

11th Grade

10 Qs

quiz-placeholder

Similar activities

Practicum in IT 21-22 / TO: Digital Media

Practicum in IT 21-22 / TO: Digital Media

9th - 12th Grade

10 Qs

Data Compression

Data Compression

10th - 11th Grade

15 Qs

Code.org CSP Unit 1 Review

Code.org CSP Unit 1 Review

9th - 12th Grade

15 Qs

U1 Digital Information Vocab

U1 Digital Information Vocab

9th - 12th Grade

12 Qs

Pearson 1CP2 - 2.3 - Units of storage and Compression

Pearson 1CP2 - 2.3 - Units of storage and Compression

9th - 12th Grade

12 Qs

8525 AQA GCSE 3.3.8 Huffman & RLE

8525 AQA GCSE 3.3.8 Huffman & RLE

10th - 11th Grade

15 Qs

Compression Quiz

Compression Quiz

10th - 11th Grade

14 Qs

Warm Up Data Representation

Warm Up Data Representation

9th - 12th Grade

12 Qs

AP CS Principal : 2.2 Data Compression

AP CS Principal : 2.2 Data Compression

Assessment

Quiz

Computers

11th Grade

Easy

Created by

Hicabi Yeniay

Used 2+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE SELECT QUESTION

3 mins • 10 pts

Media Image

Lossless text compression

Which sequences could be replaced to compress the text?

Choose all answers that apply:

am

like

you

sam

eggs

2.

MULTIPLE CHOICE QUESTION

3 mins • 10 pts

Media Image

run-length encoding (RLE)

Here's the second row of the bitmap for the heart icon:

0011110001111000

How would that row be represented in RLE?

Choose 1 answer

0,2,5,3,5,3

0,2,5,4,5,3

2,4,3,4,3

0,2,5,3,5,3

  • 0,2,4,3,4,3

3.

MULTIPLE CHOICE QUESTION

3 mins • 10 pts

RLE decompression

The following is a compression of a 6x6 black and white icon, using RLE

2,2,2

2,2,2

0,6

0,6

2,2,2

2,2,2

What mathematical symbol does that icon resemble?

+

-

/

X

4.

MULTIPLE CHOICE QUESTION

3 mins • 10 pts

Media Image

Lossless bit compression : Huffman coding algorithm

Decode the following bits using the optimized binary codes.

111001

  • tgtct

  • tttct

  • ttcta

  • ttcat

5.

MULTIPLE CHOICE QUESTION

3 mins • 10 pts

Compression algorithms vary in how much they can reduce the size of an image.

Which of the following would likely be the easiest to compress?

Choose 1 answer:

Media Image
Media Image
Media Image
Media Image

6.

MULTIPLE CHOICE QUESTION

3 mins • 10 pts

Byte pair encoding is a compression algorithm that replaces repeated pairs of characters in a string with a character that isn't in the data, and creates a table of replacement mappings.

Here's a quote from Dr. Seuss:

"Think left and think right and think low and think high. Oh, the thinks you can think up if only you try!"

Which of the following character pairs would the algorithm replace?

Choose 2 answers:

nl

ft

th

in

7.

MULTIPLE CHOICE QUESTION

3 mins • 10 pts

Media Image

Tess is creating an alarm clock using an LCD (liquid-crystal display) that looks like in the picture:

Each digit will be 5 pixels wide and 7 pixels tall. She decides to save space by storing the pixels for each digit using run-length encoding (RLE).

RLE is a data compression technique that replaces "runs" (sequences of bits with the same value) with a number representing the length of the run.

Here's the RLE for one of the digits:

1,3,1

0,1,3,1

0,1,3,1

1,3,1

0,1,3,1

0,1,3,1

1,3,1

9

0

8

3

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?