CIS 112 Exam 1 Flashcards

1
Q
  • Gets collected
  • Quantitative or Qualitative
  • Can (is for this course) be structured in tidy tables
  • Ex.- grey, truck, right
    Black, suv, left
A

Data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  • Generated
  • Ex.- Beau street is open
A

Information

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

________ is stored in a database

A

Data

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

4 Criteria to store data

A
  1. Representative of Data
  2. Logical/ Internally Consistent
  3. Has a defined purpose
  4. Queryable (Has to be accessible)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

________ are logically/internally consistent!

A

Databases

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

A tool that imposes the 4 criteria on any data we store

A

Database Management System

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

The idea of only storing the minimal amount of data to be truly representative of the data set without being repetitive

A

Data Dependency/ Data Redundancy

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

Splitting large data sets into smaller, connected tables.

A

Data Dependency/ Data Redundancy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  • Open source
  • Stored in one place but multiple interfaces can pull from it
A

Data Independence

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

Accordingly, it provides a basis for a high level data language which will yield maximal independence between programs on the one hand and machine representation and organization of data on the other.

A

Data Independence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
  1. Every column always gets a unique name.
  2. Columns represent attributes.
  3. Rows represent entities.
  4. Every row must be unique and identifiable (index = primary key)
  5. Cells contain atomic data or null pointers.
  6. Attributes must be stored in the same format.
  7. The ordering of rows and columns is unimportant.
A

Codd’s Relational Model Criteria

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

break it into the smallest bit

A

atomic

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

The process of removing redundancies by organizing into a well-organized schema of relations connected by keys which constrain/document the functional dependencies of the data.

A

Normalization

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

a relationship between two sets of attributes in a database, where one set (the determinant) determines the values of the other set (the dependent)

A

Dependency

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

If (A,B) → (C,D,E), and (A) → (D), then (A) → (D) is the _______.

A

partial dependency

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

If (A) → (B) and (B) → ( C ), then (B) → ( C ) is the ________.

A

transitive key

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

Something we declare so we can insure our database is normalized

A

keys

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

The set of columns we need to look at to determine which is which

A

Primary key

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

Two columns we look at

A

Composite key

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

An attribute/primary key that appears in multiple tables to tell us more information

A

Foreign Key

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

A type of structural diagram for use in database design

A

Entity Relationship Diagram

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

Contains different symbols and connectors that visualize two important information:

  • The major entities within the system scope.
  • Inter-relationships among these entities.
A

Entity Relationship Diagram

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

Weak relationships are connected by ________

A

dotted lines

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

A series of connected components which produce information through specific procedures abiding by specific rules.

A

Information system

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

Is a storage component of an information system.

A

Database

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

plan to solve

A

scope

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

what prevents you/constraints

A

boundaries

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

In the middle of System Development Life Cycle (Is a circle with arrows) is _______.

A

Ethics and Users

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

System Development Life Cycle

A
  1. System Definition
  2. Requirements Analysis
  3. Component Design
  4. Implementation
  5. Maintenance
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

User needs assessment

  • Ex.- Who will be using the system and their accessibility to the system
  • What kind of roles will need to be created, trained, hired, etc.,
  • Hardware specifications
A

Requirements Analysis

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q
  • Design/plan for all components AND the way they will work together
  • Prototyping (Ex.- Excel file)
A

Component Design

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

Build, Test, Document

A

Implementation

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

Monitoring the continued usability of the system
- Ex.- Is it meeting my clients needs?

A

Maintenance

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

specifies ’how many’ rows will connect between the tables

A

Cardinality

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

Any attribute or set of attributes which uniquely identify each entity.

A

Candidate Key

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

The developer-chosen candidate key

A

Primary Key

37
Q

Any non-primary candidate key; typically used as an index.

A

Secondary Key

38
Q

A primary key from an external relation.

A

Foreign Key

39
Q

Any key comprised of more than one attribute.

A

Composite Key

40
Q

Documents the entities and the cardinality of their relationships.

A

Conceptual

41
Q

Documents the attributes which establish the formal connection between entities.

A

Logical

42
Q

Documents the way the schema is stored, including attribute data types and constraints.

A

Physical

43
Q

ERD’S will also be __________; key constraints will appear first, then attribute names, then the data type, followed by any non-key constraints. The table name will always appear above the attributes. We will not enforce any particular rounded corners– boxes are an excellent representation for our purposes.

A

standardized

44
Q

an option of two

A

binary

45
Q

the smallest possible unit which can be interpreted

A

bit

46
Q

the smallest common unit which can be addressed
for processing or storage

A

byte

47
Q

A single character (e.g., letter, number, or symbol). Requires 1 byte.

A

CHAR

48
Q

A collection of characters to form a string. Variable size; one byte per character, with a maximum
size typically enforced by the database management system.

A

TEXT

49
Q

A whole number,either positive or negative, which has no digits after a decimal point. Usually
4 bytes, but can be smaller or larger as needed.

A

INTEGER

