Posts by nitin1

@iamthwee do some useful worok rather than giving pointless and illogical suggestions. if you don't know anything about me, then you don't have the right to make vague points about anyone behaviour.

Dani, being CEO is doing a great and wonderful job, but you as posting genius not. okay ? not knowing the proper meaning of stalking, you are using it blindly. and remember! TIme change evrything and everybody, so as me. so forget everything, and try to live in present rather than making someone remebering his or her past again and again. take care and enjoy your work. and yes! try to be successful man along with valuable man! thanks. :-)

I have bad posting quality because of my past behaviour. it's okay now because i am changed now. but after 6k posts, you still have 68% quality post ? dont u think you also need to work more on yourself ? Do you think u r good enough to judge someone as valuable or not ? good and bye. :-)

yeah.. i am getting this thing which you have tried to explain me in this example. but can you please read by last post and answer the question which i have asked word to word ? actually, i was confused a lot in this. you have made it very clear, still some doubt is left.

again, predenece of operators just help us to parenthesize the expression ? can you please take an example by having some different operators in it which have varied predence, including those having same predence and have some associativity thing in this (right to left , left to right)?

what is the thing when we say internal bracket is solved firstly ? but as in ur example this thing is not there. please make me correct as it is going dangerious for me. thanks a lot.

try backtracking, code will of 20-30 lines :-)

woah! what an explaination! yes! then it is okay that we dont have this feature. hmm. anyways, it doesnt matter much about old accounts because people here can help us more than that old account. i trust daniweb more than any other site or forumn. thanks dani. :D

if i want to differ between the order of precedence and order of evaluation, then i can say that oder of evaluation is always same, but order of precedence help us to paranthize the expression ? still, i am not very clear about this difference.

Secondly, that mean order of precedence doesn't mean that the brackets that are put by compiler will be excecuted before everything ? order of evaluation is not effected by order of precedence ? your explainations are really appreciable. thanks if you can help me.

wonderful explaination! and what about the case if i take one step back of the first element of the array , then ? and secondly, if i take my pointer 3 step back from the first element of array and then taking it back to the 1st or 2nd element ? is there anything defined for this case in standard ? thanks alot.

@deceptikon , then in my example, what's the difference between order of precedence and order of evaluation ? if && has higher precedence but still || component is evaluated first ? please can you make it clear to me ? thanks to you.

but for future, can't daniweb keep a pointer to lost accounts so that we can get them in any case ? it's okay if currently we don't have this feature, but shouldn't we have it ? thanks Dani. :-)

but i am pointing p to a location which is out of array bound firstly. then i am decreasing value from it to point it to previous location. is it correct ?

secondly, is it correct if i do this.

void fun(char **p)
{
       char *t;
       t=(p+=(sizeof(int)+2)))[-3];      // line xyz
       printf("%s\n",t);
}

will it still work ? i dont know , but will it always be correct to go out of range of array first then take it value by decreasing the subscript ? thanks.

sir,
was reading some problems on net, come through this one.

void fun(char**);

