GAT Subject :: All Aptitude Test ::

Hassan
1.In E-R diagram generalization is represented by?
A. Ellipse
B. Dashed ellipse
C. Rectangle
D. Ellipse

2.What is a relationship called when it is maintained between two entities?
A. Unary
B. Binary
C. Ternary
D. Unary

3.Which of the following is a low level operator?
A. Insert
B. Update
C. Delete
D. Insert

4.Key to represent relationship between tables is called?
A. Primary key
B. Secondary Key
C. Foreign Key
D. Primary key

5.A window into a portion of a database is?
A. Schema
B. View
C. Query
D. Schema

6.The entity set person is classified as student and employee. This process is called?
A. Generalization
B. Specialization
C. Inheritance
D. Generalization

7.Which relationship is used to represent a specialization entity?
A. ISA
B. AIS
C. ONIS
D. ISA

8.If an entity set is a lower-level entity set in more than one ISA relationship, then the entity set has?
A. Hierarchy
B. Multilevel inheritance
C. Single inheritance
D. Hierarchy

9.Which a constraint requires that an entity belong to no more than one lower-level entity set?
A. Disjointness
B. Uniqueness
C. Special
D. Disjointness

10.Functional dependencies are a generalization of?
A. Key dependencies
B. Key dependencies
C. Database dependencies
D. Key dependencies

11.Which of the following is another name for a weak entity?
A. Child
B. Owner
C. Dominant
D. Child

12.Let P and Q be statements, then P<->Q is logically equivalent to
A. P<->~Q
B. ~P<->Q
C. ~P<->~Q
D. P<->~Q

13.What is the negation of the statement A->(B v(or) C)?
A. A ∧ ~B ∧ ~C
B. A->B->C
C. ~A ∧ B v C
D. A ∧ ~B ∧ ~C

14.The compound statement A-> (A->B) is false, then the truth values of A, B are respectively?
A. T, T
B. F, T
C. T, F
D. T, T

15.The statement which is logically equivalent to A∧ (and) B is?
A. A->B
B. ~A ∧ ~ B
C. A ∧ ~B
D. A->B

16.Let P, Q, R be true, false true , respectively, which of the following is true?
A. P∧Q∧R
B. P∧~Q∧~R
C. Q->(P∧R)
D. P∧Q∧R

17.“Match will be played only if it is not a humid day.” The negation of this statement is?
A. Match will be played but it is a humid day
B. Match will be played or it is a humid day
C. All of the mentioned statement are correct
D. Match will be played but it is a humid day

18.The statement (~P<->Q)∧~Q is true when?
A. P:True Q: False
B. P:True Q:True
C. P:False Q:True
D. P:True Q: False

19.Let P, Q, R be true, false, false, respectively, which of the following is true?
A. P∧(Q∧~R)
B. (P->Q)∧~R
C. Q<->(P∧R)
D. P∧(Q∧~R)

20.The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
A. 600
B. 350
C. 650
D. 600

21.Convert the following infix expressions into its equivalent postfix expressions (A + B ⋀D)/(E – F)+G?
A. (A B D ⋀ + E F – / G +)
B. (A B D +⋀ E F – / G +)
C. (A B D â‹€ + E F/- G +)
D. (A B D ⋀ + E F – / G +)

22.Convert the following Infix expression to Postfix form using a stack x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal?
A. xyz*+pq*r+s*+
B. xyz*+pq*r+s+*
C. xyz+*pq*r+s*+
D. xyz*+pq*r+s*+

23.Which of the following is not an inherent application of stack?
A. Reversing a string
B. Evaluation of postfix expression
C. Implementation of recursion
D. Reversing a string

24.The type of expression in which operator succeeds its operands is?
A. Infix Expression
B. Prefix Expression
C. Postfix Expression
D. Infix Expression

25.If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?
A. ABCD
B. DCBA
C. DCAB
D. ABCD

26.A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
A. Queue
B. Stack
C. Tree
D. Queue

27.The data structure required for Breadth First Traversal on a graph is?
A. Stack
B. Array
C. Queue
D. Stack

28.A queue follows?
A. FIFO (First In First Out) principle
B. LIFO (Last In First Out) principle
C. Ordered array
D. FIFO (First In First Out) principle

29.Circular Queue is also known as?
A. Ring Buffer
B. Square Buffer
C. Rectangle Buffer
D. Ring Buffer

30.A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
A. Queue
B. Circular queue
C. Dequeue
D. Queue


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