McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Computer Science SY (BSc CS) , Bachelor of Science in Information Technology SY (BSc IT) , Bachelor of Computer Applications (BCA) .
Chapters
| 1051. |
The related and interconnected software components of a DBMS are described by the _______: |
| A. | Logical architecture |
| B. | Physical architecture |
| C. | Both |
| D. | None |
| Answer» C. Both | |
| 1052. |
Which are the types of physical DBMS architecture can be split : |
| A. | Back end |
| B. | Front end |
| C. | Both |
| D. | None |
| Answer» C. Both | |
| 1053. |
The DML is called: |
| A. | Sublanguages |
| B. | Host languages |
| C. | VDL |
| D. | DDL |
| Answer» A. Sublanguages | |
| 1054. |
The overall description of a database is called______: |
| A. | Data definition |
| B. | Data manipulation |
| C. | Data integrity |
| D. | Database schema |
| Answer» D. Database schema | |
| 1055. |
Which is proper subset designed to support ‘views’ belonging to different classes of users in order to hid or protect information: |
| A. | Schema |
| B. | Subschema |
| C. | Non-schema |
| D. | None-subschema |
| Answer» B. Subschema | |
| 1056. |
A data dictionary is a repository that manages _____: |
| A. | Database |
| B. | Memory |
| C. | Metadata |
| D. | All of these |
| Answer» C. Metadata | |
| 1057. |
A tuple is a(n): |
| A. | column of a table |
| B. | two dimensional table |
| C. | row of a table |
| D. | key of a table |
| Answer» C. row of a table | |
| 1058. |
An attribute is a(n): |
| A. | two dimensional table |
| B. | row of a table |
| C. | key of a table |
| D. | column of a table |
| Answer» D. column of a table | |
| 1059. |
The method of access which uses key transformation is known as |
| A. | Direct |
| B. | Hashing |
| C. | Random |
| D. | Sequential |
| Answer» B. Hashing | |
| 1060. |
The statement in SQL which allows to change the definition of a table is |
| A. | Create |
| B. | Alter |
| C. | Select |
| D. | Update |
| Answer» B. Alter | |
| 1061. |
This is not a date type in SQL Server 2000 |
| A. | Char |
| B. | String |
| C. | Bigint |
| D. | Decimal |
| Answer» B. String | |
| 1062. |
Which of the following is NOT a basic element of all versions of the E-R model? |
| A. | Entities |
| B. | Relationships |
| C. | Attributes |
| D. | Primary key |
| Answer» D. Primary key | |
| 1063. |
The SQL command to creating a table is: |
| A. | Make table |
| B. | Alter table |
| C. | Create table |
| D. | Define table |
| Answer» C. Create table | |
| 1064. |
----------- is a virtual table |
| A. | Stored procedure |
| B. | View |
| C. | Table |
| D. | Rules |
| Answer» B. View | |
| 1065. |
The DROP TABLE statement: |
| A. | Deletes the table structure only |
| B. | Deletes the table structure along with the table data |
| C. | works whether or not referential integrity constraints would be violated |
| D. | is not an SQL statement |
| Answer» B. Deletes the table structure along with the table data | |
| 1066. |
The SQL statement to create a view is: |
| A. | CREATE VIEW |
| B. | MAKE VIEW |
| C. | SELECT VIEW |
| D. | INSERT VIEW |
| Answer» A. CREATE VIEW | |
| 1067. |
Which of the following is NOT a type of SQL constraint? |
| A. | PRIMARY KEY |
| B. | FOREIGN KEY |
| C. | ALTERNATE KEY |
| D. | UNIQUE |
| Answer» C. ALTERNATE KEY | |
| 1068. |
The following are functions of a DBMS except ________ |
| A. | creating and processing forms |
| B. | processing data |
| C. | creating databases |
| D. | administrating databases |
| Answer» A. creating and processing forms | |
| 1069. |
What SQL structure is used to limit column values of a table? |
| A. | The LIMIT constraint |
| B. | The CHECK constraint |
| C. | The VALUE constraint |
| D. | None of the above is correct. |
| Answer» B. The CHECK constraint | |
| 1070. |
Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that: |
| A. | A → B |
| B. | A → C |
| C. | A → (B, C). |
| D. | (B,C) → A. |
| Answer» A. A → B | |
| 1071. |
The different classes of relations created by the technique for preventing modification anomalies are called: |
| A. | Normal forms. |
| B. | Referential integrity constraints. |
| C. | Functional dependencies. |
| D. | None of the above |
| Answer» A. Normal forms. | |
| 1072. |
A relation is in this form if it is in BCNF and has no multivalued dependencies: |
| A. | Second normal form. |
| B. | Third normal form |
| C. | Fourth normal form. |
| D. | Domain/key normal form. |
| Answer» C. Fourth normal form. | |
| 1073. |
Row is synonymous with the term: |
| A. | Record |
| B. | Column |
| C. | Field |
| D. | Relation |
| Answer» A. Record | |
| 1074. |
The primary key is selected from the: |
| A. | Composite keys |
| B. | Candidate keys |
| C. | Foreign keys |
| D. | Determinants |
| Answer» B. Candidate keys | |
| 1075. |
Which of the following is a group of one or more attributes that uniquely identifies a row? |
| A. | Key |
| B. | Tuple |
| C. | Determinant |
| D. | Relation |
| Answer» A. Key | |
| 1076. |
When the values in one or more attributes being used as a foreign key must exist in another set of one or more attributes in another table, we have created a(n): |
| A. | Transitive dependency |
| B. | Insertion anomaly. |
| C. | Referential integrity constraint. |
| D. | Normal form |
| Answer» C. Referential integrity constraint. | |
| 1077. |
A relation is considered a: |
| A. | Column |
| B. | One dimensional table |
| C. | Two dimensional table |
| D. | Three dimensional table |
| Answer» C. Two dimensional table | |
| 1078. |
In the relational model, relationships between relations or tables are created by using: |
| A. | Candidate keys |
| B. | Foreign keys |
| C. | Composite Keys |
| D. | Determinants |
| Answer» B. Foreign keys | |
| 1079. |
A functional dependency is a relationship between or among: |
| A. | Tables |
| B. | Rows |
| C. | Relations |
| D. | Attributes |
| Answer» D. Attributes | |
| 1080. |
Table is synonymous with the term: |
| A. | Record |
| B. | Column |
| C. | Field |
| D. | Relation |
| Answer» D. Relation | |
| 1081. |
Which of the following is not a restriction for a table to be a relation? |
| A. | The cells of the table must contain a single value. |
| B. | All of the entries in any column must be of the same kind. |
| C. | The columns must be ordered. |
| D. | No two rows in a table may be identical. |
| Answer» C. The columns must be ordered. | |
| 1082. |
For some relations, changing the data can have undesirable consequences called: |
| A. | Referential integrity constraints. |
| B. | Modification anomalies. |
| C. | Normal forms. |
| D. | Transitive dependencies. |
| Answer» B. Modification anomalies. | |
| 1083. |
If attributes A and B determine attribute C, then it is also true that: |
| A. | A → C. |
| B. | B → C |
| C. | (A, B) is a composite determinant. |
| D. | C is a determinant |
| Answer» C. (A, B) is a composite determinant. | |
| 1084. |
If attribute A determines both attributes B and C, then it is also true that: |
| A. | A → B |
| B. | B → A |
| C. | C → A |
| D. | (B,C) → A |
| Answer» A. A → B | |
| 1085. |
One solution to the multivalued dependency constraint problem is to: |
| A. | split the relation into two relations, each with a single theme |
| B. | Change the theme. |
| C. | Create a new theme. |
| D. | add a composite key |
| Answer» A. split the relation into two relations, each with a single theme | |
| 1086. |
FD stands for: |
| A. | Functional dependency |
| B. | Facilitate dependency |
| C. | Functional data |
| D. | Facilitate data |
| Answer» A. Functional dependency | |
| 1087. |
In which model of database data is stored in tables: |
| A. | Network model |
| B. | Relational model |
| C. | Hierarchical model |
| D. | None of these |
| Answer» B. Relational model | |
| 1088. |
How many types of keys in relation database design: |
| A. | Primary key |
| B. | Candidate key |
| C. | Foreign key |
| D. | All of these |
| Answer» D. All of these | |
| 1089. |
Which key is referencing a primary key in a table: |
| A. | Primary key |
| B. | Candidate key |
| C. | Foreign key |
| D. | All of these |
| Answer» C. Foreign key | |
| 1090. |
In which ways two tables may be related: |
| A. | One-one |
| B. | One-many |
| C. | Many-many |
| D. | All of these |
| Answer» D. All of these | |
| 1091. |
Which rules are defined in relational models they from as an essential part of any relation database: |
| A. | Integrity rules |
| B. | Database |
| C. | Record |
| D. | Memory |
| Answer» A. Integrity rules | |
| 1092. |
Which are the types of integrity rule: |
| A. | Entity integrity |
| B. | Referential integrity |
| C. | Both |
| D. | None |
| Answer» B. Referential integrity | |
| 1093. |
______states that primary keys should not be null: |
| A. | Entity integrity |
| B. | Referential integrity |
| C. | Both |
| D. | None |
| Answer» A. Entity integrity | |
| 1094. |
Which command creates database objects like tables, views and indexes: |
| A. | Create command |
| B. | Update command |
| C. | Both |
| D. | None |
| Answer» A. Create command | |
| 1095. |
Which command enables alteration the data stored in existing records: |
| A. | Create command |
| B. | Update command |
| C. | Deletion command |
| D. | All of these |
| Answer» B. Update command | |
| 1096. |
Which are the dependencies types: |
| A. | Full functional dependency |
| B. | Partial dependency |
| C. | Trivial functional dependency |
| D. | All of these |
| Answer» D. All of these | |
| 1097. |
FDs are the types of constraints that are based on______: |
| A. | Key |
| B. | Key revisited |
| C. | Superset key |
| D. | None of these |
| Answer» A. Key | |
| 1098. |
Who developed the normalization process: |
| A. | E.F. codd |
| B. | F.F. codd |
| C. | E.E. codd |
| D. | None of these |
| Answer» A. E.F. codd | |
| 1099. |
Which is a bottom-up approach to database design that design by examining the relationship between attributes: |
| A. | Functional dependency |
| B. | Database modeling |
| C. | Normalization |
| D. | Decomposition |
| Answer» C. Normalization | |
| 1100. |
In decomposition technique of splitting a relation into_____ relation: |
| A. | ONE or MORE |
| B. | TWO or MORE |
| C. | THREE or MORE |
| D. | FOUR or MORE |
| Answer» B. TWO or MORE | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.