Join Us ::

Menu Home Classes GK Engineering Past Papers Current Affairs Technical GAT Subject Programming Medical Papers

Technical :: All Aptitude Test ::

Home » Technical » Aptitude Test - 26
Hassan
1.In the _______ mode, IPSec protects the whole IP packet, including the original IP header.?
A. Tranport
B. SSL
C. Tunnel
D. Tranport
2.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
3.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
4.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
5.The types of template dependencies are :
A. constraint generating templates
B. tuple generating templates
C. schema generating templates
D. constraint generating templates
6.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
7.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
8.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
9.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
10.The basic operations that can be performed on relations are :
A. deletion
B. insertion
C. modification
D. deletion
11.In relational database schemas, the state constraints are also known as :
A. static constraints
B. dynamic constraints
C. implicit constraints
D. static constraints
12.The tuples in relation are sensitive to :
A. order
B. format
C. entity type
D. order
13.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
14.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
15.The values which cannot be divided further are classified as :
A. formatted values
B. bi-atomic model
C. diatomic values
D. formatted values
16.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
17.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
18.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
19.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
20.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
21.In relational database schemas, the transition constraints are also known as :
A. static constraints
B. dynamic constraints
C. implicit constraints
D. static constraints
22.A row of table in relational model terminology is classified as :
A. range
B. domain
C. relation
D. range
23.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
24.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
25.The ordered list of all the n-values is classified as :
A. n-tuple
B. l-tuple
C. v-tuple
D. n-tuple
26.The ordered list of all the n-values is classified as :
A. n-tuple
B. l-tuple
C. v-tuple
D. n-tuple
27.The _______operation performs a set union of two “similarly structured” tables :
A. Union
B. Intersect
C. Product
D. Union
28.In domain relaional calculus “there exist” can be expressed as :
A. (P1(x))
B. (P1(x)) Э x
C. V x (P1(x))
D. (P1(x))
29.An expression in the domain relational calculus is of the form :
A. {P(x1, x2, . . . , xn) | < x1, x2, . . . , xn > }
B. {x1, x2, . . . , xn | < x1, x2, . . . , xn > }
C. { x1, x2, . . . , xn | x1, x2, . . . , xn}
D. {P(x1, x2, . . . , xn) | < x1, x2, . . . , xn > }
30.Which of the following is the comparison operator in tuple relational calculus :
A. ⇒
B. =
C. ε
D. ⇒
Related Subjects

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    
Our Team | Career | Contact | JoinUs | Privacy Policy | DMC

© 2020-2024 by Pak-MCQs.net All Rights Reserved.

Email: [email protected]