About

Looking for nice year ahead.Believe in sharing and caring.

Role

Alma Mater:

B.tech in Compter Science and Engineering
Jamia Millia Islamia, New Delhi
2012 to 2016

Experience:

Not updated.
TudLead
Answer
10 months 4 days ago

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

moreless
TudLead
Example text
10 months 1 week ago

y = eloge =  xlogee =  x

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

Hence 1 should be correct answer..

moreless
TudLead
Example text
10 months 1 week ago

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

moreless
TudLead
Multichoice
10 months 1 week ago

The options given are ambiguous ones..

When the tuple  ( 2 , 4 ) is deleted means primary key value 2 is deleted..So those tuples where all foreign key values contain 2 will be deleted..

So both (5,2) and (7,2) will be deleted..

moreless
TudLead
Answer
10 months 2 weeks ago

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

moreless
shivani1234's picture
shivani
thegatebook's picture
KIRAN KUMAR
rbrgate's picture
Ravindra Babu Ravula
sumitverma's picture
Sumit Verma
ranita's picture
Ranita Biswas
pritam's picture
Pritam Prasun
techtud's picture
Techtud Admin
techtud's picture
Techtud Admin
1
pritam's picture
Pritam Prasun
905
shabinmuhammed's picture
Shabin Muhammed
1065
vinayyadav's picture
vinay yadav
1377
rajeshkpandey008's picture
Rajesh Kumar Pandey
1522
shakirhussain's picture
shakir qureshi
1661
anshulnamdeo's picture
anshul
1665
vinitasangwan's picture
Vinita Sangwan
2169
anilkhatri's picture
Anil kumar khatri
2300
arpitdhuriya's picture
Arpit Dhuriya
2378
luckysunda's picture
lucky
4287
prab_1's picture
Anjan
9527
sumitverma's picture
Sumit Verma
10677
sanjaykumarc's picture
Sanjay Kumar Chaursiya
10844
Aditya Singh Bisht
11610

Pages

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

more less

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

more less

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

more less

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

more less

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

more less

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

more less

Here brute forcing method will not work efficiently as number of parenthesisations here will be : C(12,6) / (6+1) which is a fairly large number..we cannot check these much parenthesisations within limited time..

So dynamic programming recurrence is a must to use here..

more less

In such question to avoid confusion between nodes , assign some key values to each node..

So say we have : 1 --> 2 --> 3 --> 4 initially..

After executing above code we get : 1 --> 3 --> 2 --> 4..

Means the above code swaps the middle 2 nodes by changing the links..

more less
10 Aug 2017 - 11:23pm

Any language which is regular is by default context free as well..But converse we cannot say that every context free is regular..

more less

When we prefix a '0' before a number , the number is interpretted as in octal system..So 000 would be interpreted as octal equivalent of '00' = 0 , 001 would be interpretted as octal equivalent of '01' = 1 , 010 would be interpretted as  as octal equivalent of '10' = 8 and 011  would be interpretted as  as octal equivalent of '11' = 9..

Hence C) is the correct answer..

more less

Pages