Chapter 1

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

Leibnitz
von Neumann
Pascal
Charles Babbage

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

ALU
input/output
memory
control unit

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

ALU
input/output
memory
control unit

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

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

ALU
input/output
memory
control unit

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

only data
only programs
data and programs
neither data nor programs

A step-by-step solution to a problem is called _______.

hardware
an operating system
a computer language
an algorithm

FORTRAN and COBOL are examples of _______.

hardware
operating systems
computer languages
algorithms

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

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

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

Software engineering
Hardware engineering
Algorithm development
Instructional architecture
The first electronic special-purpose computer was called _______.
Pascal
Pascaline
ABC
ENIAC

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

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

_______ separated the programming task from computer operation tasks.

Algorithms
Data processors
High-level programming languages
Operating systems

Chapter 2
The base of the decimal number system is ____.
2
8
10
16
The base of the binary number system is ____.
2
8
10
16

The base of the octal number system is ____.

2
8
10
16

The base of the hexadecimal number system is ____.

2
8
10
16

When converting a decimal integer to base b, we repeatedly _____ b.

Divide by
Multiply by
Add to
Subtract from

When converting a decimal fraction to base b, we repeatedly ____b.

Divide by
Multiply by
Add to
Subtract from

Which of the following representations is erroneous?

(10111)2
(349)8
(3AB)16
256

Which of the following representations is erroneous?

(10211)2
(342)8
(EEE)16
145

Which of the following representations is erroneous?

(111)2
(346)8
(EEG)16
221

Which of the following representations is erroneous?

(110)2
(141)8
(EF)16
22A

Which of the following is equivalent to 12 in decimal?

(1110)2
(C)16
(15)8
None of the above

Which of the following is equivalent to 24 in decimal?

(11000)2
(1A)16
(31)8
None of the above
 Chapter 3
A byte consists of _______ bits.
2
4
8
16

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

How many symbols can be represented by a bit pattern with ten bits?
128
256
512
1024

If the ASCII code for E is 1000101, then the ASCII code for e is _______. Answer the question without consulting
the ASCII table.
1000110
1000111
0000110
1100101

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

ANSI
Unicode
EBCDIC
Extended ASCII
 An image can be represented in a computer using the _______ method.
bitmap graphic only
vector graphic only
Excess system only
either bitmap or vector graphic

In the _______ graphic method of representing an image in a computer, each pixel is assigned a bit patterns.
bitmap
vector
quantized
binary

In the _______ graphic method of representing an image in a computer, the image is decomposed into a
combination of geometrical figures.
bitmap
vector
quantized
binary

In the _______ graphic method of representing an image in a computer, re-scaling of the image creates a ragged or
grainy image.
bitmap
vector
quantized
binary

When we want to store music in a computer, the audio signal must be _______.
Sampled only
quantized only
coded only
sampled, quantized, and coded

A floating-point value after normalization is (1.0101) ´ 2-4.

What is the value of exponent section in the Excess-127 representation?
4
-4
127
123

Assume a new Excess system uses 17 bits to represent the exponent section. What is he bias value in this system?
17
16
65535
65536

Which number representation method is often used to store the exponential value of a fractional part?
unsigned integers
two’s complement
Excess
ten’s complement

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

add the bias number to
subtract
the bias number from
multiply the bias number by
divide
the bias number by

The precision of the fractional part of a number stored in a computer is defined by the _______.
sign
exponent
mantissa
last digit
 The combination of sign and mantissa of a real number in IEEE standard floating point format is stored as an
integer in the ____________ representation.
unsigned
sign-and-magnitude
two’s complement
one’s complement

chapter 4
_______ is an arithmetic operation.
The exclusive OR
The unary NOT
Subtraction
The binary AND

_______ is a logical bit operator.

The exclusive OR
The unary NOT
The binary AND
exclusive OR, unary NOT, or binary AND

The _______ method of integer representation is the most common method for storing integers in computer
memory.
sign-and-magnitude
one’s complement
two’s complement
unsigned integers

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

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

In two’s complement representation with a 4-bit allocation, we get _______ when we add 1 to 7.
8
1
-7
-8

