Deck 8: Data Structures and Caatts for Data Extraction
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/81
Play
Full screen (f)
Deck 8: Data Structures and Caatts for Data Extraction
1
The database approach to data management is sometimes called the flat file approach.
False
2
The two fundamental components of data structures are organization and access method.
True
3
Data normalization groups data attributes into tables in accordance with specific design objectives.
True
4
View modeling begins by identifying the primary entities of the business function in question.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
5
The hierarchical database model forces users to navigate between data elements using predefined structured paths.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
6
Generalized audit software packages are used to assist the auditor in performing substantive tests.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
7
An entity is any physical thing about which the organization wishes to capture data.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
8
An ER diagram is a graphical representation of a data model.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
9
The deletion anomaly is the least important of the problems affecting unnormalized databases.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
10
VSAM file structures are most effective where rapid access to individual records is a priority need.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
11
GAS can be used with simple data structures but not complex structures
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
12
A join builds a new table by creating links.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
13
Under the database approach, data is viewed as proprietary or owned by users.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
14
The physical database is an abstract representation of the database.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
15
A customer name and an unpaid balance is an example of a one-to-many relationship.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
16
An advantage of using an indexed random file structure is that records are easily added and deleted.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
17
View integration combines the data needs to all users into a single-entity wide schema.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
18
EAM's allow auditors to identify significant transactions for substantive testing.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
19
In the relational model, a data element is called a relation.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
20
When a large portion of the file is to be processed in one operation such as payroll, sequential data structures are an inefficient method of organizing a file.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
21
In the relational database model all of the following are true except
A) data is presented to users as tables
B) data can be extracted from specified rows from specified tables
C) a new table can be built by joining two tables
D) only one-to-many relationships can be supported
A) data is presented to users as tables
B) data can be extracted from specified rows from specified tables
C) a new table can be built by joining two tables
D) only one-to-many relationships can be supported
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
22
In a hashing structure,
A) two records can be stored at the same address.
B) pointers are used to indicate the location of all records.
C) pointers are used to indicate the location of a record with the same address as another record.
D) all locations on the disk are used for record storage.
A) two records can be stored at the same address.
B) pointers are used to indicate the location of all records.
C) pointers are used to indicate the location of a record with the same address as another record.
D) all locations on the disk are used for record storage.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
23
The update anomaly in unnormalized databases
A) occurs because of data redundancy
B) complicates adding records to the database
C) may result in the loss of important data
D) often results in excessive record insertions
A) occurs because of data redundancy
B) complicates adding records to the database
C) may result in the loss of important data
D) often results in excessive record insertions
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
24
The term occurrence is used to describe the number of attributes or fields pertaining to a specific entity.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
25
Pointers are used
A) to link records within a file.
B) to link records between files.
C) to identify records stored in overflow.
D) all of the above.
A) to link records within a file.
B) to link records between files.
C) to identify records stored in overflow.
D) all of the above.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
26
Pointers can be used for all of the following except
A) to locate the subschema address of the record.
B) to locate the physical address of the record.
C) to locate the relative address of the record.
D) to locate the logical key of the record.
A) to locate the subschema address of the record.
B) to locate the physical address of the record.
C) to locate the relative address of the record.
D) to locate the logical key of the record.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
27
Improperly normalized databases are associated with three types of anomalies: the update anomaly, the insertion anomaly, and the deletion anomaly.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
28
Cardinality describes the number of possible occurrences in one table that are associated with a single occurrence in a related table.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
29
In the relational database model
A) relationships are explicit
B) the user perceives that files are linked using pointers
C) data is represented on two-dimensional tables
D) data is represented as a tree structure
A) relationships are explicit
B) the user perceives that files are linked using pointers
C) data is represented on two-dimensional tables
D) data is represented as a tree structure
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
30
View modeling includes
A) constructing a data model showing entity associations.
B) constructing the physical database.
C) preparing the user views.
D) all of the above.
A) constructing a data model showing entity associations.
B) constructing the physical database.
C) preparing the user views.
D) all of the above.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
31
Database anomalies are symptoms of structural problems within tables called
A) tuples
B) dependencies
C) collisions
D) Attributes
A) tuples
B) dependencies
C) collisions
D) Attributes
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
32
Which characteristic is associated with the database approach to data management?
A) data sharing
B) multiple storage procedures
C) data redundancy
D) excessive storage costs
A) data sharing
B) multiple storage procedures
C) data redundancy
D) excessive storage costs
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
33
It is appropriate to use a sequential file structure when
A) records are routinely inserted.
B) single records need to be retrieved.
C) records need to be scanned using secondary keys.
D) a large portion of the file will be processed in one operation.
A) records are routinely inserted.
B) single records need to be retrieved.
C) records need to be scanned using secondary keys.
D) a large portion of the file will be processed in one operation.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
34
Which statement is not correct? The VSAM structure
A) is used for very large files that need both direct access and batch processing.
B) may use an overflow area for records.
C) provides an exact physical address for each record.
D) is appropriate for files that require few insertions or deletions.
A) is used for very large files that need both direct access and batch processing.
B) may use an overflow area for records.
C) provides an exact physical address for each record.
D) is appropriate for files that require few insertions or deletions.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
35
In a relational database
A) the user's view of the physical database is the same as the physical database
B) users perceive that they are manipulating a single table
C) a virtual table exists in the form of rows and columns of a table stored on the disk
D) a programming language (COBOL) is used to create a user's view of the database
A) the user's view of the physical database is the same as the physical database
B) users perceive that they are manipulating a single table
C) a virtual table exists in the form of rows and columns of a table stored on the disk
D) a programming language (COBOL) is used to create a user's view of the database
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
36
Which statement is true about a hashing structure?
A) The same address could be calculated for two records.
B) Storage space is used efficiently.
C) Records cannot be accessed rapidly.
D) A separate index is required.
A) The same address could be calculated for two records.
B) Storage space is used efficiently.
C) Records cannot be accessed rapidly.
D) A separate index is required.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
37
An inventory record contains part number, part name, part color, and part weight. These individual items are called
A) fields.
B) stored files.
C) bytes.
D) occurrences.
A) fields.
B) stored files.
C) bytes.
D) occurrences.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
38
The most serious problem with unnormalized databases is the
A) update anomaly
B) insertion anomaly
C) deletion anomaly
D) none of the above
A) update anomaly
B) insertion anomaly
C) deletion anomaly
D) none of the above
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
39
A table in third normal form is free of partial dependencies, multiple dependencies, and transitive dependencies.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
40
Which of the following statements is not true?
A) Indexed random files are dispersed throughout the storage device without regard for physical proximity with related records.
B) Indexed random files use disk storage space efficiently.
C) Indexed random files are efficient when processing a large portion of a file at one time.
D) Indexed random files are easy to maintain in terms of adding records.
A) Indexed random files are dispersed throughout the storage device without regard for physical proximity with related records.
B) Indexed random files use disk storage space efficiently.
C) Indexed random files are efficient when processing a large portion of a file at one time.
D) Indexed random files are easy to maintain in terms of adding records.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
41
The deletion anomaly in unnormalized databases
A) is easily detected by users
B) may result in the loss of important data
C) complicates adding records to the database
D) requires the user to perform excessive updates
A) is easily detected by users
B) may result in the loss of important data
C) complicates adding records to the database
D) requires the user to perform excessive updates
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
42
What is the relationship between a database table and a user view?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
43
Which statement is correct?
A) in a normalized database, data about vendors occur in several locations
B) the accountant is responsible for database normalization
C) in a normalized database, deletion of a key record could result in the destruction of the audit trail
D) connections between M:M tables are provided by a link table
A) in a normalized database, data about vendors occur in several locations
B) the accountant is responsible for database normalization
C) in a normalized database, deletion of a key record could result in the destruction of the audit trail
D) connections between M:M tables are provided by a link table
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
44
What are the six phases of view modeling?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
45
Give an advantage and a disadvantage of the sequential data structure
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
46
What are the two fundamental components of data structures?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
47
A transitive dependency
A) is a database condition that is resolved through special monitoring software.
B) is a name given to one of the three anomalies that result from unnormalized database tables.
C) can exist only in a table with a composite primary key.
D) cannot exist in tables that are normalized at the 3NF level.
E) is none of the above.
A) is a database condition that is resolved through special monitoring software.
B) is a name given to one of the three anomalies that result from unnormalized database tables.
C) can exist only in a table with a composite primary key.
D) cannot exist in tables that are normalized at the 3NF level.
E) is none of the above.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
48
What are the three physical components of a VSAM file?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
49
Which of the following is a relational algebra function?
A) restrict
B) project
C) join
D) all are relational algebra functions
A) restrict
B) project
C) join
D) all are relational algebra functions
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
50
A table is in first normal form when it is
A) free of repeating group data
B) free of transitive dependencies
C) free of partial dependencies
D) free of update anomalies
E) none of the above
A) free of repeating group data
B) free of transitive dependencies
C) free of partial dependencies
D) free of update anomalies
E) none of the above
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
51
Comment on the following statement: "Legacy systems use flat file structures."
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
52
A user view
A) presents the physical arrangement of records in a database for a particular user
B) is the logical abstract structure of the database
C) specifies the relationship of data elements in the database
D) defines how a particular user sees the database
A) presents the physical arrangement of records in a database for a particular user
B) is the logical abstract structure of the database
C) specifies the relationship of data elements in the database
D) defines how a particular user sees the database
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
53
Give two limitations of the hierarchical database model?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
54
Which statement is not true? Embedded audit modules
A) can be turned on and off by the auditor.
B) reduce operating efficiency.
C) may lose their viability in an environment where programs are modified frequently.
D) identify transactions to be analyzed using white box tests.
A) can be turned on and off by the auditor.
B) reduce operating efficiency.
C) may lose their viability in an environment where programs are modified frequently.
D) identify transactions to be analyzed using white box tests.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
55
Generalized audit software packages perform all of the following tasks except
A) recalculate data fields
B) compare files and identify differences
C) stratify statistical samples
D) analyze results and form opinions
A) recalculate data fields
B) compare files and identify differences
C) stratify statistical samples
D) analyze results and form opinions
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
56
Each of the following is a relational algebra function except
A) join
B) project
C) link
D) restrict
A) join
B) project
C) link
D) restrict
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
57
A table is in third normal form when it is
A) free of repeating group data
B) free of transitive dependencies
C) free of partial dependencies
D) free of deletion anomalies
E) none of the above
A) free of repeating group data
B) free of transitive dependencies
C) free of partial dependencies
D) free of deletion anomalies
E) none of the above
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
58
Which of the following is not a common form of conceptual database model?
A) hierarchical
B) network
C) sequential
D) relational
A) hierarchical
B) network
C) sequential
D) relational
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
59
Entities are
A) nouns that are depicted by rectangles on an entity relationship diagram
B) data that describe the characteristics of properties of resources
C) associations among elements
D) sets of data needed to make a decision
A) nouns that are depicted by rectangles on an entity relationship diagram
B) data that describe the characteristics of properties of resources
C) associations among elements
D) sets of data needed to make a decision
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
60
A table is in second normal form when it is
A) free of repeating group data
B) free of transitive dependencies
C) free of partial dependencies
D) free of insert anomalies
E) none of the above
A) free of repeating group data
B) free of transitive dependencies
C) free of partial dependencies
D) free of insert anomalies
E) none of the above
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
61
What is a partial dependency?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
62
What is the update anomaly?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
63
Explain the basic results that come from the restrict, project, and join functions.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
64
What is repeating group data?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
65
Give three examples that illustrate how cardinality reflects an organization's underlying business rules.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
66
How does the database approach solve the problem of data redundancy?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
67
What is a transitive dependency?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
68
Explain the purpose of an ER diagram in database design.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
69
Outline some of the key advantages of GAS.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
70
What is a hashing structure? What are the advantage(s) and disadvantage(s) associated with it?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
71
How does the embedded audit module support the auditor?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
72
Explain the three types of anomalies associated with database tables that have not been normalized.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
73
Discuss the two fundamental components of data structures.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
74
Give an example of the insertion anomaly.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
75
What is view integration?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
76
Explain how linkages between relational tables are accomplished.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
77
When is a table in third normal form (3NF)?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
78
How can a poorly designed database result in unintentional loss of critical records?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
79
What are the key control implications of the absence of database normalization?
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck
80
Explain the following three types of pointers: physical address pointer, relative address pointer, and logical key pointer.
Unlock Deck
Unlock for access to all 81 flashcards in this deck.
Unlock Deck
k this deck