intro Flashcards

(26 cards)

1
Q

Originally a latin word
 Meaning: given things

A

Data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

is a named entity that can be stored and manipulated using
computer. A group of data items are required to solve practical
problems”

A

Data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Look for a particular data or group of data

A

(Searching)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Insert some new data

A

(Insertion)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Delete (some elements may be obsolete or useless)

A

deletion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Change the order of the stored data

A

(sorting)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

are the information gathered to
express knowledge about a world or an environment.

A

Data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

They are manipulated by __________ to discuss, explain, and calculate
things about this environment.

A

operations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

An ____________________ is a model or description of a type
of data. It identifies the components and properties of a type of
data, as well as the operations performed on the data of this type.

A

abstract data type (ADT)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

An ADT undergoes three stages:

A
  • Specification
  • Representation
  • Implementation
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

“This is the identification of the data’s
components, properties,relationships among its components , and
the operations performed on the data in a problem. Specification
only identifies what are involved in the problem and not how to
solve the problem. It is machine-independent and programming
language-independent.”

A

Specification

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

“This is a design on how to store instances of
the ADT. This design aims to show relationships among the
components of the data in storage. The result is called a ________. This design often uses or builds upon primitive data
types or predefined data structures available in a programming
environment.”

A

data structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

“This is a procedural description on how each
operation is carried out using the data structure. Each procedural
description is an algorithm. Algorithms can be written using
pseudocode or a specific programming language.”

A

Implementation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

“A ________is a way to represent the relationship among
different data items appearing in a group along with the
operations which can be performed on that group”

A

data structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Data Structure = _____________

A

Related Data + Allowed operations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

“In the most general sense, a _________ is any data
representation and its associated operations”

A

data structure

17
Q

“A ______________ means that there is just one starting
element and one ending element, and one can go directly from
starting element to ending element in the data.”

A

linear relationship

18
Q

“A ______________ provides many paths form starting
element to the ending element. There may be more than one
ending elements also.”

A

nonlinear relationship

19
Q

Also called visiting, means accessing record exactly.

20
Q

“An ________ is clearly a specified set of simple instructions to be followed to solve a
problem.”

21
Q

ombining two sorted file to form a single sorted file.

22
Q

 Algorithm can be specified in these forms:

A
  1. English
  2. As a programming language
  3. As a pseudo-code
23
Q

“________ is defined as the process of determining a
formula for prediction of how much memory space is required to
execute an algorithm ”

A

Space complexity

24
Q

“__________ is defined as the process of determining a
formula for total time required to execute that algorithm”

A

Time complexity

25
“_____________________ are used to make meaningful statements about the efficiency of algorithms.”
Asymptotic notations
26
 “______________ is a function of the amount of input data (input size or problem size) of the algorithm“  ”...measures how much resource is required for execution of the algorithm”
Complexity