7 May 2017 - 3:29am

NULL == X is just another coding style used by the programmers to avoid some mistakes in codes. 

Whenever people write bigger codes they use to follow these type of convention instead of X == NULL reason being while writing code the programmer may type X = NULL instead of X == NULL which will result in overwriting of X.
While in other case NULL ==X if accidently programmer writes NULL = X then he/she will get a compilation error instead overwriting. 

more less

you have to generate features from the tweets.

eg: some hashtag says #serious so you can use this type of info in performing your sentiment analysis.

more less
12 Feb 2016 - 9:21pm

Is it 1.15 seconds ? 

more less
16 Nov 2015 - 6:08pm

Do u understand why these two are undecidable ?

more less
16 Nov 2015 - 2:35pm

Both cannot be Turing recognizable coz they are compliment of each other.
B is turing recognizable and A is not. 

more less
27 Oct 2015 - 9:05pm

P(8≤X≤28) = P(-10 ≤ (X-18) ≤ 10 ) 

= P((X-18) ≤ 10 ) ≥ 1 - (var / (10)^2) = 1- (6.25 /100 ) =  .9375  ( by chebeshey's inequality)

more less
20 Oct 2015 - 3:06pm

Normalization : use ULLMAN
ER MODELS : korth

TRansactions : navathe

Query and other topics Raghuramakrishna 

more less

this question was asked in iit delhi interview,they told to aasume it to be a complete binary tree i answered them 0.5 ^lgn,after this they changed the probablities like 0.75 for right and 0.25 for left 
and in the next question they simply said 100% we were going right 
they asked is there any case in which one can always land up on the max element in heap,for that i replied yess if all elemnts in last level are same !!

more less
21 Apr 2015 - 9:20am

it shud be D L2 must be regular.

L1 = phi

L2 =(a+b)* union of both is Complete language which is regular

L1= epsilon


union of both is also regular but finite

so D  

more less
24 Jan 2015 - 10:01am

since X is complete language except epsilon so it will cover everything 

more less