You can use mutex instead of semaphores if you need to execute only one
case at a time.
FROM,
V.VIGNESH.
M.Sc Theoretical Computer Science.
PSG College of Technology
On 25 November 2012 22:37, jagannath wrote:
> Folks, I have one pthread question.I know that its not the right place but
> i t
Hai i tried the same in TC compiler. i got the output as 17. I guess the
output should be 17 as explained by Prateek Jain
On 30 May 2012 02:26, rahul ranjan wrote:
> it first calculates from right to left and then performs addition
> so after a++ its still 4(with a promise to increment
Hai
Can you brief about the rest of the cases?
On 4 May 2012 01:56, Umer Farooq wrote:
> Hi friends!
>
> I hope that you are doing really good these days.
>
> I submitted my code on interviewstreet.com
>
> The problem statement can be found on
> https://www.interviewstreet.com/challenges/dashbo
FROM,
V.VIGNESH.
On 20 March 2012 17:58, Dheeraj Sharma wrote:
> How to check if one binary tree is a sub tree of other?
> Any Solution other then bruteforce?
> Prototype
> bool check(node *t1,node *subtree)
>
> --
> Sent from my mobile device
>
> *Dheeraj Sharma*
>
> --
> You received this me
