procedural query language
nonprocedural query language
scan(), write()
none of the above
B. nonprocedural query language
Attributes
Weak entity set
Relationship sets
Multi-valued attributes
select all from tablename
select * from tablename
select from tablename
none of these
Foreign key
Secondary key
Primary key
Alternate key
active rules
passive rules
inferences
none of the above
users.
separate files.
database.
database administrator.
VDL and DDL.
DDL and DML.
SDL and DDL.
VDL and DML.
Data
Data field
DBMS
DBASE
User data
Database structure data
Sorted data
Functional data
Groups
Table
Attributes
Switchboards
Transitive dependency
Partial transitive dependency
Functional dependency
Partial functional dependency
i and ii only
ii and iii only
ii only
i only
1
2
3
4
TO clause
FROM clause
RANGE clause
none of the above
strong entity set.
weak entity set.
simple entity set.
primary entity set.
i, ii only
ii and iv only
ii and iv only
i, iv only
Lost Update
Uncommitted Dependency
Inconsistent Data
All of the above
smaller number of tables
higher query processing efficiency
reduced I/O for most queries
reduced data redundancy
Graph.
List.
Links.
Tree.
procedural query language
nonprocedural query language
scan(), write()
none of the above
SQL permits attribute names to be repeated in the same relation.
a SQL query automatically eliminates duplicates.
a SQL query will not work if there are no indexes on the relations
None of these
values.
distinct values.
groups.
columns.
Attributes
Multi-valued attributes
Weak entity set
Relationship sets
two
three
four
none
i and ii only
ii and iii only
i and iii only
None of these
The data dictionary is normally maintained by the database administrator.
Data elements in the database can be modified by changing the data dictionary.
The data dictionary contains the name and description of each data element.
The data dictionary is a tool used exclusively by the database administrator.
Data Definition Language.
Data Manipulation Language
Procedural query Language
None of the above
BCNF is stronger than 3NF
Relational algebra is a non-procedural language
Every conflict serializable schedule is view serializable.
none of the above
View
Cursor defination
Referential intergrity
Trigger
Backup
Recovery
Grant
Troubleshooting
Thermal
Intermodulation
Cross talk
Impulse