50
Q
  • A numeric value with ’floating point precision’, meaning that it adjusts the location of the
    decimal point as needed to support the provided precision (P, or the number of significant digits needing to be stored).
  • Minimum of 4 bytes, but can be larger as needed to support the required precision.
    Database Management Systems treat floating-point data as inexact, meaning that sometimes they’ll approximate the value rather than store it explicitly. This can cause errors for some calculations! Other data types, such as MONEY, exist to be exact for cases where slight differences can make substantial impact in analysis
A

FLOAT(P)

51
Q

A binary choice; True or False, Yes or No, On or Off. Requires 1 byte.

A

BOOLEAN

52
Q

The attribute is limited in some way (ex: can never be negative)

A

CHECK

53
Q

The attribute is not permitted to contain a NULL value.

A

NOT NULL

54
Q

The stored value of the attribute may not match any other entity’s value for this attribute.

A

UNIQUE

55
Q

The chosen candidate key of the table; enforces NOT NULL and UNIQUE constraints.

A

PRIMARY KEY

56
Q

A primary key from an existing table; enforces a NOT NULL constraint.

A

FOREIGN KEY

57
Q

Optional connection; at most 1 connecting row:
——O—l—

A

Zero to one

58
Q

Mandatory connection; only 1 connecting row:
—–l–l—

A

Exactly one

59
Q

Optional connection; could be more than one row:
——-o<- ——-

A

Zero to many

60
Q

Mandatory connection; at least one row, but could be more:
———l<- ——-

A

One to many

61
Q

It is vitally important to remember that both ends of every relationship have a _______!

A

foot

62
Q

A _________ will relate data common to a single entity.

A

row (a.k.a. record, tuple, or n-tuple)

63
Q

A ________ will relate data common to a single attribute.

A

column (a.k.a. field or domain)

64
Q

A _____describes the attribute for a given entity

A

cell

65
Q

A __________ will preserve the connections between entities and their attributes

A

table (a.k.a. file or relation)

66
Q

___________ are connections between stored data. In such a case, for every entity there is an attribute or a set of attributes which are dependent on a determining attribute or set of attributes.

A

Functional dependences

67
Q

A minimal set of attributes which can uniquely identify entities in the table.

A

Candidate Key

68
Q

An attribute or set of attributes chosen in the DBMS to uniquely identify entities within the table.

A

Primary Key

69
Q

An attribute or set of attributes which represent the primary key of any table outside of the current table.

A

Foreign Key

70
Q

A set of more than one attribute which act as a key when together, but not when examined alone.

A

Composite Key

71
Q

An attribute or set of attributes which can uniquely identify entities in the table but is instead used in the DBMS to further sort stored data for faster queries.

A

Secondary Key

72
Q

What relationship exists between a candidate key and a functional dependency?

A

Every non-key attribute in a table is functionally dependent on a candidate key.

73
Q

A ________ functional dependency occurs when a functional dependency exists between a subset of the determining attributes and a subset of the dependent attributes.

A

partial

74
Q

A ________ functional dependency occurs when the dependent attribute of a functional dependency is the determining attribute of another.

A

transitive

75
Q

is the process of choosing to allow some redundant data in service of the end-user

A

denormalization

76
Q

Dataset organization follows all criteria of Codd’s Relational Model.

A

First Normal Form (1NF)

77
Q

All transitive functional dependencies have been removed; the determinant of every attribute is the complete primary key of its containing table.

A

Third Normal Form (3NF)

78
Q

All partial functional dependencies have been removed; any attribute dependent on the primary key needs all pieces of the primary key to be determined.

A

Second Normal Form (2NF)

79
Q

A ________ is a collection of relational tables with referential integrity, meaning that the connections between tables are defined by the foreign keys.

A

schema

80
Q

Normalization generally requires taking a single table and creating a schema based on the results. Each time I create a new table in the schema, I will create a _______ key in the new table and leave a copy of it behind as a _________ key.

A

primary; foreign

81
Q

The following string of bits stores a positive INTEGER: 10100111. What is the integer?

A

167

82
Q

Organizing the mechanisms for information flow throughout the system and determining the hardware and software needs of the system.

A

Component Design

83
Q

Building the system; purchasing hardware and software, converting prior systems to the new design, building and testing the components of the system, producing reference materials and documentation, and testing the completed system prior to rollout.

A

Implementation

84
Q

Updating documentation with changes, evaluating the client’s use of the system, performing upgrades to the system infrastructure, and confirming client satisfaction.

A

Maintenance

85
Q

Communicating with the client abound the choice of information system, evaluating existing systems, collecting representative samples, or otherwise investigating the client’s needs.

A

Requirement Analysis

86
Q

Choosing an information system which best suits the scope and boundaries of your client.

A

Definition

87
Q

A ______ is a component in an information system which is responsible for rigidly structuring input data and efficiently producing validated results when queried.

A

database

88
Q

The concept of ______ allows us to construct ERDs that function as blueprints – they have a clear beginning that matches our intuition, and we can follow the “map” of the ERD to ensure that table construction and data manipulation occurs in the proper order to work within our well-constrained database.

A

flow

89
Q

A _____________ relationship is one in which there is an existence-dependent connection to another table; we usually draw this with a dotted line. All other relationships are considered _______ because they do not depend on the existence of a connected row.

A

weak; strong