ECAT Computer Science MCQS Page 2
A relation is in third normal form if it is in second normal form and:
Has no transitive dependencies
Dependent on part of the key
Dependent on the whole key
Independent of the key
How many types of loop structure are available in C?
3
4
2
6
In 3NF, a non-key attribute must not depend on a :
Non-key attribute
Key attribute
Composite key
Sort key
The operator that is used in decision making is
condition operator
increment operator
decrement operator
none
The goal of normalization is to:
Get stable data structure
Increase number of relation
Increase redundancy
Remove constraints
The value of expression in switch statement must be type of
both a and b
int
char
float
The columns of a table correspond to:
Field
Table
Record
Cell
Another term for a conditional operator is:
Ternary
Binary
Byte
Iteration
A relation is in 2NF if it is in 1NF and all its non-key attributes are:
Dependent on the entire primary key
Dependent on part of the primary key
Independent on the primary key
Independent of any other relation
The case block ends with:
Break
End Select
End case
Case else
Which is a possible value of flag?
–
+
Space
All of these
In relational data base, a table is also called:
Relation
Tuple
File
Schema
Continue Reading Go to Next Page
Google Ads
Leave a Reply