lOMoARcPSD|20817699

Final CSI
Quizzes: Chapter 01

The _______ model is the basis for today’s computers.

a Leibnitz

b von Neumann c
Pascal d
Charles
Babbage

In a computer, the _______ subsystem stores data and programs.

a ALU
b input/output
c memory
d control unit

In a computer, the _______ subsystem performs calculations and logical operations. a

ALU
b input/output
c memory
d control unit

In a computer, the _______ subsystem accepts data and programs and sends processing
results to output devices.
a ALU
b input/output
c memory
d control unit

5. In a computer, the _______ subsystem serves as a manager of the other subsystems. a

ALU
b input/output
c memory
d control unit

According to the von Neumann model, _______ are stored in memory.

a only data b only
programs c data and
programs d neither data nor
programs A step-by-step
solution to a problem is
called _______. a hardware
b an operating system c a
computer language d an
algorithm

FORTRAN and COBOL are examples of _______.

a hardware b
operating systems c
computer languages

d algorithms

A 17th-century computing machine that could perform addition and subtraction was the
_______. a Pascaline b Jacquard loom c Analytical Engine d Babbage machine

10._______ is a set of instructions in a computer language that tells the computer what to
do with data. a An operating system b An algorithm
c A data processor d
A program

_______ is the design and writing of a program in structured form.

a Software engineering b
Hardware engineering c
Algorithm development
d Instructional
architecture

The first electronic special-purpose computer was called _______. a

Pascal
b Pascaline
c ABC d ENIAC

One of the first computers based on the von Neumann model was called _______.
a Pascal
 b Pascaline
c ABC d EDVAC

The first computing machine to use the idea of storage and programming was called
_______ a
the Madeline
b EDVAC
c the Babbage machine d the Jacquard loom

_______ separated the programming task from computer operation tasks.

a Algorithms b Data processors c
High-level programming languages d
Operating systems

Quizzes: Chapter 02

The base of the decimal number system is ____.

a) 2
b) 8
c) 10
d) 16

The base of the binary number system is ____.

a) 2
b) 8
c) 10
d) 16

The base of the octal number system is ____.

a) 2
b) 8
c) 10
d) 16

The base of the hexadecimal number system is ____.

a) 2
b) 8
c) 10
d) 16
 When converting a decimal integer to base b, we repeatedly _____ b.
a) divide
b) multiply
c) add to
d) subtract from

When converting a binary fraction to decimal, we repeatedly ____.

a) divide
b) multiply
c) add to
d) subtract from

Which of the following representations is erroneous?

a) (10111)2
b) (349)8
c) (3AB)16
d) 256

Which of the following representations is erroneous?

a) (10211)2
b) (342)8
c) (EEE)16
d) 145

Which of the following representations is erroneous?

a) (111)2
b) (346)8
c) (EEG)16
d) 221
Which of the following representations is erroneous?
a) (110)2
b) (141)8
c) (EF)16
d) 22A

11.Which of the following is equivalent to 12 in decimal?

a) (1110)2
b) (C)16
c) (15)8
d) None of the others

Which of the following is equivalent to 24 in decimal?

 a) (11000)2
b) (1A)16
c) (31)8
d) None of the others

13. Convert the binary number 1001 to decimal. The answer is:
a) 7
b) 9
c) 11
d) 15
14. Convert the binary number 101010 to hexadecimal:
a) 1A
b) 1B
c) 2A
d) 2B

15. Convert the hexadecimal number 1B to decimal:

a) 21
b) 23
c) 27
d) 29

Quizzes: Chapter 3

1) A byte consists of _______ bits. a 2 b 4 c 8 d 16

2) In a set of 64 symbols, each symbol requires a bit pattern length of _______ bits.
a 4b 5c 6d 7

3) How many symbols can be represented by a bit pattern with ten bits?
a 128 b
256 c
512 d
1024

