WGU C175 D426 EXAM WITH COMPLETE SOLUTIONS 100%
VERIFIED 2025-2026!!
Structural Data - ANSWER>> preformat information, like rows and columns
Unstructured Information - ANSWER>> without structure (all text) - cant be 'stored' as
rows and examples include text - email, stickies, buisness card, IMs.
Big DATA - ANSWER>> mix of structured / unstructured huge volume of Data to
process.
Digital Data ANSWER>> made up of strips of binary numbers
Binary relationship - ANSWER>>It is a relationship between two entity types. (simplest
relationship)
Cardinality - ANSWER>>(Means Count) It is the maximum number of entities that can
be involved in a particular relationship ie: one-one, one-many, many-many (Closest to
entity cannot be zero, crows foot)
E-R Model (entity-relationship) - ANSWER>>It is well named, as it diagrams entities
(together with their attributes) and the relationships among them
Intersection data - ANSWER>>A data that describes how many to many relationship.
Modality - ANSWER>>A minimum number of entity occurrences that can be involved in a
relationship. That is the farthest from entity can be zero
One-to-One Binary Relationship - ANSWER>>That single occurrence of one entity type
,can have at most single occurrence of other entity type associated with it and vice
versa.
Data
Data is numeric, textual, visual or audio information that describes real-world systems.
Analog
Historically, data was mostly analog, encoded as continuous variations on various
physical media
Data - ANSWER>>Facts gathered together for analysis
1640-Blaise Pascal - ANSWER>>adding machine similar to odometer
1805-Joseph Marie Jacquard - ANSWER>>punch card for textile weaving patterns
(Loom)
1833-Charles Babbage - ANSWER>>loom records patterns in punch cards
1890-Herman Hollerith - ANSWER>>tabulator/sorter punch cards Amercian
census-ABM
1911-James Powers - ANSWER>>automatic feeders Powers tabulators machine
comp>UNIVAC>UnisysCorp
1930's - ANSWER>>Erasable magnetic tape for storage
1940's - ANSWER>>magnetic drum's begin prototype
,Flat Files - ANSWER>>A file having no internal hierarchy
Hashed Files - ANSWER>>A file that has been encrypted for security purposes
Heap Files - ANSWER>>An unsorted set of records
Information - ANSWER>>The transformation of raw data into useful facts
indexed-sequential file - ANSWER>>an index built over a field
Punch Card - ANSWER>>A card that is perforated and can hold commands or data
Simple Linear Index - ANSWER>>similar in structure to the index in the back of a book.
Ternary relationship - ANSWER>>A relationship involving three different entity types.
Unary relationship - ANSWER>>It is an associate occurrence of an entity type with other
occurrences of the same entity type.
Unique identifier - ANSWER>>It is used to uniquely identify each and every record
present in a database table.
Referential Integrity - ANSWER>>trying to refer data in one relation in the DB, data
staying the same across tables when you insert/update/delete
Attribute - ANSWER>>a property of, a characteristic of, or a fact that we know about
an entity
, B+ tree index - ANSWER>>family tree organizational method better to insert/delete
records.
Every index record, at all levels of the tree, must have the same number of key
value/pointer pairs. The number is arbitrary but it must be identical for every index
record in each level of the index once determined.
Candidate key (alternate key) - ANSWER>>If a relation has more than one attribute or
minimum group of attributes that represents a way of uniquely identifying the entities,
then they are each called a candidate key. unique, non-volatile, minimal. A candidate
key is a candidate to become a primary key.
Composite key - ANSWER>>2 or more attributes are combined 2 columns (ie: flight #
and flight date)
Computer security - ANSWER>>It includes the safeguarding of a physical hardware
environment, safeguarding against hacking attacks, sending data via the network
through encryption, educating employees on how to take care of company data, and
much more.
Concurrency problem - ANSWER>>When two or more users are accessing and trying
to update a specific record at the same time, they risk producing what is known as a
"concurrency problem."
Database index - ANSWER>>Enhances DB query performance. Data structure that
includes a copy of some of the data from one or more already existing DB tables.
Data integration - ANSWER>>The ability to connect related pieces of data within an
information system.
Data redundancy - ANSWER>>The same fact about the business environment is stored
more than once within an information system.
Data retrieval - ANSWER>>It involves the fetching of desired data from a database.
VERIFIED 2025-2026!!
Structural Data - ANSWER>> preformat information, like rows and columns
Unstructured Information - ANSWER>> without structure (all text) - cant be 'stored' as
rows and examples include text - email, stickies, buisness card, IMs.
Big DATA - ANSWER>> mix of structured / unstructured huge volume of Data to
process.
Digital Data ANSWER>> made up of strips of binary numbers
Binary relationship - ANSWER>>It is a relationship between two entity types. (simplest
relationship)
Cardinality - ANSWER>>(Means Count) It is the maximum number of entities that can
be involved in a particular relationship ie: one-one, one-many, many-many (Closest to
entity cannot be zero, crows foot)
E-R Model (entity-relationship) - ANSWER>>It is well named, as it diagrams entities
(together with their attributes) and the relationships among them
Intersection data - ANSWER>>A data that describes how many to many relationship.
Modality - ANSWER>>A minimum number of entity occurrences that can be involved in a
relationship. That is the farthest from entity can be zero
One-to-One Binary Relationship - ANSWER>>That single occurrence of one entity type
,can have at most single occurrence of other entity type associated with it and vice
versa.
Data
Data is numeric, textual, visual or audio information that describes real-world systems.
Analog
Historically, data was mostly analog, encoded as continuous variations on various
physical media
Data - ANSWER>>Facts gathered together for analysis
1640-Blaise Pascal - ANSWER>>adding machine similar to odometer
1805-Joseph Marie Jacquard - ANSWER>>punch card for textile weaving patterns
(Loom)
1833-Charles Babbage - ANSWER>>loom records patterns in punch cards
1890-Herman Hollerith - ANSWER>>tabulator/sorter punch cards Amercian
census-ABM
1911-James Powers - ANSWER>>automatic feeders Powers tabulators machine
comp>UNIVAC>UnisysCorp
1930's - ANSWER>>Erasable magnetic tape for storage
1940's - ANSWER>>magnetic drum's begin prototype
,Flat Files - ANSWER>>A file having no internal hierarchy
Hashed Files - ANSWER>>A file that has been encrypted for security purposes
Heap Files - ANSWER>>An unsorted set of records
Information - ANSWER>>The transformation of raw data into useful facts
indexed-sequential file - ANSWER>>an index built over a field
Punch Card - ANSWER>>A card that is perforated and can hold commands or data
Simple Linear Index - ANSWER>>similar in structure to the index in the back of a book.
Ternary relationship - ANSWER>>A relationship involving three different entity types.
Unary relationship - ANSWER>>It is an associate occurrence of an entity type with other
occurrences of the same entity type.
Unique identifier - ANSWER>>It is used to uniquely identify each and every record
present in a database table.
Referential Integrity - ANSWER>>trying to refer data in one relation in the DB, data
staying the same across tables when you insert/update/delete
Attribute - ANSWER>>a property of, a characteristic of, or a fact that we know about
an entity
, B+ tree index - ANSWER>>family tree organizational method better to insert/delete
records.
Every index record, at all levels of the tree, must have the same number of key
value/pointer pairs. The number is arbitrary but it must be identical for every index
record in each level of the index once determined.
Candidate key (alternate key) - ANSWER>>If a relation has more than one attribute or
minimum group of attributes that represents a way of uniquely identifying the entities,
then they are each called a candidate key. unique, non-volatile, minimal. A candidate
key is a candidate to become a primary key.
Composite key - ANSWER>>2 or more attributes are combined 2 columns (ie: flight #
and flight date)
Computer security - ANSWER>>It includes the safeguarding of a physical hardware
environment, safeguarding against hacking attacks, sending data via the network
through encryption, educating employees on how to take care of company data, and
much more.
Concurrency problem - ANSWER>>When two or more users are accessing and trying
to update a specific record at the same time, they risk producing what is known as a
"concurrency problem."
Database index - ANSWER>>Enhances DB query performance. Data structure that
includes a copy of some of the data from one or more already existing DB tables.
Data integration - ANSWER>>The ability to connect related pieces of data within an
information system.
Data redundancy - ANSWER>>The same fact about the business environment is stored
more than once within an information system.
Data retrieval - ANSWER>>It involves the fetching of desired data from a database.
