A relation R on a set A is called reflexive if and only if < a, a > R for every element a of A
because R1 and R2 are reflexive relations So Both R1∩R2 and R1UR2 are reflexive.
Ans .
(B) 2/3
Explanation :
3 cards Black Black Red Red Black Red
Black Black Red Red wil have same color on both sides
so favorable cases =2 total cases =3
answer is 2/3
Ans .
marks to all
Explanation :
Ans .
(C) 1 ⊕ 1 ⊕ 0 = 1
Explanation :
Ans .
(D) 64
Explanation :
Ans .
(C) F = x’z + xz’
Explanation :
x'y'z + x'yz + xy'z' + xyz'
x'z + xz'
Ans .
(A) AB’
Explanation :
(AB’+AB’C+AC)(A’C’+B’)
AB' + AB'C
AB'(1+C)
AB'
Ans .
(D) Toggle
Explanation :
Ans .
(C) 1
Explanation :
Ans .
(A) a function returning a pointer to an array of integers.
Explanation :
Ans .
(B) All member functions of the class granted friendship have unrestricted access to the members of the class granting the friendship.
Explanation :
Ans .
(D) Overrides
Explanation :
Ans .
(A) 2550
Explanation :
Ans .
(C) Entity Integrity
Explanation :
Ans .
(B) III and IV only
Explanation :
Ans .
(A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.
Explanation :
Ans .
(C) II and III only
Explanation :
Ans .
(C) II only
Explanation :
Ans .
(D) 16
Explanation :
If we remove the root node, then in the left subtree we always maximum value and put it as the root node.
Here the maximum value in the left subtree is 16 which will be new root node.
Ans .
(B) Stack operations are performed smoothly
Explanation :
Ans .
(C) (n-1)/2
Explanation :
No. of nods(minimum) in strict binary tree n=2n+1
So maximum height h=(n-1)/2
Ans .
(C) Job Scheduling
Explanation :
Ans .
(B) 14
Explanation :
Ans .
(C) 400 kbps
Explanation :
100*4=400 Kbps (no use of time slot data)
Ans .
(C) 45, 9
Explanation :
apply formula
no. Of cables= n(n-1)/2 where n = 10
and no. Of Ports= n-1 where n= 10
Ans .
(D) Host-to-network
Explanation :
Ans .
(C) N(N-1)/2
Explanation :
NC2 = N(N-1)/2
Ans .
(C) greater than
Explanation :
Total Internal Reflection across at angle > critical angle.
Ans .
(D) 12
Explanation :
Ans .
(C) 76 H
Explanation :
Here Add 42H with 5+4+3+2+1 in hexadecimal then it becomes 51 H. Add 25 H it becomes 76 H.
Ans .
(D) Loop jamming
Explanation :
Ans .
(B) I only
Explanation :
Statement I is incorrect because dynamic linking increases loading time and also overall running time.
Ans .
(B) SLR is powerful than LALR.
Explanation :
LALR is more powerful than SLR.
Ans .
(D) 9, 10
Explanation :
Ans .
(C) Yes, P4 P3 P1 P2
Explanation :
Ans .
(C) 321
Explanation :
Ans .
(C) mkdir PIS PIS/progs PIS/data
Explanation :
Ans .
(B) Round Robin Scheduling
Explanation :
Ans .
(B) 1 - S3/S1
Explanation :
Ans .
(C) Evolutionary Model
Explanation :
Ans .
(B) Risk analysis
Explanation :
Ans .
(A) P + 1
Explanation :
Ans .
(D) Robustness
Explanation :
Ans .
(B) Replay Attack
Explanation :
Masquerade Attack- Attacker uses take identity (here using identity of customer).
Replay attack- Old message is sent again by the attacker without any change.
Ans .
(B) Both (a) and (b) are true
Explanation :
Ans .
(C) exploiting instruction level parallelism
Explanation :
In pipeline processor, every next instruction arrive in very time.
Ans .
(A) (a) is true, (b) is false
Explanation :
Data scrubling (not scrubling) is the process to remove sensitive data so that original data can't be derived from scrambled data.