4) If the ASCII code for E is 1000101, then the ASCII code for e is _______. Answer the
question without consulting the ASCII table.
a 1000110 b
1000111 c
 0000110 d
1100101

5. A 32-bit code called _______ represents symbols in all languages. a

ANSI
b Unicode
c EBCDIC
d Extended ASCII

6. An image can be represented in a computer using the _______ method.

a bitmap graphic b
vector graphic
c only
d either bitmap or vector graphic

7. In the _______ graphic method of representing an image in a computer, each pixel is

assigned a bit patterns.
a bitmap b
vector c
quantized d
binary

8. In the _______ graphic method of representing an image in a computer, the image

isdecomposed into a combination of geometrical figures. a bitmap b vector c quantized
d binary

9. In the _______ graphic method of representing an image in a computer, re-scaling ofthe

image creates a ragged or grainy image. a bitmap b vector c quantized d binary

10.Assume a new Excess system uses 17 bits to represent the exponent section. What is
he bias value in this system?
a 17
b 16 c 65535 d 65536
 11.Which number representation method is often used to store the exponential value of a
fractional part? a unsigned integers b two’s complement c Excess d ten’s complement

12.In an Excess conversion, we _______ the number to be converted.

a add the bias number to b the
bias number from c multiply
the bias number by d divide

13.When a fractional part is normalized, the computer stores the _______.

a only the sign b
only the exponent c
only the mantissa
d the sign, exponent, and mantissa

14.The precision of the fractional part of a number stored in a computer is defined by the
_______. a sign b exponent c mantissa
d last digit

15.The combination of sign and mantissa of a real number in IEEE standard floating point
format is stored as an integer in the ____________ representation. a unsigned b sign-
and-magnitude c two’s complement d one’s complement

Quizzes: Chapter 04

_______ is an arithmetic operation.

a The exclusive OR
b The unary NOT c
Subtraction d The
binary AND

_______ is a logical bit operator.

a The exclusive OR b The unary NOT c
The binary AND d exclusive OR, unary
NOT, or binary AND
 The _______ method of integer representation is the most common method for storing
integers in computer memory.
a sign-and-magnitude
b one’s complement c
two’s complement d
unsigned integers

In two’s complement addition, if there is a final carry after the left most column
addition, _______.
a add it to the right most column b
add it to the left most column
c discard it d increase
the bit length
5. For an 8-bit allocation, the smallest decimal number that can be represented in two’s
complement form is _______.
a -8 b
-127 c
-128 d
-256

For an 8-bit allocation, the largest decimal number that can be represented in two’s
complement form is _______.
a 8
b 127 c 128 d 256

In two’s complement representation with a 4-bit allocation, we get _______ when we

add 1 to 7.
a 8b
1
c -7 d
-8

In two’s complement representation with a 4-bit allocation, we get _______ when we

add 5 to 5.
a -5 b
-6 c -
7 d 10

9. If the exponent in Excess_127 is binary 10000101, the exponent in decimal is

_______.
a 6b
7c 8
d 9
If we
are
adding
two
numbe
rs, one
of
which
has an
expon
ent
value
of 7
and
the
other
an
expon
ent
value
of 9,
we
need
to
shift
the
decim
al
point
of the
smalle
r
numbe
r
_____
__.
a one place to the left b
one place to the right c
two places to the left d
two places to the right

_______ operator (s) takes two inputs to produce one output. a

Only AND b Only OR c Only XOR d AND, OR, or XOR

The unary _______ operator inverts its single input.

a AND
b OR c
NOT d
XOR

13. _______ operator (s), if the input is two 0s, the output is
0. a In only AND b In only OR c In only XOR d In AND,
OR, or XOR

_______ operator (s), if the input is two 1s, the output is 0.

a In only AND b In only OR c In only XOR d In AND,
OR, or XOR
 For the binary AND operation, only an input of _______ gives an output of 1. a
two 0s b two 1s c one 0 and one 1 d two 2s