int main()
{
      char * argv[]={"ab","cd","ef","gh";
      fun(argv);
      return 0;
}

void fun(char **p)
{
       char *t;
       t+=(p+=sizeof(int))[-1];      // line xyz
       printf("%s\n",t);
}

// assume sizeof int is 4 bytes here

Can you explain me this ? I am not able to grab it completely . specially throw some light on line xyz as i have marked this in code snippet. thanks.

because we all here, are part of community and some are good and some are bad in it some times. you can think that i was bad at that time and you were good and still good at this time. this thing should motivate you. I can't explain how james sir has changed my behaviour. He has taught me not to include professionalism and feeling in one way. i was worst in my bad times, that doesnt mean i am still that kind of person. sorry for that and thanks to james sir forever. :-)

If you are not giving me back my a/c just because of that past behavipur, then it will demotivate me, and it will not benefit you in anyway. rest depends on you. You will do whatever is best for me. thanks Reverend Jim.

thanks ancient dragon. i respect u alot. yes true. :( it's okay. you all helped me and tried to help me as best as possible :(

And i am not able to view "all" the posts by i_am_rude by searching it. please check it out., thanks.

Yes, i know very conciously that I have deleted account on on my own and with my free will. I admit this thing. yes, I know you have said me that I cant get my a/c back. but still and still, i am very very optimistic guy. i treat u all as very experineced and nice people. that's why i was asking again if i could get my account back. that'set.

@dani no worries, at least u tried, it's enough for me.
@deceptikon no worries, atleast you and other are still there for my help.
@diafol yes, i am THAT nitin who was stalking WatlP
@stultuske thanks! but i was asking again because i am very eager to have my account my a/c back.

@all I have very great expectaions from Daniweb. I am attached with this from 2 years now. and i am loving it from core of heart and will never leave from here never ever! :') (tears of happiness) thanks.

everybody just disliking the post, (laugh out loud,I am curious to know why ). Dani has said me to tell the user name, what wrong i have done in this ? :p do tell me for sure.

@dani, can you please notify me that whether i will get my a/c back or not as i am waiting for ur reply. thanks alot to you all. :-)

my username was i_am_rude and i want it back if you Dani can help me for that.

http://www.daniweb.com/software-development/c/threads/428553/typedef-keyword-problem#post1835866 here is my one of the posts... thanks.

int m= i++ || ++j && k--;

where i=2, j=3, amd k=5;
acooridng to me, it will be executed left to right and then values of m=1, i=3, j=3 and k=5. but i have seen that precednace of && is more than || , than so how this expression is parenthezed by compiler to execute it ?

as it goes to i++, and since it is non-zero , then it dont need to check after this, so stoped there. (this is what i thought before reading that precdance of && is more than || ). so what is wrong here and where ? thanks alot.

you have made diplomatic answer. if i try to fake it, then don't u think it will be good wheni start with basic solution and then pretend that i am approachinga good answer (which i already know) ?

secondly, what will you say about this type of question. like i am giving interview for RBS or say AMAZON, they ask me "what if you get an offer from google after joining here ?" . it is really a very difficult question to answer.

okay boss! that means hashing in unordered_map will take o(m) time for each string . i was wrong because hashing the strings will i think scan the string atleast once. right ? that why it is now O(mn). am i right ? thanks.

actually, i deleted my one account on daniweb some time back, but i wana look at the posts ,whatever i have asked, comments by experts here and everything. i know i can see the posts, but i have to go very far away from today so as to look each post. it will be damn easy for me if i have account and i can see very very easily. thanks. it it's request to admins of daniweb if they can do it for me. thanks.

yes, i have cleared my DNS cache and i have tried using IE also, but problem still exist. thanks . i have cleared my cache DNS. which cache are you talking about ? can you exemplify it ?

so, you mean i should fake it but i must be ready for explaining anything related to my answer ?right sir ?

secondly, if i dont know the answer or say i dnt have any idea related to that, then should i make vague guesses or just say them "sir, i have no idea!". what is preferable at that point of time ? thanks .

P.S i wish if Daniweb would come to our campus and you would take my interview. :p (haha)

which table are you talking about ? can you tell me in context of C++ or C ? i mean are you talking about this :

map<string,int> m;

or what ? in this map, it is red-black tree and it is logn complexity. OR are you talking about hashmap in which we use some hash function in O(1) ? if latter is the case, then why O(m) is there with that, because in hash map we hash the strings in O(1). please make me correct at any point if i am wrong. thanks a lot to you.

want to distract myself from topic, i wana ask you, suppose i am giving an interview, and interviewer asks me a question which i already know very well, so what should i do ? should i fake it that i dont know OR should i say him that i know the answer already OR do what ? thanks. I really need your view point on this. thanks a lot sir. :-)

ohh... @moschops! your answer give me very nice approach to go for any answer!. too good.. thanks. i would mark something or have some mnemonic to identify any word which u have said and when u will say it again , i will put cross ahead of it. at last , i will check my mnemocs which dont have cross on it, and that is my answer.

@james sir, what is that solution u talking about ? is that trie related or what ? can you exemplify it litlle bit ? thanks from heart to both of you.

i have thought a lot on this. but not getting O(n) solution. given n URL's and you have to find the unique URL in that (if there is any). you have to print that URL. thanks. O(n2) solution is a stupid solution, some O(n) is acheivable, but not getting how can it be O(n). i have lastly thoguht about tries. can it be like this ? some related to tries ? thanks alot in advance.

i don't know if it is off. if it the case, then how to enable it ? thanks.
EDIT: yes, they are enabled. i have cheked it now.

I have seen that when i open my ubuntu , rather than windows 7 then i am able to work normally. quora, github, this link everything is opening correctly. that means ISP is correct and something is theere with windows. may be it is cookies or i dont know whaatever. please help me to correct it. thanks alot.

this is not the problem. the problem is that YOU re able to see all these things, but i am not. when i clock on login, then it doesnt do anything. it is still on the same change, and dont do anything. again, i do, again it doesnt do anything. it is still for me. i have already registered. and am member of it. i have login by this link around 20 times in past. around 1 week ago, it was wroking for me, but now it's not. my friend is able to do that, you are able to do that, but why not me ? thanks.

http://www.time4education.com/#login-box

this is the link and when i click login box, nothing happens, when i give this to my friiend, then he is able to have a login box opened. please i have to register and please tell how to open this link ? thanks.

no, it was asked by Microsoft to my friend last month. it is exact copy of questions which he has aksed to him. he then said "what if i pass last node in the list to this function?". then he said it is impossible. although he is rejetced (dnt know why), but i was curious to know whetther his answer was correct or not. thanks!

