2nd Year Computer Chapter 4 Notes
Important full 2nd Year Computer Chapter 4 Notes written by Professor Mr. Tayyab Shahzad. These notes are very helpful in the preparation of 2nd year computer chapter 4 important questions of Computer Science for the students of the intermediate and these are according to the paper patterns of all Punjab boards.
Summary and Contents:
Topics which are discussed in the notes are given below:
- Important Multiple Choice Questions of 2nd year computer chapter 4 mcqs of 2nd-year Computer Science.
- Q1: A foreign key constraint is also called:
(a) Referential Integrity (b) Entity integrity (c) Integrity (d) Redundancy
- Q2: In a relational database, a table is also called: (a) Tuple (b) Relation (c) Record (d) Schema
- Q3: Data integrity is expressed in terms of: (a) Constraints (b) Consistency rules (c) Correctness (d) All of these
- Q4: Integrity is concerned with the:
- (a) Reliability of data (b) Feasibility of data (c) Quality of data (d) Accessibility of data
- Q5: The entity integrity rules states the following: (a) No primary key attribute can be null (b) Primary key must have only one attribute (c) Each entity must have a primary key (d) None of these
- Important 2nd year computer chapter 4 mcqs with answers for Intermediate part-II students.
- Q6: A rule that states that each foreign key value must match a primary key value in the other
relation is called: (a) Referential integrity constraint (b) Entity key group rule (c) Key match rule (d) Foreign / Primary match rule
- Q7: The Goal of Normalization is to:
- (a) Increase (b) Get Stable (c) Increase Inconsistency Redundancy (d) Increase Anomalies Data Structure
- Q8: In 2NF, which form of dependency is removed? (a) Functional (b) Partial (c) Associative (d) Transitive
- Q9: In 3NF, which form of dependency is removed? (a) Functional (b) Non - Functional (c) Associative (d) Transitive
- Q10: The attribute on left hand side of arrow in functional dependency is called:
- (a) Entity (b) Determinant (c) Dependent (d) Attribute
- Q11: In following normal form , any repeating group from the table is removed: (a) 1 NF (b) 2 NF (c) 3 NF (d) 4 NF
- Q12: In 2NF, a non - key attribute must not depend on another:
- (a) Non-key attribute (b) Key attribute (c) Composite key (d) Sort key
- Important 2nd year computer chapter 4 important mcqs for Intermediate part-II students.
- Q13: Following anomalies arise due to transitive dependency: (a) Insertion (b) Deletion (c) Modification (d) All of these
- Q14: In 3NF , which form of dependency is removed? (a) Functional (b) Non-functional (c) Associative (d) Transitive
- Important 2nd year computer chapter 4 short questions for Intermediate part-II students.
- What is meant by entity integrity?
- What is referential integrity?
- What is redundancy? : Ans: Redundancy appears when same data values are stored more than once in a table. It is
also called redundancy if the same values are stored in more than one table
- What is normalization?
- What is a repeating group?
- Important 2nd year computer chapter 4 important long questions for Intermediate part-II students.
- What are database anomalies?: Ans: These are certain situations created when one or more records are deleted, modified or
inserted in the database and the databases goes into an inconsistent state.
- What is insertion anomaly?
- What is deletion anomaly?
- What is modification anomaly?
- Important 2nd year computer chapter 4 long questions for Intermediate part-II students.
- What is 1st Normal form? : Ans: A relation is in 1st normal form if and only if all underlying domain contain atomic values only. Each cell should contain only one value and relation does not contain any repeating group.
- What is a partial dependency?
- What is transitive dependency?
- What is an integrity constraint?
- What is the 2nd Normal form?
- Important 2nd year computer chapter 4 long questions pdf download for Intermediate part-II students.
- What is the 3rd Normal form? : Ans: A relation is in 3rd normal form if it is in 2ND normal form and no transitive
dependencies exist. Transitive dependency is a functional dependency between two or
more non-key attributes of a relation.