For the binary OR operation, only an input of _______ gives an output of 0. a

two 0s b two 1s c one 0 and one 1 d two 2s

We use a bit pattern called a _______ to modify another bit pattern. a

mask b carry c float d byte

To flip all the bits of a bit pattern, make a mask of all 1s and then _______ the bit
pattern and the mask.
a AND
b OR c
XOR d
NOT

To un-set (force to 0) all the bits of a bit pattern, make a mask of all 0s and then
_______ the bit pattern and the mask.
a AND
b OR c
XOR d
NOT

To set (force to 1) all the bits of a bit pattern, make a mask of all 1s and then _______
the bit pattern and the mask.
a AND
b OR c
XOR d
NOT

Quizzes: Chapter 05

1.The TCP/IP model has _______ layers.

a.five
 b.six
c.seven
d.eight

2.The _______ layer of the TCP/IP protocol suite provides services for end users. a.data-
link
b.transport
c.application
dphysical

* The _______ layer of the TCP/IP protocol suite transmits a bit stream over a physical
medium.
* physical
* data-link* network
* transport

* The _______ layer of the TCP/IP protocol suite is responsible for node-to-node
delivery of a frame between two adjacent nodes.
* transport* network
* data-link
* session

The _______ layer of the TCP/IP protocol suite is responsible for source-todestination
delivery of the entire message.
* transport* network
* data-link
* session

* What is the domain name in the e-mail address kayla@nasa.gov?

* kayla
* kayla@nasa.gov
* nasa.gov
* gov
 *

Which physical topology uses a hub or switch?

* bus
* ring
* star
* bus and ring

* IP addresses are currently _______ bits in length.

* 4
* 8
* 32
* 40

* _______ protocol (s) is one of the protocols in the transport layer.

* Only TCP
* Only UDP
* Only SCTP
* TCP, UDP, and SCTP

* _______ is a protocol for file transfer.

* FTP
* SMTP
* TELNET* HTTP

* _______ is a protocol for e-mail services.

* FTP
* SMTP
* TELNET* HTTP

* _______ is a protocol for accessing and transferring documents on the WWW.

* FTP
* SMTP
* TELNET
* HTTP

13. Every computer looking to access the Internet would be known as this
client
 *

* desktop
* hub
* server

14. Identifies company or commercial sites

* .org
* .com
* .gov
* .edu

15. what is indicated when the domain name has only two letters like .us, .uk, .au, .mx, or
.ca
* invalid domain
* private domain
* secure domain
* country domain

Quizzes: Chapter 06

* _______ is a program that facilitates the execution of other programs.

* An operating system
* Hardware
* A queue
* An application program

* _______ supervises the activity of each component in a computer system.

* An operating system
* Hardware
* A queue
* An application program

* Multi-programming requires a _______ operating-system.

* batch
* time-sharing
* parallel
* distributed
_______ is multi-programming with swapping.
*

* Partitioning
* Paging
* Demand paging * Queuing

_______ is multi-programming without swapping.

* Partitioning
* Virtual memory* Demand paging * Queuing

* In _______, only one program can reside in memory for execution.

* mono-programming
* multi-programming
* partitioning
* paging

* _______ is a multi-programming method in which multiple programs are entirely in

memory with each program occupying a contiguous space. * Partitioning
* Paging
* Demand paging
* Demand segmentation

* In paging, a program is divided into equally sized sections called _______.

* pages
* frames
* segments
* partitions

* In _______, the program can be divided into differently sized sections. * partitioning
* paging
* demand paging
* demand segmentation

* In _______, the program can be divided into equally sized sections called pages, but
the pages need not be in memory at the same time for execution.
* partitioning
* paging
* demand paging
* demand segmentation

* A process in the _______ state can go to either the ready, terminated, or waiting states.
* hold
* virtual
* running
* hold or running

