Computer Sciences MCQs Chapter 4 Class 12

Computer Sciences MCQs Class 12: Enhance Your Skills

Computer Sciences MCQs Class 12 are essential for students preparing for NUST, UET, FAST, ECAT, NTS, and FSC board exams. These MCQs help students practice effectively, strengthen coding and analytical skills, and improve problem-solving abilities.

228

Created on February 22, 2023 By Ali Durrani

Computer Sciences Ch 4 Class 12

This is the Free Access to Limited MCQs. Enroll to PLS Boost Premium Bundle to Get More MCQs HERE

1 / 20

3. The constraint states that in a relation no primary key value can have a null value.

Referential integrity

Entity integrity

Data integrity

All of these

2 / 20

4. In 3NF, a non-key attribute must not depend on a(n)

non-key attribute

key attribute

composite key

sort key

3 / 20

13. Integrity is concerned with the (

Reliability

Feasibility

Quality

Accessibility

4 / 20

8. problems occurs when same name is used for two different attributes:

Homonyms

Synonyms

Redundant information

Mutually Exclusive data

5 / 20

7. problems occurs when two different names are used for the same information?

Homonyms

Synonyms

Redundant information

Mutually exclusive data

6 / 20

17. If a relation is in INF and the key consists of a single attributes then the relation is called.

3NF

2NF

Both (a) & (b)

None

7 / 20

15. In which of the following normal forms, any repeating group from the table is removed?

1NF

2NF

3NF

none

8 / 20

12. Data integrity is another form of data

Data Feasibility

Data modeling

Data Accessibility

Data Protection

9 / 20

6. Referential integrity is applied on

Primary Key

Candidate Key

Foreign key

Composite key

10 / 20

14. A foreign key constraint is also called

Referential Integrity

Entity Integrity

Integrity

Field Integrity

11 / 20

19. A process in which it is being ensured that attributes are stored from where they belong

Normalization

Simplification

Structure Constraint

Field Constraints

12 / 20

10. The process of converting complex data structure into simple and stable data structure is called: a –

Synonyms

Homonym

Normalization

Redundancy

13 / 20

18. If the value of a non-key attribute can be obtained simply by knowing the values of another non-key attribute, the relation is not in: (

3NF

2NF

1NF

none

14 / 20

1. In 3NF, which form of dependency is removed? (

Functional

non-functional

associative

transitive

15 / 20

16. A relation is in second normal form if and only if:

It is in INF and all the non-key attributes are fully functionally dependent upon the key attribute.

It is in the INF and no transitive dependency exists

It is in the INF and every attribute is single valued for each tuple.

All of these

16 / 20

9. problems occurs when same information is stored in two different ways:

Homonyms

Synonyms

Redundant Information

Mutually Exclusive data

17 / 20

11. A functional dependency between two or more non-key attributes in a relation is called

Redundancy

Consistency

Transitive Dependency

None of above

18 / 20

5. Different attributes in two different tables having same name are referred to as (

synonym

homonym

acronym

mutually exclusive

19 / 20

2. How many types of data integrity are there?

20 / 20

20. A process of analyzing the dependencies of attributes with in entities is called

Normalization

Simplification

Structure Constraint

Field Constraints

Your score is

The average score is 60%

Benefits of Practicing

Regular practice allows students to identify weak areas, boost confidence, and enhance conceptual clarity. It also improves exam performance and time management, key for board exams and competitive entry tests.

PLS Academy Support

PLS Academy provides Computer Sciences MCQs with detailed solutions, topic-wise explanations, and performance tracking. Their expert guidance helps students master concepts and achieve high scores.

JazakAllah