Computer Science Mcqs
Computer Science Mcqs
CHAPTER 3 (2 ND YEAR)
1:
2:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
A type of normalization in which all the tables used must have a primary key defined is
called _____________.
(a) Normal Data Form
(b) First Normal Form
(c) Data Correctness
(d) Database Protection
____________ states that no attribute of a primary key should contain null value.
(a) Data Correctness
(b) Entity Integrity
(c) Transitive dependency
(d) Data Operation
____________ are removed at the end of second normal form.
(a) Processes
(b) Homonym
(c) Conditionality
(d) Anomalies
____________ dependency is removed in third normal form.
(a) Transitive
(b) Non Functional
(c) Anomaly
(d) Correctness
____________ groups are removed during the first normal form.
(a) Data Operation
(b) Data Consistency
(c) Repeating
(d) Data Security
A relation R can be in ____________ if and only if all underlying domains contains
atomic values.
(a) Database Protection
(b) Additional Normal Form
(c) First Normal Form
(d) Data Correctness
Partial functional dependency creates redundency in the table which results in certain ______.
(a) Anomalies
(b) Dependency
(c) Synonym
(d) Consistency
____________ is the process based on the analysis of functional dependency.
(a) Normalization
(b) End User
(c) Consistency
(d) Security
Normalization is a process of converting the complex data structures into __________.
(a) Transitive Data Structure
(b) Database Structure
(c) Neural Data Structure
(d) Stable Data Structures
____________ dependency exists if one or more non key attributes are dependant on the
primary key.
(a) Partial Functional
(b) Software Functional
(c) Functional View
(d) Operation Functional
Quality data is a concern of ____________.
(a) Entity Integrity
(b) Data Consistency
(c) Data Protection
(d) Stable Data structure
A ___ is a functional dependency in a relation between two or more non key attributes.
(a) Correctness Dependency
(b) Transitive Dependency
(c) Anomaly Dependency
(d) Synonym Dependency
The process by which we can convert the complex data structures into simple data
structure is ____________.
(a) Query
(b) End User
(c) Normalization
(d) Anomaly
A relation R can be in ____________ if and only if all the underlying domains contains
atomic values.
(a) First Normal Form
(b) Transitive dependency
(c) Data Correctness
(d) Database Protection
____________ is created when two different names are used for the same information.
(a) Mutually Exclusive
(b) Data Security
(c) Synonyms
(d) Anomaly
Page 1 of 4
17:
18:
19:
20:
21:
22:
24:
25:
26:
27:
28:
29:
30:
31:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:
44:
45:
46:
47:
48:
49:
50:
51:
52:
53:
When one or more non key attributes are dependant on part of the primary key a
____________ dependency exists.
(a) Homonymaly Functional
(b) Functional View
(c) Integrity Functional
(d) Partial Functional
How many normal forms exists?
(a) Seventeen
(b) Fourteen
(c) Three
(d) Sixteen
The two important constraints in relational databases are part of ____________ .
(a) Complex Data structure
(b) Data Correctness
(c) Data Integrity
(d) Normalization
For a relation to be in second normal form a relation must be in ____________ .
(a) Additional Normal Form
(b) Data Consistency
(c) First Normal Form
(d) Transitive dependency
____________ is the process based on the analysis of functional dependence.
(a) Field
(b) Normalization
(c) Query
(d) Security
Complex data structures can be converted to _____________ in normalization process.
(a) Stable Data Structures
(b) Redundant Data Structure
(c) Entity Data Structure
(d) Mobile Data Structure
____________ is a state of a relation that can be determined by applying simple rules to
that relation.
(a) Stabality
(b) Data Consistency
(c) Normal Form
(d) Data Integrity
____________ in relational database is also called a table.
(a) Correctness
(b) Exclusive
(c) Relation
(d) Security
______ is the process of converting complex data structures into simple data structures.
(a) Protection
(b) Security
(c) Correctness
(d) Normalization
____________ can be defined as the non key attributes which are fully dependent on the
primary key.
(a) Data Consistency
(b) Database Protection
(c) Second Normal Form
(d) Transitive dependency
Correctness and consistency of data is referd by ____________ .
(a) Data Operation
(b) Database Integrity
(c) Transitive dependency
(d) Complex Data structure
____________ are created when two different names are used for the same information.
(a) Data Srtategy
(b) Data Security
(c) Synonyms
(d) Mutually Protected
Field redundancy in designin database tables can be avoided in ____________.
(a) Operation
(b) Simple Data structure
(c) Normalization
(d) Homonym
____________ is an important relational database data integrity constraint.
(a) Data Correctness
(b) Referential Integrity
(c) Normalization
(d) Functional Dependency
____________ are erased at the end of second normal form.
(a) Integrity
(b) Security
(c) Posibilities
(d) Anomalies
Which of the following states that a non key attribute must not depend on any other
non key attribute?
(a) Database Protection
(b) Third Normal Form
(c) Referential Integrity
(d) Fourth Normal Form
Important constraints of ____________exists in relational databases.
(a) Homonym
(b) Redundant Information
(c) Data Integrity
(d) Functional Dependency
Page 3 of 4
54:
55:
56:
57:
58:
59:
60:
61:
62:
Page 4 of 4