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
| 1401. |
A relation between 2 set of attributes is called as |
| A. | Join dependency |
| B. | Association |
| C. | Functional Dependency |
| D. | Multivalued dependency |
| Answer» C. Functional Dependency | |
| 1402. |
In 1NF, the value of the attribute must be |
| A. | Atomic |
| B. | Single |
| C. | Multivalued |
| D. | Null |
| Answer» D. Null | |
| 1403. |
The process of Normalization is |
| A. | Iterative |
| B. | Non-reversible |
| C. | Reversible |
| D. | None |
| Answer» A. Iterative | |
| 1404. |
Which normal form is most desirable ? |
| A. | DKNF |
| B. | 3 NF |
| C. | BCNF |
| D. | 4 NF |
| Answer» B. 3 NF | |
| 1405. |
A functional dependency is a relationship between |
| A. | Tables |
| B. | Columns |
| C. | Attributes |
| D. | Rows |
| Answer» C. Attributes | |
| 1406. |
Two or more attributes that can be a key are called : |
| A. | determinants |
| B. | primary key |
| C. | Composite key |
| D. | foreign key |
| Answer» C. Composite key | |
| 1407. |
Cartesian product in relational algebra is |
| A. | a Unary operator. |
| B. | a Binary operator. |
| C. | a Ternary operator |
| D. | not defined |
| Answer» B. a Binary operator. | |
| 1408. |
In the relational modes, cardinality is termed as: |
| A. | Number of tuples. |
| B. | Number of attributes. |
| C. | Number of tables. |
| D. | Number of constraints. |
| Answer» A. Number of tuples. | |
| 1409. |
Relational calculus is a |
| A. | Procedural language. |
| B. | Non- Procedural language. |
| C. | Data definition language. |
| D. | High level language |
| Answer» B. Non- Procedural language. | |
| 1410. |
In a relational database a referential integrity constraint can be specified with the help of |
| A. | primary key |
| B. | foreign key |
| C. | secondary key |
| D. | none of the above |
| Answer» B. foreign key | |
| 1411. |
A super key is a set of one or more attributes that, taken collectively, allow us |
| A. | to identify uniquely an entity in the entity set |
| B. | to make the key most powerful for faster retrieval |
| C. | to increase effectiveness of database access |
| D. | none of the above |
| Answer» A. to identify uniquely an entity in the entity set | |
| 1412. |
4NF is designed to cope with: |
| A. | Transitive dependency |
| B. | Join dependency |
| C. | Multi valued dependency |
| D. | None of these |
| Answer» C. Multi valued dependency | |
| 1413. |
A relational database developer refers to a record as |
| A. | a criteria. |
| B. | a relation. |
| C. | a tuple. |
| D. | an attribute. |
| Answer» C. a tuple. | |
| 1414. |
The relational model feature is that there |
| A. | is no need for primary key data. |
| B. | is much more data independence than some other database models. |
| C. | are explicit relationships among records. |
| D. | are tables with many dimensions. |
| Answer» B. is much more data independence than some other database models. | |
| 1415. |
SET concept is used in : |
| A. | Network Model |
| B. | Hierarchical Model |
| C. | Relational Model |
| D. | None of these |
| Answer» A. Network Model | |
| 1416. |
Relational Algebra is |
| A. | Data Definition Language . |
| B. | Meta Language |
| C. | Procedural query Language |
| D. | None of the above |
| Answer» C. Procedural query Language | |
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.