1st 10

Question 1

Worst-case time is important for

Answer 1

real time algorithms

Question 2

is the physical implementation of an ADT.
Each operation associated with the ADT is implemented by one or more subroutines in the implementation.

Answer 2

Data Structure

Question 3

usually refers to an organization for data in main memory.

Answer 3

Data Structures

Question 4

an organization for data on peripheral storage, such as a disk drive.

Answer 4

File structure

Question 5

a definition for a data type solely in terms of a set of values and a set of operations on that data type.

Each ADT operation is defined by its blank and blank

Answer 5

Abstract Data type (ADT)

inputs and outputs.

Question 6

An ADT manages complexity through

Answer 6

abstraction/metaphor or in other terms:
Hierarchies of labels

Ex: transistors then gates then CPU.

Question 7

Data items have both a

blank is the definition of the data item within an ADT.
Ex: Integers in the mathematical sense: +, -, dibide, multiply

implementation of the data item within a data structure.
Ex: 16/32 bit integers, overflow.

Answer 7

logical and a physical form.

logical

physical form.

Question 8

The data items of ADT and Data structure are?

Answer 8

Logical form and Physical form

Question 9

As n grows, how does T(n) grow?

Answer 9

Cost: T(n) = c1n^2+ c^2 steps

Question 10

The best case for my algorithm is n=1 because that is the fastest.” WRONG!

Big-oh refers to a growth rate as blank grows to infinity

Best case is defined for the input of size n that is cheapest among all inputs of size n.

Answer 10

n to infinity