* A process in the ready state goes to the running state when _______.
* it enters memory
* it requests I/O
* it gets access to the CPU
* it finishes running

* A program becomes a _______ when it is selected by the operating system and brought to
the hold state.
* job
* process
* deadlock* partition

Every process is _______.

* only a job
* only a program* only a partition
* a job and a program

* The _______ scheduler creates a process from a job and changes a process back to a
job.
* job
* process
* virtual* queue

* The _______ scheduler moves a process from one process state to another.
* job
* process
* virtual* queue
 * To prevent _______, an operating system can put resource restrictions on processes. *
starvation
* synchronization
* paging
* deadlock

_______ can occur if a process has too many resource restrictions.

* Starvation
* Synchronization
* Paging
* Deadlock

* The _______ manager is responsible for archiving and backup.

* memory
* process
* device* file

* The _______ manager is responsible for access to I/O devices.

* memory
* process
* device
* file

Quizzes: Chapter 07

* _______ is a step-by-step method for solving a problem or doing a task.

* A construct
* A recursion
* An iteration
* An algorithm

* There are ______ basic constructs in computer -science.

* one
* two
* three * four

* The _______construct tests a condition.

* sequence
* decision
* repetition* flow

* The _______ construct uses a set of actions one after another.

* sequence
* decision
* repetition* flow

The _______ construct handles repeated actions.

* sequence
* decision
* repetition * flow

* _______ is a pictorial representation of an algorithm.

* A UML diagram
* A program
* Pseudocode
* An algorithm

* _______ is an English-language-like representation of code.

* A UML diagram
* A program
* Pseudocode
* An algorithm

* _______ is a basic algorithm that adds a list of numbers.

* Summation
* Product
* Smallest
* Largest

* _______ is a basic algorithm that multiplies a list of numbers.

* Summation
* Product
* Smallest* Largest

* _______ is a basic algorithm that arranges data according to its value.

* Inquiry* Sorting
* Searching
* Recursion

* The items are divided into two lists (sorted and unsorted) _____ sort.
* only in a selection
* only in a bubble
* only in an insertion
* in selection, bubble, or insertion

* In _______ sort, the item that goes into the sorted list is always the first item in the
unsorted list.
* selection
* bubble
* insertion
* every

* In _______ sort, the smallest item from the unsorted list is swapped with the item at
the beginning of the unsorted list.
* selection
* bubble
* insertion
* every

In ______ sort, the smallest item moves to the beginning of the unsorted list. There is
no one-to-one swapping.
* selection* bubble
* insertion
* every

* _______ is a basic algorithm in which we want to find the location of a target in a list
of items.
* Sorting
* Searching
* Product
* Summation

* We use a _______ search for an unordered list.

 * sequential
* binary
* bubble
* insertion

* We use a _______ search for an ordered list.

* sequential
* binary
* bubble
* insertion

_______ is a process in which an algorithm calls itself.

* Insertion
* Searching
* Recursion
* Iteration

19. What is a linear search?

* A sequential method for sorting elements within a list.

* A sequential method for sorting and finding an element within a list.
* A sequential method for finding an element within a list. * A sequential method that
reduces the size of a list.

20. How many checks will a linear search take to find number 6 in the list?3, 4, 7, 6,

5, 1

* 3
* 7
* 5
* 4

Chapter 08: Quizzes

The only language understood by computer hardware is a _______ language. a

machine b symbolic c high-level d natural
 C, C++, and Java can be classified as _______ languages. a
machine b symbolic c high-level d natural

FORTRAN is a(n) _______ language.

a procedural b
functional c
declarative d
object-oriented

Pascal is a(n) _______ language.

a procedural b
functional c
declarative d
object-oriented

Java is a(n) _______ language.

a procedural b
functional c
declarative d
object-oriented
LISP is a(n)
_______
language.
a procedural b
functional c
declarative d
object-oriented

_______ is a common language in the business -environment.

a FORTRAN
b C++ c C
d COBOL

