Database :: All Aptitude Test ::

1.Which of the following has an error in the above create table for the relation section?
A. Primary key (course id, sec id, semester, year)
B. Foreign key (course id) references course
C. Year numeric (4,0)
D. Primary key (course id, sec id, semester, year)

2.The relation with primary key can be created using?
A. Create table instructor (Id, Name)
B. Create table instructor (Id, Name, primary key(name))
C. Create table instructor (Id, Name, primary key (Id))
D. Create table instructor (Id, Name)

3.How can the values in the relation teaches be deleted?
A. Drop table teaches;
B. Delete from teaches;
C. Purge table teaches;
D. Drop table teaches;

4.In the above teaches relation ” Select * from teaches where Year = ‘2010’” displays how many rows?
A. 2
B. 4
C. 5
D. 2

5.The relation changes can be got back using which command?
A. Flashback
B. Purge
C. Delete
D. Flashback

6.The tuples that are represented in one of two relations and are lost if the JOIN operation is performed are called:
A. functional tuples
B. dangling tuples
C. algorithm tuples
D. functional tuples

7.The template conclusion is a set of tuples that must be included in the relations in the template dependency called
A. constraint generating templates
B. tuple generating templates
C. schema generating templates
D. constraint generating templates

8.The other name of project-join normal form is :
A. join normal form
B. trivial normal form
C. sixth normal form
D. join normal form

9.The types of template dependencies are :
A. constraint generating templates
B. tuple generating templates
C. schema generating templates
D. constraint generating templates

10.The decomposition of one relation say R into two relations is classified as :
A. functional decomposition
B. ternary decomposition
C. binary decomposition
D. functional decomposition

11.The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as:
A. relational synthesis algorithm
B. decomposition algorithm
C. schema synthesis algorithm
D. relational synthesis algorithm

12.The conclusion of the template is a condition which must be held on tuples hypothesis in the template dependency called :
A. schema generating templates
B. relation filtering template
C. constraint generating templates
D. schema generating templates

13.The constraints that are applied on individual tuples and are verified whenever any tuple is modified or new tuple is inserted are called :
A. language based constraints
B. tuple based constraints
C. scale based constraints
D. language based constraints

14.The basic operations that can be performed on relations are :
A. deletion
B. insertion
C. modification
D. deletion

15.In relational database schemas, the state constraints are also known as :
A. static constraints
B. dynamic constraints
C. implicit constraints
D. static constraints

16.The tuples in relation are sensitive to :
A. order
B. format
C. entity type
D. order

17.The state in which the database does not follow integrity constraints is classified as :
A. parallel state
B. invalid state
C. valid state
D. parallel state

18.The type of constraint which states that not even a single value with primary key can be a null value is classified as :
A. null integrity constraint
B. primary integrity constraint
C. secondary integrity constraint
D. null integrity constraint

19.The values which cannot be divided further are classified as :
A. formatted values
B. bi-atomic model
C. diatomic values
D. formatted values

20.On a relational database, the kind of constraint which must be specified and does not contain large classes of constraints is considered as :
A. referential integrity constraint
B. null integrity constraint
C. semantic integrity constraints
D. referential integrity constraint

21.The definition of relation in which values and attributes are ordered in tuple is classified as :
A. fourth definition of relation
B. third definition of relation
C. first definition of relation
D. fourth definition of relation

22.The constraint violated when key value in tuple already exists in some other relation's tuple is called :
A. domain constraint
B. attribute constraint
C. key constraint
D. domain constraint

23.The normal form which consider all the types of constraints and dependencies is classified as :
A. domain-key normal form
B. foreign-key normal form
C. candidate-key normal form
D. domain-key normal form

24.In the data model schemas, the constraints that are expressed directly are classified as :
A. explicit constraints
B. implicit constraints
C. flat constraints
D. explicit constraints

25.In relational database schemas, the transition constraints are also known as :
A. static constraints
B. dynamic constraints
C. implicit constraints
D. static constraints

26.A row of table in relational model terminology is classified as :
A. range
B. domain
C. relation
D. range

27.The constraint which is used to specify the consistency in two or more relations among tuples is classified as :
A. primary integrity constraint
B. entity integrity constraint
C. referential integrity constraint
D. primary integrity constraint

28.The constraint which is used to specify the consistency in two or more relations among tuples is classified as :
A. primary integrity constraint
B. entity integrity constraint
C. referential integrity constraint
D. primary integrity constraint

29.The ordered list of all the n-values is classified as :
A. n-tuple
B. l-tuple
C. v-tuple
D. n-tuple

30.The ordered list of all the n-values is classified as :
A. n-tuple
B. l-tuple
C. v-tuple
D. n-tuple


Date to Date Current Affairs 2022

PakMCQs.net

Quick Links

GAT Subject



   Computer Science    English Mcqs    Agriculture    

Engineering



   Computer Science    Civil Engineering    

Technical



   Networking    Electronics    Database    

Past Papers



   Model Papers    FPSC Papers