In two’s complement representation with a 4-bit allocation, we get _______ when we add 5 to 5.
-5
-6
-7
10

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

6
7
8
9

If we are adding two numbers, one of which has an exponent value of 7 and the other an exponent value of 9, we
need to shift the decimal point of the smaller number _______.
one place to the left
one place to the right
two places to the left
two places to the right

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

Only AND
Only OR
Only XOR
AND, OR, or XOR

The unary _______ operator inverts its single input.

AND
OR
NOT
XOR

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

In only AND
In only OR
In only XOR
In AND, OR, or XOR

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

In only AND
In only OR
In only XOR
In AND, OR, or XOR

For the binary AND operation, only an input of _______ gives an output of 1.
two 0s
two 1s
one 0 and one 1
two 2s
 For the binary OR operation, only an input of _______ gives an output of 0.
two 0s
two 1s
one 0 and one 1
two 2s

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

mask
carry
float
byte

To flip all the bits of a bit pattern, make a mask of all 1s and then _______ the bit pattern and the mask.
AND
OR
XOR
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.
AND
OR
XOR
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.
AND
OR
XOR
NOT
Chapter 5
The _______ is a computer subsystem that performs operations on data.
CPU
memory
I/O hardware
bus subsystem

_______ is a stand-alone storage location that holds data temporarily.

An ALU
A register
A control unit
A tape drive

_______ is a unit that can add two inputs.

An ALU
A register
A control unit
A tape drive

A register in a CPU can hold _______.

only data
only instructions
only program counter values
data, instruction, or program counter values

A control unit with five wires can define up to _______ operations.

5
10
16
32

A word can be _______ bits.

only 8
 only 16
only 32
8, or 16, or 32

If the memory address space is 16 MB and the word size is 8 bits, then _______ bits are needed to access each
word.
8
16
24
32

The data in _______ is erased if the computer is powered down.

RAM
ROM
a tape drive
a CD-ROM

_______ is a memory type with capacitors that need to be refreshed periodically.

SRAM
DRAM
ROM
CROM

_______ is a memory type with traditional flip-flop gates to hold data.

SRAM
DRAM
ROM
CROM

There are _______ bytes in 16 Terabytes.

216
240
244
256

_______ can be programmed and erased using electronic impulses but can remain in a computer during erasure.
ROM
PROM
EPROM
EEPROM

_______ is a type of memory in which the user, not the manufacturer, stores programs that cannot be overwritten.
ROM
PROM
EPROM
EEPROM

Main memory in a computer usually consists of large amounts of ______ speed memory.
high
medium
low
very high speed

A _______ is a storage device to which the user can write information only once.
CD-ROM
CD-R
CD-RW
CD-RR

A _______ is a storage device that can undergo multiple writes and erasures.
CD-ROM
CD-R
CD-RW
CD-RR

The smallest storage area on a magnetic disk that can be accessed at one time is a _______.
 track
sector
frame
head

If the memory has 232 words, the address bus needs to have _______ wires.
8
16
32
64

A control bus with eight wires can define _______ operations.

8
16
256
512

A _______ controller is a high-speed serial interface that transfers data in packets.

SCSI
USB
FireWire
USB and FireWire

The three steps in the running of a program on a computer are performed in the specific order _______.
fetch, execute, and decode
decode, execute, and fetch
fetch, decode, and execute
decode, fetch, and execute

In the _______ method for synchronizing the operation of the CPU with an I/O device, the I/O device informs the
CPU when it is ready for data transfer.
programmed I/O
interrupt-driven I/O
 DMA
isolated I/O

In the _______ method for synchronizing the operation of the CPU with an I/O device, the CPU is idle until the
I/O operation is finished.
programmed I/O
interrupt-driven I/O
DMA
isolated I/O

In the _______ method for synchronizing the operation of the CPU with an I/O device, a large block of data can be
passed from an I/O device to memory directly.
programmed I/O
interrupt-driven I/O
DMA
isolated I/O

chapter 6
The TCP/IP model has _______ layers.
five
six
seven
eight

The _______ layer of the TCP/IP protocol suite provides services for end users.
data-link
transport
application
physical

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-to-destination 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