_______ is a popular object-oriented language.

a FORTRAN b
COBOL
 c Java d
LISP

9. A _______ program can be either an application or an applet.

a FORTRAN
b C++ c C
d Java

10 LISP and Scheme are both _______ languages.

a procedural b
functional c
declarative d
object-oriented
Chapter 9:
Quizzes

One phase in system development is _______.

a analysis b
application c
designing d
collecting

Defining the users, requirements, and methods is part of the _______ phase.
a analysis b
design c
implementation d
testing

In the system development process, writing the program is part of the _______ phase.
a analysis b
design c
implementation d
testing
 In the system development process, structure charts are tools used in the _______ phase.
a analysis b design c implementation d testing

5. Testing a software system can involve _______ testing.

a black-box b
glass-box
c neither black-box nor glass-box d
both black-box and glass-box

_______ is the breaking up of a large project into smaller parts. a

Coupling b Incrementing c Obsolescence d Modularization

_______ is a measure of how tightly two modules are bound to each other.
a Modularity
b Coupling
c Interoperability
d Cohesion

_________between modules in a software system must be minimized.

a Coupling
b Cohesion
c Neither coupling nor cohesion d Both coupling and cohesion

9. _________between modules in a software system must be maximized.

a Coupling
b Cohesion
c Neither coupling nor cohesion d Both coupling and cohesion

10. What is the waterfall model?

a A phase cannot be started until the previous phase is completed b
A phase can be started until the previous phase is completed
c The development phase begins simultaneously d
The development process starts at the design phase
Quizzes: Chapter 10

1. A data structure can be _______.

• only an array
• only a record
• only a linked list
• an array, a record, or a linked list

2. An array that consists of just rows and columns is a _______ array.

• one-dimensional
• two-dimensional
• three-dimensional
• multidimensional
3. Each element in a record is called _______.
• a variable
• an index
• a field
• a node

4. All the members of a record must be _______.

• the same type
• related types
• integer type
• character type

5. _______ is an ordered collection of data in which each element contains the location of
the next element.
• An array
• A record
• A linked list
• A file

6. In a linked list, each element contains _______.

• only data
• only a link
• neither data nor a link
• data and a link
 7. The _______ is a pointer that identifies the next element in the linked list.
• link
• node
• array
• data

8. Given a linked list called children, the pointer variable children identifies ________
element of the linked list.
• the first
• the second
• the last
• any
9. An empty linked list consists of _______.
• a node
• two nodes
• data and a link a null head pointer

10.To traverse a list, you need a _______ pointer.

• null
• walking
• beginning
• insertion

Quizzes: Chapter 11

1. In an abstract data type, _______.

the ADT implementation is known
the ADT implementation is hidden
• the ADT public operations are hidden
• Nothing is hidden

2. A stack is a _________ structure.

• FIFO LIFO
• DIFO
• SIFO
 3. A(n) _______ list is also known as a queue.
• LIFO
• FIFO
• unordered
• ordered
4. If A is the first data element input into a stack, followed by B, C, and D,
then_______ is the first element to be removed.
• A
• B
• C
• D

5. If A is the first data element input into a queue, followed by B, C, and D,

then_______ is the first element to be removed.
• A
• B
• C
• D

6. The pop operation _______ of the stack.

• deletes an item from the top
• deletes an item from the bottom
• inserts an item at the top
• inserts an item at the bottom

7. The push operation _______ of the stack.

• deletes an item from the top
• deletes an item from the bottom
• inserts an item at the top
• inserts an item at the bottom

8. In a binary tree, each node has _______ two subtrees.

• more than
• less than
• at most
• at least
 9. In preorder traversal of a binary tree, the ______.
• left subtree is processed first
• right subtree is processed first
• root is processed first
• the root is never processed
10.In _______ traversal of a binary tree, the right subtree is processed last.
• preorder
• inorder
• postorder
• any order

