someone please reply
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
* Which of the following restricts a process to the memory allocated to it*
*
*a. stack pointers
b. memory allocation hardware
c. kernel
d. none of these
what's the answer of this question
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
Is there anyone in this group who cleared the prior examination of works
applications..
reply asap
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
Hi friends,
I have cleared the prior examination of Works application a japenese
company which is offering a package of $7pannum in tokyo ,ther's
high probability of getting selected in interview but as i hav read
tha cost of living in tokyo is too high plus japan is not that much
good for
I rally don't know how many are selecrted from my college bcoz i 've not
talked others i'll update the information soon
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
I am from Delhi College of Engineering[now DTU] i don't think it's on us to
chose the location where we want to work , they will ask our preferences if
possible then only they will send us to singapore otherwise we will have to
go tokyo...
By the way is there anyone else who have cleared the exam
good company a great place to work some of my seniors are working there
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
Is there anybody who has cleared works application prior examination ?
can anybody please tell what to expect in the interview ?
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
code becomes more efficient
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
what's the difference between char* p and *char p
Source samsung inteview
I think the second one is invalid please also tell can we use expression of
second form anywhere
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
modify(char a[],char *b)
{
a[0]='a'//gives runtime error why?
b[0]='b'//gives runtime error
}
main()
{
char p[]=hello;
char *x=hello;
x[0]='x';//will give run time error i know why
p[0]='p' //works fine i know why
modify(string,pointer);
}
why un function modify both the assignments
can't understand what are you trying to say
source
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
monsters are monsters
-- Forwarded message --
From: raj kumar megamonste...@gmail.com
Date: Sat, Aug 27, 2011 at 10:30 PM
Subject: Re: [algogeeks] Re: String passing
To: algogeeks@googlegroups.com
can't understand what are you trying to say
source
--
You received
It's not knapsack in knapsack we find max or min subset here we have to find
all subsets =k not just one which is min or max , so I guess we have to
form all subsets and check their sum hence the algoritm will be 0(2^n) where
n is number of elements in the set ,
please correct me if i am wrong or
@don really cool algo man
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
please search for an older post for the topic before posting anything
there's already a post on this topis
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
good test case jai
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
Please mention the source of the question when you ask such question to
confirm that a solution exists for this prob.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
please dont send me messages
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
I think you forgot to give a space between macro and it's expansion that's
why
max(a,b)(ab)?a:b
is getting expanded to null
and the above result
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Sorry that's not the reason i running that code on my machine i understood
the reason is something else
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
3+23?2:3
so 53 hence 2 is returned bcoz of higher precedence of + over ?
Thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
@jagrati
so why it works fine
z=(--i)--;
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
it's running fine on my machine you can check
z=(--i)--;
even this works fine
z=(--i)++;
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send
May be
The increment/decrement operators needs to update the operand after
the sequence
point http://en.wikipedia.org/wiki/Sequence_point, so they need an
L-value. The unary operators such as -, +, won’t need L-value as operand.
The expression *-(++i)* is valid .see this page and you will
answer is three although the nodes are delted but the pointer of nodes other
than leaves are not set to null
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
hi friends ,
thoughtworks is coming to our campus after two days.
please send me the questions which they asked in your campuses.
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
tose all are previous years questions which i can find on the net also
I am asking for the questions of this year
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
@all those who gave Should be (4/5 *(1/2)^6) + (1/5 * 1) = 17/80
when it's already given that 5 heads have turned up already then why abut
are you adding that probability
you all are considering it as finding the probability of finding 6
consecutive heads.
since all tosses are independent the
Just to resolve the issue what will be the probability of getting 6
consecutive heads
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email
no then it will be 1/2
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
http://math.arizona.edu/~jwatkins/f-condition.pdf
see this link now ithink the answer should be 65/66
bcoz the probability of selectting double headed coin after n heads
=2^n/2^n+1
and fair coin is =1/2^n+1
so for 6th head it should be :2^n/2^n+1*1+((1/2^n+1)*1/2)
--
You received this
plz reply am i right or wrong
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
similar to make change dp problem
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
Really helpful info thanks guys..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
Ms written test
besides objective test you will get three or four subjective questions which
happened in our case:
so be prepared for UML diagrams:
There's high probability that the questions can repeat
So do these:(don,t remember exactly b'coz i wasn't eligible to sit so
writing the questions
Hi Guys,
Directi is visiting our campus on 8th is there anyone if it visited
anyone of your's campuses recently please tell me about the pattern of
questions...
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
thanks aishwarya
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
Directi is visiting our campus for two profiles Software developer and
System administrator are these linux questions were in both of these
profiles(s) question papers or only in the later one
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
which profile are you talking about dude.
system administrator or developer
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/97Hv5OzD0PAJ.
To post to this
Searching a node in a tree of string or integer arrays and then using binary
search withinn that node to retrive a particular value
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Guys i just want to ask was there a seprate paper for two profiles of
directi b'coz iam quite weak in linux and applying for software
developer profile
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
the best way to identify recursion is when finding solution to a problem
consist of finding solution to a sub problem
ex-5!=5*(4!)=5*4*(3!).
for bits see topcoder tutorials on bitwise operators
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
43 matches
Mail list logo
