In the inner query , we get all the suppliers who have supplied some item in the city "Nagpur"...But outside it , we have used "NOT UNIQUE".."NOT UNIQUE" returns true if the result of the subquery returns more than one tuple and hence not unique...

Hence the given query will give the suppliers id who supply two or more than two items..

Hence 4) should be correct answer..

16 Sep 2017 - 11:03am

y = eloge =  xlogee =  x

Hence dy/dx = d/dx(x)  =  1

Hence 1 should be correct answer..

9 Sep 2017 - 11:59pm

It is impossible event that one item gets a wrong position ; the reason being it will be swapped by some other number..Hence D) should be correct answer..

9 Sep 2017 - 11:02pm

Its based on pipelining concept which says :

Let the one packet travel from source to destination and thereafter every transmission time interval the next packet will also reach the destination..

So time taken by 1st packet  = 3 * Tt(Data needs to be put into source end, router 1 and router 2) + 3 * Tp (There are 3 links in between)

=  3 * (packet size/bandwidth) + 3 * (link length/velocity of link)

Having found that , as said earlier now at each transmission time interval , one by one 999 packets will be received at destination end..

So for that we need   =  999 Tt

So total time needed  =  3Tp  +  1002 Tt

6 Sep 2017 - 10:46am

Empty relation is not reflexive hence not an equivalence relation..

4 Sep 2017 - 1:18am

In 3-D geometry , we have :

(x - x1) / (x2 - x1)  = (y - y1) / (y2 - y1)  = (z - z1) / (z2 - z1)  =  t(say) where t is a parameter..

Hence given coordinates = (1,2,1) and (2,5,8)..

Hence substituting values we get

(x - 1) / 1  = (y - 2) / 3  = (z - 1) / 7  =  t

==>  x = 1 + t ,

y = 2 + 3t,

z  = 1 + 7t

Hence B) should be correct answer..

31 Aug 2017 - 9:15pm

Not reverse to be precise but negation of equivalence is XOR(exclusiveness)..XOR suggests one of  p ==> q or q ==> p should exist but not both at the same time..

30 Aug 2017 - 11:20pm

Yes bidirectional means both way implication holds which is nothing but equivalence ..In digital logic the same thing becomes XNOR as an analogy..

30 Aug 2017 - 8:16pm

It should be sum of no of BFS and DFS traversals instead..In a complete graph it will be n! + n! = 2n! for Kn graph..Hence the answer will be 240 here..

30 Aug 2017 - 3:36pm

Just dry run through the matrix multiplication problem..; The one which also keeps track of paranthesisation..

26 Aug 2017 - 4:21pm