https://ideone.com/APUpv
On Fri, Oct 7, 2011 at 11:12 AM, shiva@Algo shiv.jays...@gmail.com wrote:
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
#includeiostream
int i;
class A
{
public:
A(){couti++endl;}
~A(){cout--iendl;}
}
int main()
{
A a[100];
return 0;
}
On Thu, Oct 6, 2011 at 10:42 PM, shiva@Algo shiv.jays...@gmail.com wrote:
cant find in archives plz someone
On Sun, Oct 2, 2011 at 6:03 PM, Sahil Garg garg.sahi...@gmail.com
Thanx ,owesome soln...
On Fri, Oct 7, 2011 at 11:44 AM, tanuj chawla houndhun...@gmail.com wrote:
#includeiostream
int i;
class A
{
public:
A(){couti++endl;}
~A(){cout--iendl;}
}
int main()
{
A a[100];
return 0;
}
On Thu, Oct 6, 2011 at 10:42 PM, shiva@Algo
no, just two group
algogeeks - algorithms
interview-street - job related questions, interview questions, guidance,
books request
if questions are algorithmic in nature then you can ask it in either of the
group... just be specific while asking questions and do search the archives
before asking.
it will work without having --i in destructor???y is it here?
On Fri, Oct 7, 2011 at 11:44 AM, tanuj chawla houndhun...@gmail.com wrote:
#includeiostream
int i;
class A
{
public:
A(){couti++endl;}
~A(){cout--iendl;}
}
int main()
{
A a[100];
return 0;
}
On Thu, Oct 6, 2011 at
great idea..totally agreed! :)
On 10/7/11, shady sinv...@gmail.com wrote:
no, just two group
algogeeks - algorithms
interview-street - job related questions, interview questions, guidance,
books request
if questions are algorithmic in nature then you can ask it in either of the
group...
@rahul - ya sure. i write the code for printing 1 to 100 and vice
versa.. u can remove --i in the destructor.. sorry...
--
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
yeah fyn
On Fri, Oct 7, 2011 at 1:18 PM, tanuj chawla houndhun...@gmail.com wrote:
@rahul - ya sure. i write the code for printing 1 to 100 and vice
versa.. u can remove --i in the destructor.. sorry...
--
You received this message because you are subscribed to the Google
Do you think we require two group. it will be good if we post all
query in one group. it is up to people who want to read or reply the
mail
On Oct 7, 12:25 am, arvind kumar arvindk...@gmail.com wrote:
great idea..totally agreed! :)
On 10/7/11, shady sinv...@gmail.com wrote:
no, just two
@abhishek: +1...let the group be limited to only one and read and reply
to mail you like..
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
http://www.sendspace.com/file/wxqx5l
On Oct 7, 10:09 am, saurabh singh saurab...@gmail.com wrote:
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
Its coming on 12 Oct 2011
NIT Warangal
--
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
No, 2 Groups will be better because now a days 95% of the mails are
regarding companies, rather than mails part most of the people are joining
this group only because of this, because they are told by their friends that
here most recent Company interview Questions are posted.
1. Most of the
Please tell the algo of this problem
hasPathSum()
We'll define a root-to-leaf path to be a sequence of nodes in a tree
starting with the root node and proceeding
downward to a leaf (a node with no children). We'll say that an empty
tree contains no root-to-leaf paths. So for
example, the
In written round 3 sections are thereThere is a time limit for each
section and you can't jump from one section to other section
1)Logical Reasoning and Quants (Basic)
2)Algorithms and flowchart
3)Os and Data structures
It was pretty easy...But aware of the time...
20 out of 80 were selcted
We are not supposed to use any loop.
So that leaves us with recursion. I get the idea and it was working too. But
i couldn't UNDERSTAND how the recursion was working. Can someone explain how
recursion would work in that case please?
--
You received this message because you are subscribed to
wat is ur question finding maximum path sum or anything other than this?
--
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
Exactly..two groups needed! :)
On Fri, Oct 7, 2011 at 4:42 PM, sunny agrawal sunny816.i...@gmail.comwrote:
No, 2 Groups will be better because now a days 95% of the mails are
regarding companies, rather than mails part most of the people are joining
this group only because of this, because
Does Infotrellis visited any campus ? What kind of questions they
would ask?any idea ..Help immediately
--
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
omg... speechless...
are you crazy ?
On Fri, Oct 7, 2011 at 6:18 PM, Beginner murugavidya1...@gmail.com wrote:
Does Infotrellis visited any campus ? What kind of questions they
would ask?any idea ..Help immediately
--
You received this message because you are subscribed to the Google Groups
i am bit confused...
how come using recursion makes this in-place recursion occurs with a
stack.. so you will be piling up more and more variables each time... ?
On Fri, Oct 7, 2011 at 5:19 PM, .itoa nitm...@gmail.com wrote:
We are not supposed to use any loop.
So that leaves us with
Hmm i guess you are correct! Recursion would require stacking up. Then how
are we going to do it ?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
But , let's say if we do by recursion , then could you explain the way it
would work ?
And this in-place keyword is not clear to me. Does it mean we can't use
buffer / temporary variables or something else?
--
You received this message because you are subscribed to the Google Groups
Algorithm
An in place algorithm is one which only uses a constant amount of extra
memory.
So recursion is a problem as it will use an implicit stack of size O(n)
which is linear extra memory, not constant.
On 7 October 2011 15:16, .itoa nitm...@gmail.com wrote:
But , let's say if we do by recursion ,
I'm not sure if I got the question correct.
How about change the address of stack to point to top and then
modify the push,pop functions to retrieve values as
push(int a){
stack[--top] = a;
}
int pop(){
return (stack[a++]);
}
I know there is serious limitation of not able to add
in place means:
use constant extra space
in simple terms O(1) space
--
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/-/nDVS4k7fF34J.
To post to this group,
If initially we have :
4
3
2
1
then we need this :
1
2
3
4
We need to do in-place. Even if we can do with loops then how.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
yeah...
i think its not possible without manipulating the pointers and then use
general retrieval logic.
reversal retrieval cannot be done without extra space, and without modifying
the DS. (like I
mentioned before, changing the stack to point to top manipulating the
push, pop functions.)
To do inplace stack reversal u need a mechanism by which u can transfer the
first node to last of the stack making sure u have count of other nodes
here
Say u have stack
5- top
4
3
2
1
The answer should generate the stack as
1-top
2
3
4
5
This give hints to recursion . A normal recursive func
use All Pair Shortest Path
On Oct 6, 11:11 am, Nitin Nizhawan nitin.nizha...@gmail.com wrote:
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 [
Yeah...anyone plz tell good book for OS concepts
--
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/-/aVShOmMEE_cJ.
To post to this group, send email to
the problem is that I have to open and read several emails about jobs
actually to be more precise currently there are more emails about jobs
and interviews than about algorithms.
it's really annoying to mute all threads. really really annoying.
On Fri, Oct 7, 2011 at 6:14 AM, Abhishek
two groups! two groups!
On Fri, Oct 7, 2011 at 9:41 AM, shiva@Algo shiv.jays...@gmail.com wrote:
two grp will be good
On Fri, Oct 7, 2011 at 5:39 AM, arvind kumar arvindk...@gmail.com wrote:
Exactly..two groups needed! :)
On Fri, Oct 7, 2011 at 4:42 PM, sunny agrawal
Im sorry bro, but this paper sucks. 6 pages of shallow information
and obvious code.
On Fri, Oct 7, 2011 at 7:43 AM, Rahul Tiwari rahultiwari6...@gmail.com wrote:
http://www.sendspace.com/file/wxqx5l
On Oct 7, 10:09 am, saurabh singh saurab...@gmail.com wrote:
It uses the system call
use DFS. at any poit of time if u find a node such that it has no left
and right child, then you are at leaf. find sum of all values in the
stack. for that u can use another stack.
On Oct 7, 4:15 pm, Deepak arora deepakarora...@gmail.com wrote:
Please tell the algo of this problem
You can try Operating System Concepts and Principles by Gelvin
On Fri, Oct 7, 2011 at 8:32 PM, Brijesh brijeshupadhyay...@gmail.comwrote:
Yeah...anyone plz tell good book for OS concepts
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
Hatta :D
please join acm_practice group, we will solve lot of algorithmic problems
there. :)
On Fri, Oct 7, 2011 at 9:13 PM, Hatta tmd...@gmail.com wrote:
two groups! two groups!
On Fri, Oct 7, 2011 at 9:41 AM, shiva@Algo shiv.jays...@gmail.com wrote:
two grp will be good
On Fri, Oct
thanks bro! I'll join the list...
On Fri, Oct 7, 2011 at 1:27 PM, shady sinv...@gmail.com wrote:
Hatta :D
please join acm_practice group, we will solve lot of algorithmic problems
there. :)
On Fri, Oct 7, 2011 at 9:13 PM, Hatta tmd...@gmail.com wrote:
two groups! two groups!
On Fri,
we find sum of all path...
like-
path 1: 5 4 11 7=27
path 2: 5 4 11 2=22
path 3: 5 8 13=26
path 4: 5 8 4 1 =18
--
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
thanks tpawan10
--
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
sorry for tail gating. could you please share me the link to this
group? tried few groups in google groups. Is this DVC programing
group? pls guide. TIA.
On Oct 7, 9:27 pm, shady sinv...@gmail.com wrote:
Hatta :D
please join acm_practice group, we will solve lot of algorithmic problems
there.
I just searched for acm_practice within this group and found the link ;-)
On Fri, Oct 7, 2011 at 3:09 PM, arvinthdd arvint...@gmail.com wrote:
sorry for tail gating. could you please share me the link to this
group? tried few groups in google groups. Is this DVC programing
group? pls guide.
*pass1 fail2 fail2
this will be the o/p of above code
what is the problem in this? this is perfectly fine..
*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
@raghav garg...run the code and see the output,the output comes
fail1pass2
--
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
i have run the program in turbo c and getting same o/p as i wrote earlier..
which compiler you are using?
On 10/8/11, gaurav yadav gauravyadav1...@gmail.com wrote:
@raghav garg...run the code and see the output,the output comes
fail1pass2
--
You received this message because you are
*
im using devc compiler
*
when if(ci) is encountered since integer has higher precedence over char
,so char is type casted to int
so, (ci) is equivalent to (-64-32) which is false ,so fail1 is printed,
-16 is converted to 4,294,967,295 - 16=4,294,967,280(so it is unsigned now)
for(iu)
integer i
hey raghav my turbo c compiler gives output
fail1pass2
--
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
o/p - fail1
pass2
xplaination - as char range = (-127 to +127) so char c=-64 is ok
so (ci) condition z not true ..so else part got executed .
but u is unsigned so its actual value z , u = some very high + no.
so iu cond is true -- so the final o/p --- fail1 pass2
if u want to
please post wat kind of questions wer asked in the written
test
On Oct 7, 4:01 pm, vijay singh vijaysinghb...@gmail.com wrote:
Its coming on 12 Oct 2011
NIT Warangal
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
OS by Crowly (design oriented approach) is a nice book
--
Regards
Saurabh Araiyer
http://www.decapsulatingabstraction.blogspot.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Try sumitabha das
--
Regards
Saurabh Araiyer
decapsulatingabstraction.blogspot.com
--
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
CROWLEY +1
Rahul
On Sat, Oct 8, 2011 at 2:26 AM, saurabh araiyer siz...@gmail.com wrote:
OS by Crowly (design oriented approach) is a nice book
--
Regards
Saurabh Araiyer
http://www.decapsulatingabstraction.blogspot.com
--
You received this message because you are subscribed to the
advanced programming in unix envirnment -- stevens
the unix programming envirnment -- rob pike
On Wed, Oct 5, 2011 at 8:37 AM, bihari kumarvive...@gmail.com wrote:
tell me good books on unix
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
o/p : fail 1
between c and u they will be in range so stored as it is
but i is -16
converted to 2 complement n become -32
thats y
On Sat, Oct 8, 2011 at 2:02 AM, Rahul Tiwari rahultiwari6...@gmail.comwrote:
o/p - fail1
pass2
xplaination - as char range = (-127 to +127) so char c=-64
Humble query to Admin: Is this question still relevant to this group by now
when interview-street is running properly?
On Thu, Oct 6, 2011 at 2:26 AM, htross htb...@gmail.com wrote:
Does anybody know what kind of questions are asked in ivy comptech???
''
--
You received this message because
@Ankur: +1
On Fri, Oct 7, 2011 at 8:44 PM, Ankur Garg ankurga...@gmail.com wrote:
To do inplace stack reversal u need a mechanism by which u can transfer the
first node to last of the stack making sure u have count of other nodes
here
Say u have stack
5- top
4
3
2
1
The answer
try this..after passing root pointer and 0 to the function
void summer(node *r,int sum)
{
if(r)
{
if(!r-left !r-right)
{
coutsum+r-dataendl;
return;
}
summer(r-left,sum+(r-data));
57 matches
Mail list logo
