Unit 1 Flashcards

1
Q

Two tier client

A

client directly connects to the server for information.

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

N tier client

A

divides application into physical tiers and logical layers; includes 3 or more separate tiers.

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

Thin client

A

The process happens on the server(s).

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

Thick (Fat) client

A

The process happens locally for the client.

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

DB Evolution Timeline

A
  1. flat files hierarchical structure
  2. Relational DB
  3. Object-oriented DB (DEAD)
  4. DB for Social Media
  5. Big Data, NOSQL DB (Cloud Computing)
  6. Data Warehouses
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Operational Data

A

Raw ERP data.

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

Informational Data

A

on-time performance reports.

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

Analytical Data

A

optimization, modeling, and simulation to support business decisions.

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

IaaS

A

Infrastructure as a service.

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

PaaS

A

Platform as a service.

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

SaaS

A

Software as a service.

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

Data

A

Something captured and stored; not information.

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

Information

A

Data processed for insight; the next step after data.

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

Char

A

Stores characters. If data entry doesn’t meet limit, will attach spaces on the end of the string of characters.

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

Varchar

A

Stores a string. If data entry doesn’t meet limit, WILL NOT attach spaces on the end.

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

Nchar, Nvarchar

A

More storage capacity per character than char and varchar. Can contain special characters. Unicode; two bytes per character.

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

Enumerated Data Type

A

Has a list of possible values that are user-defined.

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

Metadata

A

data about data. It defines the structure and properties of a table.

19
Q

Data Dictionary

A

metadata of metadata. Information containing all the column titles and table titles of all tables in a DB.

20
Q

Crows Foot Notation

A

ERD method relating tables to other tables with constraints and cardinality.

21
Q

Chens Notation

A

The other ERD method.

22
Q

Cardinalities

A

one: one, one: many, many: many

23
Q

Constraints

A

atleast one (dash), atleast zero (hole)

24
Q

Entity

A

Table.

25
Q

Instance

A

A single row.

26
Q

Programming variable notations

A

camelCase, PascalCase, underscore_delimited

27
Q

Identifier Attribute

A

Reflects a unique instance and therefore each value is unique; does not contain null values. Bolded.

28
Q

Multivariate Attribute

A

a single entity containing multiple values combined. Ex: {phoneNum} or {emailAddress}.

29
Q

Composite Attribute

A

a single entity containing multiple simple attributes. Ex: Address(Street, City, Zip).

30
Q

Derived Attribute

A

can be calculated from other values. Sometimes not stored until the data is final. Ex: [birthday].

31
Q

Relationship Degree

A

Unary, Binary, Ternary

32
Q

Associative/Bridge Entity

A

Bridges a many-to-many relationships. Usually has a composite or surrogate identifier.

33
Q

Super/subtype entities

A

“IsA” relationship, usually has a discriminator attribute, subtype entities inherit the relationships and attributes of the supertype entities.

34
Q

Discriminator Attribute

A

attribute that categorizes instances in the supertype entity that break down to subtype entities.

35
Q

Does the discriminator need to recognize all possible types of subtypes from the supertype entity?

A

No. However a good discriminator will.

36
Q

Does every instance in the supertype needs to break down to subtype?

A

No.

37
Q

Partial Completeness

A

Every instance in the supertype entity is not sorted into a subtype entity. Some types of instances are not recognized and carried over into a subtype entity.

38
Q

Total Completeness

A

Every instance in the supertype entity is sorted into a subtype entity.

39
Q

Can a ternary entity be classified as associative if only two of the entities that are related to it are related via one-to-many-many-to-one.

A

Yes.

40
Q

DBDLC: Conceptual Design

A

Data Modeling; ERDs

41
Q

DBDLC: Logical Design

A

Normalization; relational modeling

42
Q

DBDLC: Physical Design

A

DB creation with SQL

43
Q

Who made RD model of shared data banks in 1970

A

Edgar Ted Cod