which college did it come???was it off campus or oncampus???
On Oct 6, 2:01 am, vijay singh vijaysinghb...@gmail.com wrote:
It asks questions from C, C++, DS, Java, Networking, Puzzles...
Its basically an internet gaming company, so it asks for conceptualising and
designing games using OOP
hi,
given a tree with N nodes find the node such that its average total
distance from each other node is smallest
i.e. if nodes are labeled 0N-1 then
find i such that[ SUM d(i, j ){0=jN}] /N is minimum
NOTE: This is different from the classic problem of finding
hey ankit can u show me 1st question solution
On Oct 5, 9:06 pm, Ankur Garg ankurga...@gmail.com wrote:
Implement recursive merge sort for first question(Implement recursive merge
sort for first question )
For second just swap the values of node and node b
On Wed, Oct 5, 2011 at 9:18
A family has several children. every boy has as many brothers as
sisters. Every gal has twice as many brothers as sisters. How many
childrens are there in family?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
7, try thinking by yourself...
if anyone has some different answer only then post
On Oct 6, 3:05 pm, 9ight coder 9ightco...@gmail.com wrote:
A family has several children. every boy has as many brothers as
sisters. Every gal has twice as many brothers as sisters. How many
childrens are
4 boys , 3 girls ..
7 children
b: no. of boys
g: no of girls
b-1=g (1st condition)
b=2(g-1) (2nd condition) gives the answer
On Thu, Oct 6, 2011 at 3:42 PM, shady sinv...@gmail.com wrote:
7, try thinking by yourself...
if anyone has some different answer only then post
On Oct 6, 3:05
Any one having good material on functional dependency and normalization ,
which contain examples and easily explain these concepts ...
Plz post here ...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
if there are further off topic discussions people will get banned
On Oct 6, 4:22 pm, amit kannaujiya amitkannaujiyan...@gmail.com
wrote:
Any one having good material on functional dependency and normalization ,
which contain examples and easily explain these concepts ...
Plz post here ...
hey first Congratscan you tell me the pattern and what type of questions
they asked?..because this is coming to our college also for internship?
Thanks in advance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
can u plz expain imnewcoder's approach with an example...?
--
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
let no of boys be x and no of girls be y.
then,
x=y+1
2(y-1)=x
solving these we get x=4,y=3
so,x+y=7
there are 7 children.
am I right
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
guys its my sincere request to all .. before posting any question plz plz do
search for archives first . if you would had done that you could have got
better knowledge .
On Wed, Oct 5, 2011 at 9:14 PM, raman shukla shukla.rama...@gmail.comwrote:
Hey mate dont worry there is nothing like
*int main()
{
char *p = ayqm;
printf(%c,++*(p++));
return 0;
}*
--
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
do justify the name of the group ..
thnks
--
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.
here
*char *p = ayqm;
p points to constant character string
so ++*(p++) is an attempt to modify the string so its an error
*
On Thu, Oct 6, 2011 at 8:35 AM, praneethn praneeth...@gmail.com wrote:
*int main()
{
char *p = ayqm;
printf(%c,++*(p++));
return
its not an error
infact pre-increment operator doesnt hv an impact in changing the value of
const stringdats y the o/p is a
--
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
anyone?
--
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 this group
check this :
https://www.securecoding.cert.org/confluence/display/seccode/STR30-C.+Do+not+attempt+to+modify+string+literals
On Thu, Oct 6, 2011 at 9:40 PM, Neha Gupta nehagup...@gmail.com wrote:
its not an error
infact pre-increment operator doesnt hv an impact in changing the value of
const
ne updates on flipkart n1??
On Fri, Sep 9, 2011 at 9:53 PM, siva viknesh sivavikne...@gmail.com wrote:
hi...which coll and package???...plz post the interview experiences
after attending ..thx
On Sep 8, 6:03 pm, htross htb...@gmail.com wrote:
please post the questions after the first round
output= b
try running on turbo c .
--
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
Shiva is right and that is the answer
*
if you try to change the values in a character array literal, the behavior
is undefined*
so on some compilers like Turbo C u may get o/p
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
*in turbo c:
output is b
as post increment operator will increment later..*
Thanking you
*With regards-
Raghav garg
Contact no. 9013201944
www.facebook.com/rock.raghavag
B. tech (IT), 5th sem
University School Of Information Technology
Guru Govind Singh Indraprastha University
Delhi*
On Thu,
do this way.
start with any node(k) calculate sk = sum(k, i) for all i 0 = i n;
and u can easily get sj = sum(j,i) where j is adjacent to k; in O(n);
suppose nj = number of nodes remains after removing edge(j,k) in subtree
containing node j;
suppose nk = number of nodes remains after removing
IIIT-Delhi
On Wed, Oct 5, 2011 at 8:45 AM, gaurav yadav gauravyadav1...@gmail.comwrote:
which college?
--
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
Flipkart asks good algo question as well as java question
On Thu, Oct 6, 2011 at 10:10 PM, Akash Mukherjee akash...@gmail.com wrote:
ne updates on flipkart n1??
On Fri, Sep 9, 2011 at 9:53 PM, siva viknesh sivavikne...@gmail.com
wrote:
hi...which coll and package???...plz post the
Hi
On 6 October 2011 23:11, DIVIJ WADHAWAN divij...@gmail.com wrote:
IIIT-Delhi
Get your algos strong. Esp. Linked List and string manipulations.
Be ready to give optimized solutions to problems.
A few questions from scalability are also asked sometimes
On Wed, Oct 5, 2011 at 8:45 AM,
and why is that related to algorithms anyway?
from [1]
To further highlight the difference between a problem and an instance,
consider the following instance of the decision version of the
traveling salesman problem: Is there a route of length at most 2000
kilometres passing through all of
I completely agree.
If your not sure what an algorithm and a computational problem is
check this article:
http://en.wikipedia.org/wiki/Computational_complexity_theory#Computational_problems
puzzles are not necessarily algorithms.
we're not interested in problem instances.
please mind that.
Agree.
On Fri, Oct 7, 2011 at 5:08 AM, Arun Vishwanathan aaron.nar...@gmail.comwrote:
Hey all,
Just a thought...since people feel strongly the urge to post only algo
related questions here, can a new group be made to post stuff related to
interviews and the questions asked for different
can somebody provide the link or explain how malloc is implemented
internally as googling didn't help me.
--
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
algogeeks-jobs? :-)
perhaps the current owners/moderators could do that?
On Thu, Oct 6, 2011 at 8:38 PM, Arun Vishwanathan
aaron.nar...@gmail.com wrote:
Hey all,
Just a thought...since people feel strongly the urge to post only algo
related questions here, can a new group be made to post
look for Doug Lea's malloc.
http://g.oswego.edu/dl/html/malloc.html
ftp://g.oswego.edu/pub/misc/malloc.c
the source code for this implementation is a really neat piece of
Literate Programming.
On Fri, Oct 7, 2011 at 1:53 AM, praneethn praneeth...@gmail.com wrote:
can somebody provide the link
It uses the system call brk
On Fri, Oct 7, 2011 at 10:23 AM, praneethn praneeth...@gmail.com wrote:
can somebody provide the link or explain how malloc is implemented
internally as googling didn't help me.
--
You received this message because you are subscribed to the Google Groups
http://groups.google.com/group/http://groups.google.com/group/interview-street?hl=en
*interview-street http://groups.google.com/group/interview-street?hl=en*
*
*
* http://groups.google.com/group/interview-street?hl=en**fine, here it is.
If anyone posts any kind of stuff like Which company, what
too many groups :(
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
http://twitter.com/amolsharma99http://in.linkedin.com/pub/amol-sharma/21/79b/507http://youtube.com/amolsharma99
On Fri, Oct 7, 2011 at 10:48 AM, shady
cant find in archives plz someone
On Sun, Oct 2, 2011 at 6:03 PM, Sahil Garg garg.sahi...@gmail.com wrote:
plz post the soln.. i cant find it..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Tue, Sep 27, 2011 at 3:41 PM, shady sinv...@gmail.com wrote:
discussed,
36 matches
Mail list logo
