Fill This Form To Receive Instant Help
Homework answers / question archive / Utah State University ACCT 610 Chapter 9-Database Management Systems TRUE/FALSE 1)The database approach to data management is sometimes called the flat file approach
Utah State University
ACCT 610
Chapter 9-Database Management Systems
TRUE/FALSE
1)The database approach to data management is sometimes called the flat file approach.
a. |
data deletion |
b. |
data storage |
c. |
data attribution |
d. |
data retrieval |
a. |
data deletion |
b. |
data storage |
c. |
data attribution |
d. |
data retrieval |
a. |
data redundancy |
b. |
restricting access to data to the primary user |
c. |
data storage |
d. |
currency of information |
a. |
data sharing |
b. |
multiple storage procedures |
c. |
data redundancy |
d. |
excessive storage costs |
a. |
the ability to process data without the help of a programmer |
b. |
the ability to control access to the data |
c. |
constant production of backups |
d. |
the inability to determine what data is available |
a. |
the Database Management System |
b. |
the Database Administrator |
c. |
the physical database |
d. |
the conceptual database |
a. |
provide an interface between the users and the physical database |
b. |
provide security against a natural disaster |
c. |
ensure that the internal schema and external schema are consistent |
d. |
authorize access to portions of the database |
a. |
the internal view |
b. |
the conceptual view |
c. |
the subschema |
d. |
the external view |
a. |
the schema |
b. |
the internal view |
c. |
the user view |
d. |
the conceptual view |
a. |
by direct query |
b. |
by developing operating software |
c. |
by constantly interacting with systems programmers |
d. |
all of the above |
a. |
identifies, for the Database Management System, the names and relationships of all data elements, records, and files that comprise the database |
b. |
inserts database commands into application programs to enable standard programs to interact with and manipulate the database |
c. |
permits users to process data in the database without the need for conventional programs |
d. |
describes every data element in the database |
a. |
defines the database to the Database Management System |
b. |
transfers data to the buffer area for manipulation |
c. |
enables application programs to interact with and manipulate the database |
d. |
describes every data element in the database |
a. |
is written in a fourth-generation language |
b. |
requires user familiarity with COBOL |
c. |
allows users to retrieve and modify data |
d. |
reduces reliance on programmers |
a. |
to develop and maintain the Data Dictionary |
b. |
to implement security controls |
c. |
to design application programs |
d. |
to design the subschema |
a. |
links between related records are implicit |
b. |
the way to access data is by following a predefined data path |
c. |
an owner (parent) record may own just one member (child) record |
d. |
a member (child) record may have more than one owner (parent) |
a. |
tuple |
b. |
attribute |
c. |
collision |
d. |
relation |
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. |
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. |
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. |
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. |
update anomaly |
b. |
insertion anomaly |
c. |
deletion anomaly |
d. |
none of the above |
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. |
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 is provided by a link table |
a. |
hierarchical |
b. |
network |
c. |
sequential |
d. |
relational |
a. |
restrict |
b. |
project |
c. |
join |
d. |
all are relational algebra functions |
a. |
The DBMS is special software that is programmed to know which data elements each user is authorized to access. |
b. |
User programs send requests for data to the DBMS. |
c. |
During processing, the DBMS periodically makes backup copies of the physical database. |
d. |
The DBMS does not control access to the database. |
a. |
query language |
b. |
data access language |
c. |
data manipulation language |
d. |
data definition language |
a. |
user view |
b. |
schema |
c. |
internal view |
d. |
all are levels or views of the database |
a. |
partitioned database |
b. |
centralized database |
c. |
networked database |
d. |
all are examples of distributed databases |
a. |
partitioning the database |
b. |
using a lockout procedure |
c. |
replicating the database |
d. |
implementing concurrency controls |
a. |
data redundancy |
b. |
data replication |
c. |
data lockout |
d. |
none of the above |
a. |
user control is enhanced |
b. |
data transmission volume is increased |
c. |
response time is improved |
d. |
risk of destruction of entire database is reduced |
a. |
there is minimal data sharing among information processing units |
b. |
there exists a high degree of data sharing and no primary user |
c. |
there is no risk of the deadlock phenomenon |
d. |
most data sharing consists of read-write transactions |
a. |
deadlock control |
b. |
replication control |
c. |
concurrency control |
d. |
gateway control |
a. |
is a security issue in partitioned databases |
b. |
is implemented using timestamping |
c. |
may result in data lockout |
d. |
occurs when a deadlock is triggered |
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. |
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. |
increased user control by having the data stored locally |
b. |
deadlocks are eliminated |
c. |
transaction processing response time is improved |
d. |
partitioning can reduce losses in case of disaster |
a. |
join |
b. |
project |
c. |
link |
d. |
restrict |
Use the following words to complete the sentences.
Database Administrator |
Data Dictionary |
data redundancy |
Index Sequential Access Method |
query language |
schema |
sequential structure |
subschema |