11.In postorder traversal of a binary tree, the root is processed _______.

• first
• second
• last
• after the left subtree

12.In postorder traversal of a binary tree, the left subtree is processed _______.
• first
• second
• last
• after the right subtree

13.In _______ traversal of a binary tree, the left subtree is processed last.
• preorder
• inorder
• postorder
• out of order

14.In an inorder traversal of a binary tree, the root is processed _______.

• first
• second
• last
• two times

15. What is a full binary tree?

• Each node has exactly zero or two children
• Each node has exactly two children
• All the leaves are at the same level
 • Each node has exactly one or two children
Quizzes: Chapter 12

1. _______ file can be accessed randomly.

• A sequential
• An indexed
• A hashed
• Any

2. _______ file can be accessed sequentially.

• A sequential
• An indexed
• A hashed
• No

3.When a sequential file is updated, the ______ file gets the actual update.
• new master
• old master
• transaction
• error report

4.When a sequential file is updated, the ______ file contains a list of all errors occurring
during the update process.
• new master
• old master
• transaction
• error report

5.When a sequential file is updated, the ______ file contains the changes to be applied.
• new master
• old master
• transaction
• error report

6.After a sequential file is updated, the _______ file contains the most current data.
• new master
• old master
 • transaction
• error report
7.If the transaction file key is 20 and the first master file key is 25, then we _______.
• add the new record to the new master file
• revise the contents of the old master file
• delete the data
• write the old master file record to the new master file

8.If the transaction file key is 20 with a delete code and the master file key is 20, then we
_______.
• add the transaction to the new master file
• revise the contents of the old master file
• delete the data
• write the old master file record to the new master file

9.An indexed file consists of _______.

• only a sequential data file
• only an index
• only a random data file
• an index and random data file

10.The index of an indexed file has _______ fields.

• two
• three
• four
• any number of

11.In the _______ hashing method, selected digits are extracted from the key and used as
the address.
• direct
• division remainder
• modulo division
• digit extraction

12.In the _______ hashing method, the key is divided by the file size, and the address is
the remainder plus 1.
• direct
• modulo division
• division remainder
 • digit extraction
13.In the _______ hashing method, there are no synonyms or collisions.
• direct
• modulo division
• division remainder
• digit extraction

14._______ are keys that hash to the same location in the data file.
• Collisions
• Buckets
• Synonyms
• Linked lists

15.When a hashing algorithm produces an address for an insertion key and that address is
already occupied, it is called a _______.
• collision
• probe
• synonym
• linked list

16.The address produced by a hashing algorithm is the _______ address.

• probe
• synonym
• collision
• home

17.The _______ area is the file area that contains all the home addresses.
• probe
• linked
• hash
• prime

18.In the ______ collision resolution method, we try to put data that cannot be placed in
location 123 into location 124.
• open addressing
• linked list
• bucket hashing
• random hashing
19. Which one of the following explains the sequential file access method?
• random access according to the given byte number
 • read bytes one at a time, in order
• read/write sequentially by record
• read/write randomly by record

20. The data structure used for file directory is called ____________
• mount table
• hash table
• file table
• process table

Quizzes: Chapter 13

1.In a three-level DBMS architecture, the layer that interacts directly with the hardware is
the _______ level.
• external
• conceptual
• internal
• physical

2.In a three-level DBMS architecture, the _______ level determines where data is
actually stored on the storage devices.
• external
• conceptual
• internal
• physical

3.The _______ level of a three-level DBMS architecture defines the logical view of the
data.
• external
• conceptual
• internal
• physical

4.The data model and the schema of a DBMS are often defined at the _______ level.
external
• conceptual
• internal
• physical

5.In a three-level DBMS architecture, the _______ level interacts directly with the users.
• external
• conceptual
• internal
• physical

6.Of the various database models, the _______ model is the most prevalent today.
• hierarchical
• network
• relational
• linked list

7.Each column in a relation is called _______.

