Technical :: All Aptitude Test ::

Hassan
1.The _______ operator takes the results of two queries and returns only rows that appear in both result sets.
A. Union
B. Intersect
C. Difference
D. Union

2.A ________ is a pictorial depiction of the schema of a database that shows the relations in the database, their attributes, and primary keys and foreign keys.
A. Schema diagram
B. Relational algebra
C. Database diagram
D. Schema diagram

3.The _________ provides a set of operations that take one or more relations as input and return a relation as an output.
A. Schematic representation
B. Relational algebra
C. Scheme diagram
D. Schematic representation

4.The JOIN operation which uses any of the comparison operators is classified as :
A. THETA JOIN
B. CHI-JOIN
C. PI-JOIN
D. THETA JOIN

5.The kind of operation by which one tuple can be created with the help of combining tuples from two relations is classified as :
A. square operation
B. join operation
C. division operation
D. square operation

6.Consider two tuples X and Y, the operation whose result includes tuples that are only in X but not in Y is classified as :
A. square of relation X and Y
B. union of relation X and Y
C. intersection of relation X and Y
D. square of relation X and Y

7.Consider two tuples X and Y, the operation whose result includes tuples that are only in X but not in Y is classified as :
A. square of relation X and Y
B. union of relation X and Y
C. intersection of relation X and Y
D. square of relation X and Y

8.As compared to Cartesian product, the tuples which appears in the result by applying JOIN are the ones :
A. that fulfills the condition
B. that does not fulfill the condition
C. that are nested
D. that fulfills the condition

9.Consider two tuples R and S, the maximum size of R and S relations is divided to expected size of join is classified as :
A. equi join selectivity
B. natural selectivity
C. join selectivity
D. equi join selectivity

10.In the notation for query trees, the node which is used to terminate the execution is classified as :
A. attribute nodes
B. leaf nodes
C. stem nodes
D. attribute nodes

11.The expression used in relational calculus to specify request of retrieval is classified as :
A. declarative expression
B. procedural expression
C. structural expression
D. declarative expression

12.The compatibility condition which states that the relations for union and intersection operations must consist of same type of tuples is classified as :
A. union compatibility
B. intersect compatibility
C. row compatibility
D. union compatibility

13.The degree of the PROJECT operation is equal to :
A. number of entities
B. number of attributes
C. number of columns
D. number of entities

14. Because of the calculus expression, the relational calculus is considered as :
A. procedural language
B. non procedural language
C. structural language
D. procedural language

15.The expression used in relational calculus to specify request of retrieval is classified as :
A. declarative expression
B. procedural expression
C. structural expression
D. declarative expression

16.The value of the atom which evaluates either condition is TRUE or FALSE for particular combination of tuples is classified as :
A. intersection value
B. union value
C. truth value
D. intersection value

17. The types of quantifiers are :
A. universal quantifier
B. existential quantifier
C. local quantifier
D. universal quantifier

18.The expression which specifies the procedure to retrieve rather than retrieval content is classified as :
A. procedural expression
B. structural expression
C. functional expression
D. procedural expression

19.A second form of relational calculus, is known as :
A. Domain relational calculus
B. Relational calculus
C. Tuple relational calculus
D. Domain relational calculus

20.The restricted tuple relational calculus is equivalent to the :
A. Tuple relational calculus
B. Attribute relational calculus
C. Domain relational calculus
D. Tuple relational calculus

21.In domain relational calculus, all values that appear in tuples of the expression are values from :
A. Views
B. Domain
C. Relation
D. Views

22.Find the names of all instructors in the Physics department together with the course id of all courses they teach:
A. {< c > | Э s (< c, a, s, y, b, r, t >ε section ∧s = “Fall” ∧ y = “2009” ∨Эu (< c, a, s, y, b, r, t >ε section ∧s = “Spring” ∧ y = “2010”
B. {< n, c > | Э i, a (< i, c, a, s, y > ε teaches ∧ Э d, s (< i, n, d, s > ε instructor ∧ d = “Physics”))}
C. {< n > | Э i, d, s (< i, n, d, s > ε instructor ∧ s > 80000)}
D. {< c > | Э s (< c, a, s, y, b, r, t >ε section ∧s = “Fall” ∧ y = “2009” ∨Эu (< c, a, s, y, b, r, t >ε section ∧s = “Spring” ∧ y = “2010”

23.Which of the following is the comparison operator in tuple relational calculus :
A.
B. =
C. ε
D.

24. 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))

25.“Find all students who have taken all courses offered in the Biology department.” The expressions that matches this sentence is :
A. Э t ε r (Q(t))
B. ∀ t ε r (Q(t))
C. ¬ t ε r (Q(t))
D. Э t ε r (Q(t))

26. Find the ID, name, dept name, salary for instructors whose salary is greater than $80,000 :
A. {t | t ε instructor ∧ t[salary] > 80000}
B. Э t ∈ r (Q(t))
C. {t | Э s ε instructor (t[ID] = s[ID]∧ s[salary] > 80000)}
D. {t | t ε instructor ∧ t[salary] > 80000}

27.DRC stands for?
A. Domain Relation Calculus
B. Debug relational calculus
C. Double relational calculus
D. Domain Relation Calculus

28.Which one of the following is a procedural language?
A. Domain relational calculus
B. Tuple relational calculus
C. Relational algebra
D. Domain relational calculus

29.Which of the following is the operation developed specifically for the relational databases?
A. Union
B. Cartesian product
C. Division
D. Union

30.Which of the following is the set-oriented operation?
A. Select
B. Difference
C. Division
D. Select


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