Chpter 7
_______ 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

chapter 8
_______ 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

Chapter 9
The only language understood by computer hardware is a _______ language.
machine
symbolic
high-level
natural

C, C++, and Java can be classified as _______ languages.

machine
symbolic
high-level
natural

FORTRAN is a(n) _______ language.

procedural
functional
declarative
object-oriented

Pascal is a(n) _______ language.

procedural
functional
declarative
object-oriented

Java is a(n) _______ language.

procedural
functional
declarative
object-oriented

LISP is a(n) _______ language.

procedural
functional
declarative
object-oriented
_______ is a common language in the business -environment.
FORTRAN
C++
C
COBOL

_______ is a popular object-oriented language.

FORTRAN
COBOL
Java
LISP

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

FORTRAN
C++
C
Java

LISP and Scheme are both _______ languages.

procedural
functional
declarative
object-oriented

Prolog is an example of a(n) _______ language.

procedural
functional
declarative
object-oriented

chapter 10
One phase in system development is _______.
analysis
application
designing
collecting

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

In the system development process, writing the program is part of the _______ phase.
analysis
design
implementation
testing

In the system development process, structure charts are tools used in the _______ phase.
analysis
design
implementation
testing

Testing a software system can involve _______ testing.

black-box
glass-box
neither black-box nor glass-box
both black-box and glass-box

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

Coupling
Incrementing
Obsolescence
Modularization

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

_________between modules in a software system must be minimized.

Coupling
Cohesion
Neither coupling nor cohesion
Both coupling and cohesion

_________between modules in a software system must be maximized.

Coupling
Cohesion
Neither coupling nor cohesion
Both coupling and cohesion

Chapter 11
A data structure can be _______.
only an array
only a record
only a linked list
an array, a record, or a linked list

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

one-dimensional
two-dimensional
three-dimensional
multidimensional

Each element in a record is called _______.

a variable
an index
a field
a node

All the members of a record must be _______.

the same type
related types
integer type
character type

_______ 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

In a linked list, each element contains _______.

only data
only a link
neither data nor a link
data and a link

The _______ is a pointer that identifies the next element in the linked list.
link
node
array
data

Given a linked list called children, the pointer variable children identifies ________ element of the linked list.
the first
the second
the last
any

An empty linked list consists of _______.

a node
two nodes
data and a link
a null head pointer

To traverse a list, you need a _______ pointer.

null
walking
beginning
insertion

chapter 12
In an abstract data type, _______.
the ADT implementation is known
the ADT implementation is hidden
the ADT public operations are hidden
Nothing is hidden

A stack is a _________ structure.

FIFO
LIFO
DIFO
SIFO

A(n) _______ list is also known as a queue.

LIFO
 FIFO
unordered
ordered

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

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

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

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

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

more than
less than
at most
at least

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

In _______ traversal of a binary tree, the right subtree is processed last.

preorder
inorder
postorder
any order

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

first
second
last
after the left subtree

In postorder traversal of a binary tree, the left subtree is processed _______.

first
second
last
after the right subtree

In _______ traversal of a binary tree, the left subtree is processed last.

preorder
inorder
postorder
out of order
In an inorder traversal of a binary tree, the root is processed _______.
first
second
last
two times

chapter 13
_______ file can be accessed randomly.
A sequential
An indexed
A hashed
Any

_______ file can be accessed sequentially.

A sequential
An indexed
A hashed
No

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

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
When a sequential file is updated, the ______ file contains the changes to be applied.
new master
old master
transaction
error report

After a sequential file is updated, the _______ file contains the most current data.
new master
old master
transaction
error report

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

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

An indexed file consists of _______.

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

The index of an indexed file has _______ fields.

two
three
 four
any number of

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

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

In the _______ hashing method, there are no synonyms or collisions.

direct
modulo division
division remainder
digit extraction

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

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
 The address produced by a hashing algorithm is the _______ address.
probe
synonym
collision
home

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

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

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

