GAT Subject :: All Aptitude Test ::

Hassan
1. The Binary operation Union, denoted, as in the set theory by:
A. U
B. p
C. σ
D. U

2.If we want to include attributes from two different relations, which of the following operations is needed?
A. Set difference
B. Union
C. Cartesian product
D. Set difference

3. Which of the following operation allows us to find the tuples that are in one relation but are not in another relation?
A. Set difference
B. Union
C. Cartesian product
D. Set difference

4. Which of the following operation allows us to find the tuples that are in one relation but are not in another relation?
A. Set difference
B. Union
C. Cartesian product
D. Set difference

5.Which of the following operation, denoted by cross (×), allows to combine the information from any two relation?
A. Set difference
B. Union
C. Cartesian product
D. Set difference

6. Suppose we wish to find all customers who have both a loan and an account. Which of the following operation allows us to produce this relation?
A. Set difference
B. Union
C. Cartesian product
D. Set difference

7. Which of the following operation that allows us to combine certain selections and a Cartesian product into one operation?
A. Set-intersection operation
B. Natural-Join operation
C. Division operation
D. Set-intersection operation

8.If P then Q is called _________ statement.?
A. Conjunction
B. disjunction
C. conditional
D. Conjunction

9.A relation R in a set X is symmetric if _______?
A. xRy, yRz => xRz
B. xRy
C. xRy=>yRx
D. xRy, yRz => xRz

10. If R is reflexive, symmetric and transitive then the relation is said to be ________.?
A. Binary relation
B. Compatibility relation
C. Equivalence relation
D. Binary relation

11.If there are more than 2 LMD for a string then it is said to be ___________.?
A. Ambigious
B. unambigious
C. language
D. Ambigious

12.The specification of proper construction of a sentence is called ________.?
A. alphabet
B. letter
C. syntax
D. alphabet

13.Context free grammar is also known as _______ grammar.?
A. type 0
B. type 1
C. type 2
D. type 0

14. Accepting states are denoted by ________.?
A. circle
B. double circle
C. an arrow mark
D. circle

15. The set of all finite words over E is denoted by ________.?
A. E+
B. E*
C. E
D. E+

16.The composition of function is associative but not _________.?
A. commutative
B. associative
C. distributive
D. commutative

17.A sum of the variables and their negations in a formula is called ________?
A. elementary sum
B. elementary product
C. cnf
D. elementary sum

18.A graph in which every vertex has same degree is called _________ graph.?
A. regular
B. simple
C. complete
D. regular

19.The number of vertices of odd degree in a graph is always ________.?
A. odd
B. even
C. zero
D. odd

20.Traveling salesman problem is example for_______graph.?
A. eulerian
B. hamiltonian
C. tournament
D. eulerian

21. If a normal form contains all minterms, then it is ________.?
A. a tautology
B. a contradiction
C. a contingency
D. a tautology

22.PCNF is also called _______.?
A. sum of product canonical form.
B. product of sum canonical form
C. sum canonical form
D. sum of product canonical form.

23.Max-terms of two statements are formed by introducing the connective _________.?
A. disjunction
B. conjunction
C. negation
D. disjunction

24.The number of relations from A = {a,b,c] to B = {1,2] are __________.?
A. 6
B. 8
C. 32
D. 6

25.A graph is planar if and only if it does not contain ________.?
A. subgraphs homeomorphic to k3 & k3,3
B. subgraphs isomorphic to k5 or k3,3
C. subgraphs isomorphic to k3 & k3,3
D. subgraphs homeomorphic to k3 & k3,3

26.sub graphs homeomorphic to k5 or k3,3...?
A. one arrow between each pair of distinct vertices
B. two arrows between each pair of distinct vertices
C. n-1 arrows between each pair of distinct vertices
D. one arrow between each pair of distinct vertices

27.If a compound statement is made up of three simple statements then the number of rows in the truth table is _______.?
A. 2
B. 4
C. 6
D. 2

28.If R= {(x, 2x)] and S= {(x, 4x)] then R composition S=____.?
A. {(x, 4x)]
B. {(x, 2x)]
C. {(x, 8x)]
D. {(x, 4x)]

29.A regular grammar contains rules of the form _______.?
A. A tends to AB
B. AB tends to a
C. A tends to aB
D. A tends to AB

30.The NAND statement is a combination of ________.?
A. NOT and AND
B. NOT and OR
C. AND and OR
D. NOT and AND


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