yes, i have already implemented this case, but problem arises when the node given to us is last node in the linked list. then ? thanks sir.

a linked list is given, and a only pointer to a node is given which need to be deleted. it is singly linked list. you dnt have accees to any other pointer like head or what. you only have that node pointer in ur hand. thanks.

although, i have read C++ books in my past, but as my placement session is there, i just want to have some books from where i can see everything in shortest and concise possible. classes, polymorphism, inheritnce concepts etc like this . any book which u can tell me ? it will be good if i can have e-book of that. thanks.

can you please clear me when p is giving me the sizeof array and when it will act as a pointer ? in your example, you are saying sizeof(p) is sizeof array it is giving to me, can you please explain little bit ? thanks to you.

@banfa can you explain a little more ?

secondly, can you tell me how to the size of the array in any other function in which i am passing the array ? condition is that i can't send the size of array from the calling function. okay!

int a[]={1,3,4,5,7};
    int b[]={2,3,5,6};

    int m=sizeof(a)/sizeof(int);

    int n=sizeof(b)/sizeof(int);
     cout<<m<<" "<<n<<endl;

this code prints 5,4. but when i pass the arrays to some function and then i print the m,n values then it is printing 1,1. i know that they are acting as pointer when i pass then in function and sizeof pointer is 4 bytyes and so of int. so it is 1. but why is it not same in main function ? any specific reason ? thanks alot.

can anyone give me some good references or links or some guidelines to start with this ? i need to learn this. like i want to know how can i implement malloc, calloc, realloc etc. for this thing also, what do i need to learn firstly ? thanks. any kind of help will be appreciated.

@ddanbe what is 1023 in this ? i mean when i am printing the value of some double using compiler,executing code, i am getting only 17 digits accurately and there after getting zeroes ?

secondly, can you explain how can i infer from these things the max value double can hold?

checked by 10/3 and it give me 3.333333333333333300000.... (16 times after decimal ) and when i am doing this, 100/3, then me getting 33.3333333333333330000..... (15 times after decimal). thanks.

can anyone explain me the all precison and exponent, significant bits which double can handle ? i am not getting it. wiki says it has 53 bits significant bits and 11 exponent. am a little bit confused. can anyone explain me ? (in their own way) thanks alot. although i have used double alot but now , come up with some problem. thanks.

sir, it is not my homework and nothing like that. it's just a question i came across. the problem was not this. I have thought a lot on this and then only i have simplified it much so that anyone can understand it easily. (if my thinking is not shown here, that doesn't mean i haven't thought.). thanks. i dont want any code or anything. i just want approach or some algo or some thought process. thanks if you can help me.

can you tell me the approach that i have k*n nodes where k,n are integers and no two adjacent nodes can have same colours and i want to colour the trees with n colours. (i am making trees not graphs.) thanks. any help will be appreciated.

sir, I have already written that my data is in number form. Can you tell some algod related to that ?
@ David, you haven't got what am asking about. thanks.

actually, I am trying to do digital watermarking. can you please giv me some hints of algos which i can use to do watermaking on numbers ? like i have array of numbers, then i want to water mark them with some kind of algo and also want to save that watermark which i will get so as to verify it in future.

P.S I am asking for any code here, i am just asking for hints of ALGOS, as i am novice in watermaking. thanks in advance.

but all are able to open it here also. even the persom using the same ISP and live in my neoghbour is able to open it. as deceptikon sir said me to check various things, those all things are correct. so not able to solve the point till now. :'(

quora.com and github.com, i am unable to open only these 2 sites from 10 days. can you please tell what is this and how can i rectify it ? please tell... thanks. :-)

nothing left..... he is dead :'( and so i am now... i cry in metro, college, in washrooms :'( i dnt know how to stop myself ....you guys are awesome. you have consoled me much. help me :(

:'( but how will i live without him ? he is my heart ! to whom can i tell my feelings ? my parents are also so impatient. his ambitions, care, love , he himself i gonna miss.

yes true!! i hope you can guess why have i started this. my grand pa is in situation in which i don't want even my extreme enemy to be. 2 years , i know how he has passed and now his intestine is no working and want a surgery , but he is not in condition to get a surgery. so what now ? if you do, u will die and if u dnt do, u will die. ppl said , take him to america , may be he will be cured and all. he cant have kidney translplant as he is 78 years old now. so what now.

and absence of GOD is EVIL. so if GOD is there, EVIL cant stand

GOD ? if we are child of GOD, then why do we have these kind of pathetic evil in our body ?

why do we say science is develeped so much and it can do anything today if it wants. why dont we have treatement for kidney failure ? only dialysis ? which eats up and demolish a person's bones on per day basis. it is a silient killer. only kidney transplant that too not succesfuk very much.why dont we have medicies which can regenerate kidney cells ? hell it is!! :'( pathetic condition!