In a three-level DBMS architecture, the _______ level determines where data is actually stored on the storage
devices.
external
conceptual
internal
physical
The _______ level of a three-level DBMS architecture defines the logical view of the data.
external
conceptual
internal
physical

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

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

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

Each column in a relation is called _______.

an attribute
a tuple
a union
an attitude

Each row in a relation is called _______.

an attribute
a tuple
a union
an attitude

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

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

The unary _______ operation always results in a relation that has exactly one more row than the original relation.
insert
delete
update
select

If you want to change the value of an attribute of a tuple, you use the _______ operation.
project
join
update
select

The operation that takes two relations and combines them based on common attributes is the _________ operation.
join
project
union
intersection
 If you need to delete an attribute in a relation, you can use the _______ operation.
join
project
union
intersection

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

Which of the following is a unary operator?

intersection
union
join
project

Which of the following is a binary operator?

select
update
difference
all of the above

_______ is a declarative language used on relational databases.

PDQ
SQL
LES
PBJ
Chapter 16
Three security goals are _____.
confidentiality, cryptography, and nonrepudiation
confidentiality, encryption, and decryption
confidentiality, integrity, and availability
confidentiality, denial of service, and masquerading

Which of the following attacks is threatening integrity?

Masquerading
Traffic Analysis
Denial of service
Encoding

Which of the following attacks is threatening availability?

Replaying
Modification
Denial of service
Decoding

_____________ means concealing the contents of a message by enciphering.

Steganography
Cryptography
Compressing
Authentication

______________means concealing the message by covering it with something else.

Cryptography
Steganography
Compressing
Authentication

In __________cryptography, the same key is used by the sender and the receiver.
symmetric-key
asymmetric-key
public-key
open-key

In _________ cryptography, the same key is used in both directions.

symmetric-key
asymmetric-key
public-key
open-key

_________ cryptography is often used for long messages.

Symmetric-key
Asymmetric-key
Public-key
Open-key

___________ cryptography is often used for short messages.

Symmetric-key
Asymmetric-key
Secret-key
Open-key

__________means that the sender and the receiver expect confidentiality.

Nonrepudiation
Integrity
Authentication
encryption and decryption

___________ means that the data must arrive at the receiver exactly as they were sent.
Nonrepudiation
Message integrity
Authentication
Secrecy
______________ can provide authentication, integrity, and nonrepudiation for a message.
Encryption/decryption
Digital signature
Compression
Key-exchange

In ___________, the identity of a party is verified once for the entire duration of system access.
entity authentication
message integrity
message authentication
message encryption

In __________ cryptography, everyone has access to everyone’s public key.

symmetric-key
asymmetric-key
secret-key
private-key

In the asymmetric-key method used for confidentiality, which key(s) is (are) publicly known?
encryption key only
decryption key only
both encryption and decryption keys
neither encryption key nor decryption key

The RSA algorithm for confidentiality uses _______ cryptography.

asymmetric-key
symmetric-key
substitution
transposition
 In RSA, if user A wants to send an encrypted message to user B, the plaintext is encrypted with the public key of
_______.
user A
user B
the network
a third party.

Chapter 20
The ethical principle that measures the consequences of an act is referred to as ____________.
moral rules
utilization
social contract
none of the above

The ethical principle that dictates that a decision should be made according to the universally accepted principles
of morality is referred to as _________.
moral rules
utilization
social contract
none of the above

The ethical principle that dictates that an act is ethical when a major-ity of people in society agrees with it is
referred to as ______.
moral rules
utilization
social contract
none of the above

Which of the following is considered an intellectual property?

a trademark
a trade secret
a patent
all of the above
A company's product or service is identified as a __________.
trade mark
trade secret
patent
copyright

A right to a written or created work is referred to as .

trade mark
trade secret
patent
copyright

Information about a product is that is kept secret by the owner is referred to as a__________.
trade mark
trade secret
patent
copyright

A right to a monopoly to use a piece of intellectual property is referred to as ________.

trade mark
trade secret
patent
copyright

The attack that reduces the capability of a computer is called a

________ attack.
penetration
denial of service
either a or b
neither a nor b

Sending a virus to a computer is called an ________ attack.

penetration
denial of service
either a or b
neither a nor b