• an attribute
• a tuple
• a union
• an attitude

8.Each row in a relation is called _______.

• an attribute
• a tuple
• a union
• an attitude

9.A unary operator is applied to _______ relation(s) and creates an output of ________
relation(s).
• one, one
• one, two two, one
• two, two

10.A binary operator is applied to _______ relations (s) and creates an output of
________ relation(s).
• one, one
• one, two two, one
• two, two

11.The unary _______ operation always results in a relation that has exactly one more
row than the original relation.
• insert
• delete
• update
• select
 12.If you want to change the value of an attribute of a tuple, you use the _______
operation.
• project
• join
• update
• select

13.The operation that takes two relations and combines them based on common attributes
is the _________ operation.
• join
• project
• union
• intersection

14.If you need to delete an attribute in a relation, you can use the _______ operation.
• join
• project
• union
• intersection

15.You want to create a relation called New that contains tuples that belong to both
relation A and relation B. For this, you can use the _______ operation.
• select union
• project
• intersection

16.Which of the following is a unary operator?

• intersection
• union
• join
• project

17.Which of the following is a binary operator?

• select
• update
• difference
• all of the above
18._______ is a declarative language used on relational databases.
• PDQ
• SQL
• LES
 • PBJ

19. Given the basic ER and relational models, which of the following is
INCORRECT?

• An attribute of an entity can have more than one value

• An attribute of an entity can be composite
• In a row of a relational table, an attribute can have more than one value
• In a row of a relational table, an attribute can have exactly one value or a NULL value.

20. Which SQL statement is used to extract data from a database?

• Select
• Get
• Extract
• Open

Quizzes: Chapter 14

1.Data is compressed using a dictionary with indexes to strings. This is __________ .

• Huffman encoding
• Lempel Ziv encoding
• Morse coding
• lossy coding

2.A string of one hundred 0s is replaced by two markers, a 0, and the number 100. This is
___.
• run-length encoding
• Morse coding
• Huffman encoding
• Lempel Ziv encoding

3.___ is an example of lossy compression.

• Huffman encoding
• Lempel Ziv encoding
• Run-length encoding
• JPEG
4.In a ___ data compression method, the received data is an exact copy of the original
message.
• lossless
• lossy
• JPEG
• MPEG

5.___ data compression method, the received data need not be an exact copy of the original
message.
• Only in MP3
• Only in JPEG
• Only in MPEG
• In MP3, JPEG, or MPEG

6.___ encoding is a lossless data compression method.

• Only Huffman
• Only Run-length
• Only LZ
• Huffman, run-length, or LZ

7.In ___ encoding, the more frequently occurring characters have shorter codes than the
less frequently occurring characters.
• Huffman
• run-length
• LZ
• JPEG

8.In ___ encoding, PPPPPPPPPPPPPPP can be replaced by P15.

• Huffman
• run-length
• LZ
• MPEG

9.LZ encoding requires ___.

• only a dictionary
• only a buffer
• only an algorithm
• a dictionary, a buffer, and an algorithm

10.JPEG encoding involves ___, a process that reveals the redundancies in a block.
• blocking
• the discrete cosine transform
• quantization
 • vectorization

11.In JPEG encoding, the ___ process breaks the original picture into smaller blocks and
assigns a value to each pixel in a block.
• blocking
• DCT
• quantization
• vectorization

12.The last step in JPEG, ___, removes redundancies.

• blocking
• quantization
• compression
• vectorization

13.___ is a lossy compression method for pictures and graphics, whereas ___ is a lossy
compression method for video.
• DCT, MPEG
• MPEG, JPEG
• JPEG, MPEG
• JPEG, DCT

14. What is compression?

• To convert one file to another
• To reduce the size of data to save space
• To minimize the time taken for a file to be downloaded
• To compress something by pressing it very hard

15. Which of these terms is a type of data compression?

• resolution
• zipping
• inputting
• caching