Re: [algogeeks] Need help

[Saurabh Paliwal]

Hi,
An approach could be to guess the answer `A` and check if in `A` time, all
the tasks can be completed.
For checking, just iterate through the k people, the number of tasks
completed would be `A`/k[i] (integer division) for everyone.
If sigma(`A`/k[i]) >= N, `A` works. Now do a binary search to find the
minimum `A` which works. The upper bound could be N*min(k[i]) giving all
tasks to be solved by the person which takes the least amount of time.

Time complexity will be k*log(N*min(k[i])

On Sun, Apr 22, 2018 at 1:58 PM, pawan yadav 
wrote:

> Hi All,
>
> Has anybody solved the following problem?
>
> https://www.careercup.com/question?id=5196860946907136
>
> -Pawan
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to algogeeks+unsubscr...@googlegroups.com.
>



-- 
 -Saurabh Paliwal

   B-Tech. Comp. Science and Engg.

   IIT ROORKEE

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

[algogeeks] Need help

[pawan yadav]

Hi All,

Has anybody solved the following problem?

https://www.careercup.com/question?id=5196860946907136

-Pawan

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

[algogeeks] Yo! Help me make a Music Video

[Shrey Choudhary]

Waddup guys,
Hope everything is fine at your end. So this is a personal mail, I'm
sending out. I've recently started my IndieGogo Crowdfunding Campaign for a
hip hop music video. I'm now taking my passion for rapping to another
level. It's just that I'm little short of funds. I need around 1000 to 1400
$ to come out with a good concept music video and hire promoters to do the
same.

The details of  the campaign can be found at this link.
https://www.indiegogo.com/projects/indian-hiphop-single-music-video/x/9462122

If you all believe in me, donate a dollar or two; that's mere ~Rs 120.
People smoke this much amount in one day.


PS: If you think am begging for money, then please you don't have to pay
anything. Don't even open the link and you can happily remove me from your
circle. Because am a friend asking for help from friends . Nothing else.




Regards
Shrey Choudhary
Mobile: +919953029023

The future belongs to those who believe in the beauty of their dreams -
Eleanor Roosevelt

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

RE: [algogeeks] Yo! Help me make a Music Video

[saurabh singh]

Nope. Forwarding this mail to a group with over 1 k members is definitely 
begging. It's shameless begging as it can get. No,Didn't bother to open the 
link. Also banning you from the group. 

-Original Message-
From: Shrey Choudhary choudharyshre...@gmail.com
Sent: ‎12/‎28/‎2014 4:52 PM
To: a.mat...@accenture.com a.mat...@accenture.com; Aadhaar Sharma 
aadhaar.r.sha...@gmail.com; Aakanksha Raghav aakanksha.rag...@gmail.com; 
abhijitcomplete . abhijitcompl...@gmail.com; Abhilash Rajpoot 
abhilashrajpoot.n...@gmail.com; Abhinav kapur abhinav.nit...@gmail.com; 
abhinay.mo...@tctinfotech.com abhinay.mo...@tctinfotech.com; 
admin.off...@oberoigroup.com admin.off...@oberoigroup.com; Airtel 
Presence airtelprese...@airtel.in; Akash Bajaj aks...@gmail.com; Akhil 
Saraf saraf.akhi...@gmail.com; algogeeks@googlegroups.com 
algogeeks@googlegroups.com; ami.ta...@gmail.com ami.ta...@gmail.com; 
Amit Goel amitgoel@gmail.com; Amit Kumar Singh 
amit.si...@99acres.com; Anjali Gupta anjaligupta@gmail.com; ankit 
malik ankitmal...@gmail.com; ankit verma a_verm...@yahoo.co.in; Ankit 
Yadav ankityadav27...@gmail.com; antriksh.c...@nic.in 
antriksh.c...@nic.in; Anurag Dak anurag...@gmail.com; Anurag Kundu 
anurag13ku...@gmail.com; anushree bhatt 1594anush...@gmail.com; aparna 
roy tnahps...@gmail.com; arjun singh arjun107...@gmail.com; Arpan 
Saxena arpan.sax...@naukri.com; arushi paliwal 
paliwalarush...@gmail.com; atam prakash atam...@gmail.com; Bhumika 
Sachdeva swtmit...@gmail.com; cyberbyte.literat...@gmail.com 
cyberbyte.literat...@gmail.com; danish.shab...@accenture.com 
danish.shab...@accenture.com; deep...@proteaminc.com 
deep...@proteaminc.com; Deepali Garg nikki.deep...@gmail.com; 
dhruv_mech...@yahoo.co.in dhruv_mech...@yahoo.co.in; ekta dwivedy 
ektadwiv...@gmail.com; fansofn...@gmail.com fansofn...@gmail.com; Gaurav 
Goel gaurav16g...@gmail.com; Gaurav Sharma gaurav07101...@gmail.com; 
Gaurav Walia gauravwalia2...@gmail.com; gnee...@amazon.com 
gnee...@amazon.com; Helios NITK helios12.n...@gmail.com; 
helios.nitk2...@gmail.com helios.nitk2...@gmail.com; Himsa Narzari 
himsa.narz...@gmail.com; i...@chillomrecordsindia.com 
i...@chillomrecordsindia.com; infotechnit...@googlegroups.com 
infotechnit...@googlegroups.com; intern...@tctinfotech.com 
intern...@tctinfotech.com; invest...@naukri.com invest...@naukri.com; 
Jasmine Gambhir gambhir.jasm...@gmail.com; Jitender Kumar 
jkjitenderkum...@gmail.com; jitenderchha...@gmail.com 
jitenderchha...@gmail.com; kamal khandelwal kkhandel...@gmail.com; 
Kanika Bansal kanikaban...@drishti-soft.com; Kashish Mittal 
kashishmitta...@gmail.com; khurana.prach...@yahoo.in 
khurana.prach...@yahoo.in; kriti.j...@99acres.com kriti.j...@99acres.com; 
Kunal Kapoor kunal.kap...@exlservice.com; Kunsana Tab 
kunalkapoo...@yahoo.com; larry.guill...@rackspace.com 
larry.guill...@rackspace.com; LOKESH GUPTA lokeshgupt...@gmail.com; 
Madhuresh Srivastava madhures...@gmail.com; Mamta Kayest 
mamta1987...@gmail.com; Manish Dhall manishdhal...@gmail.com; 
manishkam...@rediffmail.com manishkam...@rediffmail.com
Subject: [algogeeks] Yo! Help me make a Music Video

Waddup guys,

Hope everything is fine at your end. So this is a personal mail, I'm sending 
out. I've recently started my IndieGogo Crowdfunding Campaign for a hip hop 
music video. I'm now taking my passion for rapping to another level. It's just 
that I'm little short of funds. I need around 1000 to 1400 $ to come out with a 
good concept music video and hire promoters to do the same. 


The details of  the campaign can be found at this link. 
https://www.indiegogo.com/projects/indian-hiphop-single-music-video/x/9462122


If you all believe in me, donate a dollar or two; that's mere ~Rs 120. People 
smoke this much amount in one day. 




PS: If you think am begging for money, then please you don't have to pay 
anything. Don't even open the link and you can happily remove me from your 
circle. Because am a friend asking for help from friends . Nothing else.






Regards
Shrey Choudhary

Mobile: +919953029023



The future belongs to those who believe in the beauty of their dreams - 
Eleanor Roosevelt

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

[algogeeks] Need help on SPOJ(HASHIT)

[Amit]

Hello,
I have been trying to solve this http://www.spoj.com/problems/HASHIT/problem 
on SPOJ. I am getting Wrong Answer on submission, but my solution work fine 
on the sample.
Please tell me where I am wrong. Here http://ideone.com/lMSw94 is my code.

Thanks in advance.

Amit Tiwari
BIT Mesra

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

[algogeeks] Re: Help me find my Recursive algo complexity

[KK]

Hi Vicky.. Its O(n^K) as u are iterating over all the elements of array for 
each of the k element subset!!

On Monday, 8 October 2012 23:53:15 UTC+5:30, ((** VICKY **)) wrote:

 Hi, I wrote code for generating all possible sets of length k in a array 
 of length n. I did using recursion, but i'm not able to calc the 
 complexity systematically [image: :-/] Kindly help me.
  11:39 PM

 i.p {1,2,3,4,5} k =2
 o.p
 Vector has : 1 2 3 4 5  
 1 1 2 
 2 1 3 
 3 1 4 
 4 1 5 
 5 2 3 
 6 2 4 
 7 2 5 
 8 3 4 
 9 3 5 
 10 4 5 

 Approach:

 Assume I have a selected and remaining set, now initially all will be 
 remaining set and selected set= {}. 

 In first step pick 1 and grow recursion with it as root and pick 2,3,4,5 
 (n-1) as possible picks. Now print those sets since k=2(base case) is 
 reached. 
 Now grow recursion with 2 as root and 3,4,5 (n-2) as possible 
 picks(childs) print them. Repeat till i reach 5 where i have no children 
 possible as rem set is empty.   

 void print_all(vectorintsel,vectorintrem, int n){
 if(sel.size() == n)
 {
 static int cnt = 1;
 coutcnt++ ;
 for(int i = 0; i  n; i++)
 coutsel[i] ;
 coutendl;
 return;
 sel.erase(sel.begin(),sel.end());
 }
 for(int i = 0; i  rem.size(); i++)
 {
  
 vectorintnow,curr_sel;
 //for(int j = 0; j  i; j++)
   //  now.push_back(rem[j]);
 for(int j = i+1; jrem.size(); j++)
 now.push_back(rem[j]);
// coutnow has : ;
 //for(int i = 0; i  now.size(); i++)
   //  coutnow[i] ;
 //coutendl;
 for(int i = 0; i  sel.size(); i++)
 curr_sel.push_back(sel[i]);
 curr_sel.push_back(rem[i]);
 print_all(curr_sel,now,n);
 }}
  

 -- 
 Cheers,
  
   Vicky

  

-- 
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/-/GTlxcHY8JDYJ.
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] need help??

[b.raj kannan]

any body know about juniper networks internship written test pattern..
please 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 group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] need help??

[Ratan]

guys plzz help me wid the java book that i shld start ???

-- 
--
Ratan | Final Year | Information Technology | NIT ALLAHABAD

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] need help??

[Ravi Ranjan]

khalid mugal - A Programmers guide to Java certification

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] need help??

[Rohit Singhal]

the very best book...no doubt..Khalid Mughal.

On Sat, Sep 22, 2012 at 2:10 PM, Ravi Ranjan ravi.cool2...@gmail.comwrote:

 khalid mugal - A Programmers guide to Java certification

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Rohit Singhal
09211931609

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Need Help with PHP/HTML

[Nandita Raman]

Hello,

I am working on PHP/HTML/ XML-RPC.

I have a website, where one link shows the list of files as checkboxes and
a submit button below that.

I am stuck at point where when submit button is clicked, it has to go to
another .php page and execute whatever is there in that .php file.


Form intput type= method =post = I have tried and does not seem like
its working.

I would really appreciate any thoughts/inputs/help with this!

Thanks!

-- 

Regards,
Nandita

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need Help with PHP/HTML

[Vandana Bachani]

Hi,
You need to correct ur form tag. Try:
form name=somename id=someid method=post action=theotherfile.php

Thanks,
Vandana

On Mon, Jul 16, 2012 at 12:42 PM, Nandita Raman
nandita.rama...@gmail.comwrote:

 Hello,

 I am working on PHP/HTML/ XML-RPC.

 I have a website, where one link shows the list of files as checkboxes and
 a submit button below that.

 I am stuck at point where when submit button is clicked, it has to go to
 another .php page and execute whatever is there in that .php file.


 Form intput type= method =post = I have tried and does not seem
 like its working.

 I would really appreciate any thoughts/inputs/help with this!

 Thanks!

 --

 Regards,
 Nandita

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Vandana Bachani
Graduate Student, MSCE
Computer Science  Engineering Department
Texas AM University, College Station

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need Help with PHP/HTML

[Piyush]

connect ur form with the file you want to get redirected to by:

form method=POST action=NAME_OF_FILE.php
 input type=submit/
/form

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Help woth LISP

[Geoffrey Summerhayes]

Looks pretty standard. It starts by placing one queen on each square of the 
bottom row, then working up through the
rows trying to put a queen in each column. If it can place a queen it gets 
added as a possible solution.
The always test in the inner loop checks the 'rook' horizontal and then the 
'bishop' diagonal.
The bishop test is a bit tricky, it looks at (x rows up, y columns across 
from a previously placed queen)
If x and y are equal it's on the diagonal.

--
Geoffrey Summerhayes

On Sunday, July 8, 2012 8:00:54 PM UTC-4, Victor Manuel Grijalva Altamirano 
wrote:


 The next solve the problem of eight Queeen... but i don't undestand 
 it!!! can you explain me?

 (defun n-queens (n m)
   (
 
 if (= n 1)
 (loop for x from 1 to m collect (list x))
 
 
 (loop for sol in (n-queens (1- n) m) nconc
   (loop for col from 1 to m when
 (loop for row from 0 to (length sol) for c in sol
   always (and (/= col c)
   (/= (abs (- c col)) (1+ row)))
   finally (return (cons col sol))
 )
collect it
   )
  )
 )
  )




 -- 
 Victor Manuel Grijalva Altamirano
 Universidad Tecnologica de La Mixteca


-- 
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/-/qv0m-4stZdEJ.
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Please help in understanding this question. I have no answers just this question.

[Ashish Goel]

count island problem
On Jul 1, 2012, at 11:06 AM, Vikas wrote:

 Given matrix(screen black n white)..where 1 represents black dot and 0=white.
 there can b many images/objects in it..return list of coordinates for each 
 obkect..(Hint do BFS) 
 
 -- 
 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/-/3F5k2u0wwWwJ.
 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 at 
 http://groups.google.com/group/algogeeks?hl=en.

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Please help in understanding this question. I have no answers just this question.

[Vikas]

Given matrix(screen black n white)..where 1 represents black dot and 
0=white.
there can b many images/objects in it..return list of coordinates for each 
obkect..(Hint do BFS) 

-- 
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/-/3F5k2u0wwWwJ.
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Need help

[Rishabh Jain]

http://www.codechef.com/problems/VOTERS


Here is my solution
Dont know y i m getting Runtime error..plz check..

#includecstdio
#includealgorithm
using namespace std;
int main()
{
int a,b,c,x[50001],i;
int s[11],count;
s[11]=0;
count=0;
//freopen(fun.txt,r,stdin);
scanf(%d%d%d,a,b,c);
for(i=0;ia;i++)
{
scanf(%d,x[i]);
s[x[i]]++;
}
for(i=0;ib;i++)
{
scanf(%d,x[i]);
s[x[i]]++;
}
for(i=0;ic;i++)
{
scanf(%d,x[i]);
s[x[i]]++;
}
for(i=0;i10;i++)
{
if(s[i]1)
count++;
}
printf(%d\n,count);
for(i=0;i10;i++)
{
if(s[i]1)
printf(%d\n,i);
}
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 email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need help

[Kuldeep Gupta]

#includecstdio
using namespace std;
int a,b,c,x[51],i;
int s[101],count;
int main()
{


   scanf(%d%d%d,a,b,c);
   for(i=0;ia;i++)
   {
   scanf(%d,x[i]);
   s[x[i]]++;
   }
   for(i=0;ib;i++)
   {
   scanf(%d,x[i]);
   s[x[i]]++;
   }
   for(i=0;ic;i++)
   {
   scanf(%d,x[i]);
   s[x[i]]++;
   }
   for(i=0;i100;i++)
   {
   if(s[i]1)
   count++;
   }
   printf(%d\n,count);
   for(i=0;i100;i++)
   {
   if(s[i]1)
   printf(%d\n,i);
   }
   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 email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need help regarding threads

[Sagar Pareek]

It was telling that error after doing some modifications...
Yeah i think bharat u r saying correct...
I will try it...
Thanks for reply...

On Sat, Mar 31, 2012 at 11:45 AM, bharat b bagana.bharatku...@gmail.comwrote:

 u should get an error: argument of type ‘void* (TraCISagar::)(void*)’ does
 not match ‘void* (*)(void*)’ ...
 The function which is threaded should be either static or global in
 pthread implementation ...


 On Tue, Mar 27, 2012 at 7:20 PM, Sagar Pareek sagarpar...@gmail.comwrote:

 Thanks for reply
 but tell me two thing , is it true or not?
 is NULL is not equal to (void*)0 ??
 AND
 int a=20;
 int b=(int)a ;  // Whats wrong in here??

 Similarly for
 void * TraCISagar::sender(void* a);

 then while calling in pthread as
  pthread_create(thread1,NULL,(void*)sender,NULL)
 instead of
  pthread_create(thread1,NULL,sender,NULL);


 by the way i already implemented NULL instead of (void*)0
 and
 pthread_create(thread1,NULL,sender,NULL);

 But not getting why this problem is occurring?


 On Tue, Mar 27, 2012 at 8:37 AM, SAMM somnath.nit...@gmail.com wrote:

 Yaa Senthil is right , I overlooked it . In 3rd argument also it is
 expecting an address while u r passing the pointer .

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 **KIND REGARDS --
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --

 **Regards
 *
 * bagana.bharatku...@gmail.com

 Bharat B | M.Tech II  | C.S.E | IITM
 *
 *
 *Ph: +91 8056127652*


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
**KIND REGARDS --
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need help regarding threads

[bharat b]

u should get an error: argument of type ‘void* (TraCISagar::)(void*)’ does
not match ‘void* (*)(void*)’ ...
The function which is threaded should be either static or global in pthread
implementation ...

On Tue, Mar 27, 2012 at 7:20 PM, Sagar Pareek sagarpar...@gmail.com wrote:

 Thanks for reply
 but tell me two thing , is it true or not?
 is NULL is not equal to (void*)0 ??
 AND
 int a=20;
 int b=(int)a ;  // Whats wrong in here??

 Similarly for
 void * TraCISagar::sender(void* a);

 then while calling in pthread as
  pthread_create(thread1,NULL,(void*)sender,NULL)
 instead of
  pthread_create(thread1,NULL,sender,NULL);


 by the way i already implemented NULL instead of (void*)0
 and
 pthread_create(thread1,NULL,sender,NULL);

 But not getting why this problem is occurring?


 On Tue, Mar 27, 2012 at 8:37 AM, SAMM somnath.nit...@gmail.com wrote:

 Yaa Senthil is right , I overlooked it . In 3rd argument also it is
 expecting an address while u r passing the pointer .

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 **KIND REGARDS --
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 

**Regards
*
* bagana.bharatku...@gmail.com

Bharat B | M.Tech II  | C.S.E | IITM
*
*
*Ph: +91 8056127652*

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need help regarding threads

[Sagar Pareek]

Thanks for reply
but tell me two thing , is it true or not?
is NULL is not equal to (void*)0 ??
AND
int a=20;
int b=(int)a ;  // Whats wrong in here??

Similarly for
void * TraCISagar::sender(void* a);

then while calling in pthread as
 pthread_create(thread1,NULL,(void*)sender,NULL)
instead of
 pthread_create(thread1,NULL,sender,NULL);


by the way i already implemented NULL instead of (void*)0
and
pthread_create(thread1,NULL,sender,NULL);

But not getting why this problem is occurring?

On Tue, Mar 27, 2012 at 8:37 AM, SAMM somnath.nit...@gmail.com wrote:

 Yaa Senthil is right , I overlooked it . In 3rd argument also it is
 expecting an address while u r passing the pointer .

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
**KIND REGARDS --
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Need help regarding threads

[Sagar Pareek]

Hello all,
I need help regarding thread implementation in C++

Here is my sample code...

*class TraCISagar : public BasicModule1 {
public:
.
.
void activity();
void* sender(void*);
.
.
};

void* TraCISagar::sender(void* a)
{
.
.
.
}

void TraCISagar::activity()
{
  pthread_t thread1;
.
.
pthread_create(thread1,NULL,(void*)sender,(void*)0);   //problem coming
here
.
.
pthread_join(thread1,NULL);
}

int main()
{
.
.
.
.
}*

And error is invalid use of member (did you forget the ‘’ ?)
Do anyone of you know how to solve it?


-- 
**KIND REGARDS --
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need help regarding threads

[SAMM]

I think is error is in the 4th argument u r passing in this line *
pthread_create(thread1,NULL,(void*)sender,(void*)0);*

The 4th argument is expecting the address of the arguments , but the
address he is getting is 0 , which is not granted by OS . Tht address is
used by OS I guess .
Instead* (void*)0*  give it a shot with *NULL *. It should work.

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need help regarding threads

[Senthil Nathan]

The problem is with the third argument in

*pthread_create(thread1,NULL,(void*)sender,(void*)0);*
*
*
It should just be sender or sender.

*pthread_create(thread1,NULL,sender,(void*)0);*

Thanks,
Senthil.

On Mon, Mar 26, 2012 at 5:25 PM, Sagar Pareek sagarpar...@gmail.com wrote:

 Hello all,
 I need help regarding thread implementation in C++

 Here is my sample code...

 *class TraCISagar : public BasicModule1 {
 public:
 .
 .
 void activity();
 void* sender(void*);
 .
 .
 };

 void* TraCISagar::sender(void* a)
 {
 .
 .
 .
 }

 void TraCISagar::activity()
 {
   pthread_t thread1;
 .
 .
 pthread_create(thread1,NULL,(void*)sender,(void*)0);   //problem coming
 here
 .
 .
 pthread_join(thread1,NULL);
 }

 int main()
 {
 .
 .
 .
 .
 }*

 And error is invalid use of member (did you forget the ‘’ ?)
 Do anyone of you know how to solve it?


 --
 **KIND REGARDS --
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Need help regarding threads

[SAMM]

Yaa Senthil is right , I overlooked it . In 3rd argument also it is
expecting an address while u r passing the pointer .

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] GSOC help android app inventor

[Sourabh Chandak]

Hi Raghav,

I dont have much idea about the organisation. I gave a look at the idea
page while searching for an organisation to work for, and this is what I
could figure out.

The work you need to do for app inventor for GSoC is not android
application development. App inventor is for ones who dont know how to
code. The coding involved in it will not use the Android SDK rather it will
use Android NDK. As the idea page of the organization suggests, you need to
fill in the form they have provided. Checkout the code of app inventor and
try to see how things are implemented and try to figure out how you can
implement one of the ideas listed on the idea page.

Hope that make things a bit clear.

Regards,

On Thu, Mar 22, 2012 at 7:41 PM, Raghav Garg rock.ragha...@gmail.comwrote:

 *Hello,
 I am very much interested in android development and also i have made few
 apps with eclipse and also with app inventor.
 I need to know what else i can do to contribute in app inventor to get
 selected in GSOC besides from just filling the application.
 *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*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Sourabh Chandak

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] GSOC help android app inventor

[Raghav Garg]

Thanks..
I am trying to work with that code but there is no contact information
for that organisation( like irc channel, mailing list or facebook
page) so how could i contact them?

On 3/23/12, Sourabh Chandak sourabh3...@gmail.com wrote:
 Hi Raghav,

 I dont have much idea about the organisation. I gave a look at the idea
 page while searching for an organisation to work for, and this is what I
 could figure out.

 The work you need to do for app inventor for GSoC is not android
 application development. App inventor is for ones who dont know how to
 code. The coding involved in it will not use the Android SDK rather it will
 use Android NDK. As the idea page of the organization suggests, you need to
 fill in the form they have provided. Checkout the code of app inventor and
 try to see how things are implemented and try to figure out how you can
 implement one of the ideas listed on the idea page.

 Hope that make things a bit clear.

 Regards,

 On Thu, Mar 22, 2012 at 7:41 PM, Raghav Garg rock.ragha...@gmail.comwrote:

 *Hello,
 I am very much interested in android development and also i have made few
 apps with eclipse and also with app inventor.
 I need to know what else i can do to contribute in app inventor to get
 selected in GSOC besides from just filling the application.
 *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*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Sourabh Chandak

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
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*

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] GSOC help android app inventor

[Sourabh Chandak]

Google Group: app-inventor-open-source-...@googlegroups.com

On Fri, Mar 23, 2012 at 9:11 PM, Raghav Garg rock.ragha...@gmail.comwrote:

 Thanks..
 I am trying to work with that code but there is no contact information
 for that organisation( like irc channel, mailing list or facebook
 page) so how could i contact them?

 On 3/23/12, Sourabh Chandak sourabh3...@gmail.com wrote:
  Hi Raghav,
 
  I dont have much idea about the organisation. I gave a look at the idea
  page while searching for an organisation to work for, and this is what I
  could figure out.
 
  The work you need to do for app inventor for GSoC is not android
  application development. App inventor is for ones who dont know how to
  code. The coding involved in it will not use the Android SDK rather it
 will
  use Android NDK. As the idea page of the organization suggests, you need
 to
  fill in the form they have provided. Checkout the code of app inventor
 and
  try to see how things are implemented and try to figure out how you can
  implement one of the ideas listed on the idea page.
 
  Hope that make things a bit clear.
 
  Regards,
 
  On Thu, Mar 22, 2012 at 7:41 PM, Raghav Garg rock.ragha...@gmail.com
 wrote:
 
  *Hello,
  I am very much interested in android development and also i have made
 few
  apps with eclipse and also with app inventor.
  I need to know what else i can do to contribute in app inventor to get
  selected in GSOC besides from just filling the application.
  *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*
 
   --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 
 
 
  --
  Sourabh Chandak
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 


 --
 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*

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Sourabh Chandak

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] GSOC help android app inventor

[Raghav Garg]

*Hello,
I am very much interested in android development and also i have made few
apps with eclipse and also with app inventor.
I need to know what else i can do to contribute in app inventor to get
selected in GSOC besides from just filling the application.
*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*

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] java help

[abhishek]

http://viralpatel.net/blogs/2009/01/how-to-take-screen-shots-in-java-taking-screenshots-java.html


On Fri, Feb 3, 2012 at 8:35 AM, Arun Vishwanathan aaron.nar...@gmail.comwrote:

 Hi,
 does anybody know how to take a screenshot of screen with java ?

 I also need help regarding storing the screenshot image into a doc file or
 so. Any suggestions?

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] java help

[Arun Vishwanathan]

Hi,
does anybody know how to take a screenshot of screen with java ?

I also need help regarding storing the screenshot image into a doc file or
so. Any suggestions?

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Help sourcebit !!!

[aditya kumar]

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 pattern, You should be able
 to think little logical and write normal JAVA programs like
 implementation of different sorting algorithm in java and finding
 regular expression in text file. This is only required, no need to
 panic. All the best.

 On Oct 5, 5:31 pm, praveen raj praveen0...@gmail.com wrote:
  Plz put the technical written paper pattern ...of sourcebit... and some
  sample papers...of what type of questions(level) would be asked...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Help sourcebit !!!

[raman shukla]

Hey mate dont worry there is nothing like pattern, You should be able
to think little logical and write normal JAVA programs like
implementation of different sorting algorithm in java and finding
regular expression in text file. This is only required, no need to
panic. All the best.

On Oct 5, 5:31 pm, praveen raj praveen0...@gmail.com wrote:
 Plz put the technical written paper pattern ...of sourcebit... and some
 sample papers...of what type of questions(level) would be asked...

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Sapient Help!!

[Prags]

@Akanksha- thank u

On Mon, Oct 3, 2011 at 7:10 PM, Akanksha . akanksha...@gmail.com wrote:

 In the technical interview round dey asked me questions on bst
 searching, hashing, triggers n other ques in dbms, writing a query, 2
 puzzles n some ques on OS which i dnt remember.. n in the HR interview
 round, dey asked me specifically abt my projects n others things dat
 were der in my resume..

 On Mon, Oct 3, 2011 at 6:09 PM, rajul jain rajuljain...@gmail.com wrote:
  Hi akanksha
  Thanks for your information .Today i have cleared my written, can you
 please
  share some information about both interview process specifically that
  attribute round  what sort of question they asked in that interview.
  Rajul
 
  On Fri, Sep 30, 2011 at 5:35 PM, Akanksha . akanksha...@gmail.com
 wrote:
 
  I m a 2011 passout n sapient had visited my clg in jan 2011.. first of
  all, u ll go thru a written test consising of apti ( quant, logical
  reasoning n english ) and one paper of c,ds n c++ combined... den u r
  shortlisted for technical interview in which dey ask u some puzzles n
  ques related to dbms, ds, os etc(depends on ur inteviewer),once u
  clear ur technical round, u ll hav a hr interview which is also an
  elimination round.. so prepare well n all d best :)
 
  On Fri, Sep 30, 2011 at 4:59 PM, Prags onlypr...@gmail.com wrote:
   @Akaknsha- hv sapient visited ur college ?? if yes , then what is its
   procedure ?
  
   On Wed, Sep 28, 2011 at 9:32 PM, Akanksha . akanksha...@gmail.com
   wrote:
  
   wrk culture is gud mostly.. if u want to do gud technical wrk den
   avoid dis company otherwise if u r interested in management or
 nething
   like dat den u can go for it..
  
   On Wed, Sep 28, 2011 at 8:15 PM, rohit rajuljain...@gmail.com
 wrote:
Is anybody know about sapient working culture?
   
--
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 at
http://groups.google.com/group/algogeeks?hl=en.
   
   
  
   --
   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 at
   http://groups.google.com/group/algogeeks?hl=en.
  
  
   --
   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 at
   http://groups.google.com/group/algogeeks?hl=en.
  
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] DP Help...

[Vikram Singh]

any one give a good link to study Dynamic Programming concepts??

--Regards
Vikram

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] c help

[rahul sharma]

% p prints the corresponding argument that is pointer.can nyone given an
xample plz?

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Sapient Help!!

[rajul jain]

Hi akanksha
Thanks for your information .Today i have cleared my written, can you please
share some information about both interview process specifically that
attribute round  what sort of question they asked in that interview.

Rajul

On Fri, Sep 30, 2011 at 5:35 PM, Akanksha . akanksha...@gmail.com wrote:

 I m a 2011 passout n sapient had visited my clg in jan 2011.. first of
 all, u ll go thru a written test consising of apti ( quant, logical
 reasoning n english ) and one paper of c,ds n c++ combined... den u r
 shortlisted for technical interview in which dey ask u some puzzles n
 ques related to dbms, ds, os etc(depends on ur inteviewer),once u
 clear ur technical round, u ll hav a hr interview which is also an
 elimination round.. so prepare well n all d best :)

 On Fri, Sep 30, 2011 at 4:59 PM, Prags onlypr...@gmail.com wrote:
  @Akaknsha- hv sapient visited ur college ?? if yes , then what is its
  procedure ?
 
  On Wed, Sep 28, 2011 at 9:32 PM, Akanksha . akanksha...@gmail.com
 wrote:
 
  wrk culture is gud mostly.. if u want to do gud technical wrk den
  avoid dis company otherwise if u r interested in management or nething
  like dat den u can go for it..
 
  On Wed, Sep 28, 2011 at 8:15 PM, rohit rajuljain...@gmail.com wrote:
   Is anybody know about sapient working culture?
  
   --
   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 at
   http://groups.google.com/group/algogeeks?hl=en.
  
  
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Sapient Help!!

[Akanksha .]

In the technical interview round dey asked me questions on bst
searching, hashing, triggers n other ques in dbms, writing a query, 2
puzzles n some ques on OS which i dnt remember.. n in the HR interview
round, dey asked me specifically abt my projects n others things dat
were der in my resume..

On Mon, Oct 3, 2011 at 6:09 PM, rajul jain rajuljain...@gmail.com wrote:
 Hi akanksha
 Thanks for your information .Today i have cleared my written, can you please
 share some information about both interview process specifically that
 attribute round  what sort of question they asked in that interview.
 Rajul

 On Fri, Sep 30, 2011 at 5:35 PM, Akanksha . akanksha...@gmail.com wrote:

 I m a 2011 passout n sapient had visited my clg in jan 2011.. first of
 all, u ll go thru a written test consising of apti ( quant, logical
 reasoning n english ) and one paper of c,ds n c++ combined... den u r
 shortlisted for technical interview in which dey ask u some puzzles n
 ques related to dbms, ds, os etc(depends on ur inteviewer),once u
 clear ur technical round, u ll hav a hr interview which is also an
 elimination round.. so prepare well n all d best :)

 On Fri, Sep 30, 2011 at 4:59 PM, Prags onlypr...@gmail.com wrote:
  @Akaknsha- hv sapient visited ur college ?? if yes , then what is its
  procedure ?
 
  On Wed, Sep 28, 2011 at 9:32 PM, Akanksha . akanksha...@gmail.com
  wrote:
 
  wrk culture is gud mostly.. if u want to do gud technical wrk den
  avoid dis company otherwise if u r interested in management or nething
  like dat den u can go for it..
 
  On Wed, Sep 28, 2011 at 8:15 PM, rohit rajuljain...@gmail.com wrote:
   Is anybody know about sapient working culture?
  
   --
   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 at
   http://groups.google.com/group/algogeeks?hl=en.
  
  
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] c help

[Hatta]

#include stdio.h
int main(void) {
   int x = 10;
   int *p = malloc(16);

   printf(%p %p\n, x, p);
   return 0;
}

first will print an address in the stack
second an address in heap

no big deal, uh? :)

On Mon, Oct 3, 2011 at 7:28 AM, rahul sharma rahul23111...@gmail.com wrote:
 % p prints the corresponding argument that is pointer.can nyone given an
 xample plz?

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Hatta

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] quinstreet help......

[sush57]

can anyone post recruitment process of QuinStreet...that company is
coming on 19th oct...plz help friends..what type of questions can be
expectedplz help...thanks in advance

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] STRING help

[rahul vatsa]

c style string is just the char array which is null terminated.

On Fri, Sep 30, 2011 at 1:27 AM, rahul sharma rahul23111...@gmail.comwrote:

 what is c style string??n wats diff b/w c and c++ strings
 representtaion..

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Sapient Help!!

[Prags]

@Akaknsha- hv sapient visited ur college ?? if yes , then what is its
procedure ?

On Wed, Sep 28, 2011 at 9:32 PM, Akanksha . akanksha...@gmail.com wrote:

 wrk culture is gud mostly.. if u want to do gud technical wrk den
 avoid dis company otherwise if u r interested in management or nething
 like dat den u can go for it..

 On Wed, Sep 28, 2011 at 8:15 PM, rohit rajuljain...@gmail.com wrote:
  Is anybody know about sapient working culture?
 
  --
  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 at
 http://groups.google.com/group/algogeeks?hl=en.
 
 

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Sapient Help!!

[Akanksha .]

I m a 2011 passout n sapient had visited my clg in jan 2011.. first of
all, u ll go thru a written test consising of apti ( quant, logical
reasoning n english ) and one paper of c,ds n c++ combined... den u r
shortlisted for technical interview in which dey ask u some puzzles n
ques related to dbms, ds, os etc(depends on ur inteviewer),once u
clear ur technical round, u ll hav a hr interview which is also an
elimination round.. so prepare well n all d best :)

On Fri, Sep 30, 2011 at 4:59 PM, Prags onlypr...@gmail.com wrote:
 @Akaknsha- hv sapient visited ur college ?? if yes , then what is its
 procedure ?

 On Wed, Sep 28, 2011 at 9:32 PM, Akanksha . akanksha...@gmail.com wrote:

 wrk culture is gud mostly.. if u want to do gud technical wrk den
 avoid dis company otherwise if u r interested in management or nething
 like dat den u can go for it..

 On Wed, Sep 28, 2011 at 8:15 PM, rohit rajuljain...@gmail.com wrote:
  Is anybody know about sapient working culture?
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] stack help

[rahul sharma]

hw will u design a stack which will have push pop and min fxn...all should
operate in o(1) tymreplyn asap

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] stack help

[sukran dhawan]

already discussed.search in archives

On Fri, Sep 30, 2011 at 6:29 PM, rahul sharma rahul23111...@gmail.comwrote:

 hw will u design a stack which will have push pop and min fxn...all should
 operate in o(1) tymreplyn asap

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] stack help

[rahul sharma]

plz post link as m not able to find it

On Fri, Sep 30, 2011 at 7:17 PM, sukran dhawan sukrandha...@gmail.comwrote:

 already discussed.search in archives

 On Fri, Sep 30, 2011 at 6:29 PM, rahul sharma rahul23111...@gmail.comwrote:

 hw will u design a stack which will have push pop and min fxn...all should
 operate in o(1) tymreplyn asap

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] stack help

[Shravan Kumar]

http://groups.google.com/group/algogeeks/browse_thread/thread/1dd628ee5e7939da/decedd114a26e564?hl=enlnk=gstq=stack+problem#

On Fri, Sep 30, 2011 at 7:41 PM, rahul sharma rahul23111...@gmail.comwrote:

 plz post link as m not able to find it


 On Fri, Sep 30, 2011 at 7:17 PM, sukran dhawan sukrandha...@gmail.comwrote:

 already discussed.search in archives

 On Fri, Sep 30, 2011 at 6:29 PM, rahul sharma rahul23111...@gmail.comwrote:

 hw will u design a stack which will have push pop and min fxn...all
 should operate in o(1) tymreplyn asap

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] STRING help

[rahul sharma]

what is c style string??n wats diff b/w c and c++ strings
representtaion..

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] help help

[abhishek iyer]

http://www.fileserve.com/file/eBgSThF/How%20To%20Prepare%20For%20Qt%20Apt%20For%20Cat%202E%20By%20Sharma.pdf


On Tue, Sep 27, 2011 at 4:23 AM, SHUBHAM BANSAL
shubham.bans...@gmail.comwrote:

 If anyone have E-book of Quantative Aptitude For CAT by Arun Sharma.??
 Then kindly send to my email.or send me link if any 1 hav..Shubham
 bansal
 contact no. 7206338328
 NIT Kurukshetra
 Computer Engineering
 (Final year)

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Thanks  Regards
Abhishek Iyer

If You Obey All the Rules, You Will Miss All the Fun. 

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Sapient Help!!

[rohit]

Is anybody know about sapient working culture?

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Sapient Help!!

[Akanksha .]

wrk culture is gud mostly.. if u want to do gud technical wrk den
avoid dis company otherwise if u r interested in management or nething
like dat den u can go for it..

On Wed, Sep 28, 2011 at 8:15 PM, rohit rajuljain...@gmail.com wrote:
 Is anybody know about sapient working culture?

 --
 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 at 
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] symantec help...

[sush57]

can anyone tell about placement process of symantec,pune...they are
comin for our campus on 30th of this month...pls help...if symantec
has already visited ur campus pls do put few types of questions that
were asked...it would be really helpful...


regards,
s.sushaanth
BE-computer science
Madras Institute Of Technology

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[rohit jangid]

got 45 on linux
than tried with fflush(stdout) and got 9 which is correct . so I guess that
both child and parent process getting the same buffer and thus resulting in
more number of hello

correct answer is 9 as already mentioned
On Sep 21, 2011 7:57 PM, sush57 sushaant...@gmail.com wrote:
 main()
 {
 int tmp;
 for(i=0;i9;i++)
 {
 tmp=fork();
 if(tmp0)
 break;
 printf(Hello);
 }
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] plz help

[sush57]

main()
{
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
}


what's the output and how does this work

can u give few other questions using fork...

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[Saravana kumar]

Hello will be printed 45 times...

On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.com wrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[Anil Arya]

http://ideone.com/nkTVN

On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar saravana@gmail.comwrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.com wrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
*Anil  Arya,
Computer Science *
*Motilal Nehru National Institute of Technology,Allahabad .
*

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[ravi maggon]

Output Hello printed 10 times. Since form command spawns the process, so for
every call their are two process created and since if process gets
successfully created fork returns some positive no. which is the process id,
so it will break the loop and finally only the 10 child processes will be
left which will print Hello 10 times. I hope that I cleared your doubt.

On Thu, Sep 22, 2011 at 12:03 AM, Anil Arya anilarya...@gmail.com wrote:

 http://ideone.com/nkTVN


 On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar 
 saravana@gmail.comwrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.com wrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University

www.algorithmguru.com

*Failure is the opportunity to begin again more intelligently*

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[Rashmi Jain]

@ravi
can u plz explain how 10 processes are created..? shouldn't it be 9..??

On Thu, Sep 22, 2011 at 12:23 AM, ravi maggon maggonr...@gmail.com wrote:

 Output Hello printed 10 times. Since form command spawns the process, so
 for every call their are two process created and since if process gets
 successfully created fork returns some positive no. which is the process id,
 so it will break the loop and finally only the 10 child processes will be
 left which will print Hello 10 times. I hope that I cleared your doubt.


 On Thu, Sep 22, 2011 at 12:03 AM, Anil Arya anilarya...@gmail.com wrote:

 http://ideone.com/nkTVN


 On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar 
 saravana@gmail.comwrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.com wrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[ravi maggon]

ohh sorry, I thought it was i=9. Yes only 9 times Hello will be printed.

On Thu, Sep 22, 2011 at 12:52 AM, Rashmi Jain rashmi.jain...@gmail.comwrote:

 @ravi
 can u plz explain how 10 processes are created..? shouldn't it be 9..??

 On Thu, Sep 22, 2011 at 12:23 AM, ravi maggon maggonr...@gmail.comwrote:

 Output Hello printed 10 times. Since form command spawns the process, so
 for every call their are two process created and since if process gets
 successfully created fork returns some positive no. which is the process id,
 so it will break the loop and finally only the 10 child processes will be
 left which will print Hello 10 times. I hope that I cleared your doubt.


 On Thu, Sep 22, 2011 at 12:03 AM, Anil Arya anilarya...@gmail.comwrote:

 http://ideone.com/nkTVN


 On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar saravana@gmail.com
  wrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.com wrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University

www.algorithmguru.com

*Failure is the opportunity to begin again more intelligently*

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[Rashmi Jain]

@ravi: thanks..!!

On Thu, Sep 22, 2011 at 12:54 AM, ravi maggon maggonr...@gmail.com wrote:

 ohh sorry, I thought it was i=9. Yes only 9 times Hello will be printed.

 On Thu, Sep 22, 2011 at 12:52 AM, Rashmi Jain rashmi.jain...@gmail.comwrote:

 @ravi
 can u plz explain how 10 processes are created..? shouldn't it be 9..??

 On Thu, Sep 22, 2011 at 12:23 AM, ravi maggon maggonr...@gmail.comwrote:

 Output Hello printed 10 times. Since form command spawns the process, so
 for every call their are two process created and since if process gets
 successfully created fork returns some positive no. which is the process id,
 so it will break the loop and finally only the 10 child processes will be
 left which will print Hello 10 times. I hope that I cleared your doubt.


 On Thu, Sep 22, 2011 at 12:03 AM, Anil Arya anilarya...@gmail.comwrote:

 http://ideone.com/nkTVN


 On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar 
 saravana@gmail.com wrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.com wrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[teja bala]

@ ravi but compile it on http://ideone.com/nkTVN  it showing 45 hello plz do
look at it...

On Thu, Sep 22, 2011 at 12:59 AM, Rashmi Jain rashmi.jain...@gmail.comwrote:

 @ravi: thanks..!!


 On Thu, Sep 22, 2011 at 12:54 AM, ravi maggon maggonr...@gmail.comwrote:

 ohh sorry, I thought it was i=9. Yes only 9 times Hello will be printed.

 On Thu, Sep 22, 2011 at 12:52 AM, Rashmi Jain 
 rashmi.jain...@gmail.comwrote:

 @ravi
 can u plz explain how 10 processes are created..? shouldn't it be 9..??

 On Thu, Sep 22, 2011 at 12:23 AM, ravi maggon maggonr...@gmail.comwrote:

 Output Hello printed 10 times. Since form command spawns the process, so
 for every call their are two process created and since if process gets
 successfully created fork returns some positive no. which is the process 
 id,
 so it will break the loop and finally only the 10 child processes will be
 left which will print Hello 10 times. I hope that I cleared your doubt.


 On Thu, Sep 22, 2011 at 12:03 AM, Anil Arya anilarya...@gmail.comwrote:

 http://ideone.com/nkTVN


 On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar 
 saravana@gmail.com wrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.comwrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[ravi maggon]

This is the output I am getting

   -

   result: Success time: 0smemory: 1720 kB returned value: 0
input: no
output:

   HelloHelloHelloHelloHelloHelloHelloHelloHelloHello




On Thu, Sep 22, 2011 at 1:40 AM, teja bala pawanjalsa.t...@gmail.comwrote:

 @ ravi but compile it on http://ideone.com/nkTVN  it showing 45 hello plz
 do look at it...


 On Thu, Sep 22, 2011 at 12:59 AM, Rashmi Jain rashmi.jain...@gmail.comwrote:

 @ravi: thanks..!!


 On Thu, Sep 22, 2011 at 12:54 AM, ravi maggon maggonr...@gmail.comwrote:

 ohh sorry, I thought it was i=9. Yes only 9 times Hello will be printed.


 On Thu, Sep 22, 2011 at 12:52 AM, Rashmi Jain 
 rashmi.jain...@gmail.comwrote:

 @ravi
 can u plz explain how 10 processes are created..? shouldn't it be 9..??

 On Thu, Sep 22, 2011 at 12:23 AM, ravi maggon maggonr...@gmail.comwrote:

 Output Hello printed 10 times. Since form command spawns the process,
 so for every call their are two process created and since if process gets
 successfully created fork returns some positive no. which is the process 
 id,
 so it will break the loop and finally only the 10 child processes will be
 left which will print Hello 10 times. I hope that I cleared your doubt.


 On Thu, Sep 22, 2011 at 12:03 AM, Anil Arya anilarya...@gmail.comwrote:

 http://ideone.com/nkTVN


 On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar 
 saravana@gmail.com wrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.comwrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 

Re: [algogeeks] plz help

[Rashmi Jain]

but in this output 10  times hello is printed..how..??

On Thu, Sep 22, 2011 at 1:52 AM, ravi maggon maggonr...@gmail.com wrote:

 This is the output I am getting

-

result: Success time: 0smemory: 1720 kB returned value: 0
 input: no
 output:

HelloHelloHelloHelloHelloHelloHelloHelloHelloHello




 On Thu, Sep 22, 2011 at 1:40 AM, teja bala pawanjalsa.t...@gmail.comwrote:

 @ ravi but compile it on http://ideone.com/nkTVN  it showing 45 hello plz
 do look at it...


 On Thu, Sep 22, 2011 at 12:59 AM, Rashmi Jain 
 rashmi.jain...@gmail.comwrote:

 @ravi: thanks..!!


 On Thu, Sep 22, 2011 at 12:54 AM, ravi maggon maggonr...@gmail.comwrote:

 ohh sorry, I thought it was i=9. Yes only 9 times Hello will be
 printed.

 On Thu, Sep 22, 2011 at 12:52 AM, Rashmi Jain rashmi.jain...@gmail.com
  wrote:

 @ravi
 can u plz explain how 10 processes are created..? shouldn't it be 9..??

 On Thu, Sep 22, 2011 at 12:23 AM, ravi maggon maggonr...@gmail.comwrote:

 Output Hello printed 10 times. Since form command spawns the process,
 so for every call their are two process created and since if process gets
 successfully created fork returns some positive no. which is the process 
 id,
 so it will break the loop and finally only the 10 child processes will be
 left which will print Hello 10 times. I hope that I cleared your doubt.


 On Thu, Sep 22, 2011 at 12:03 AM, Anil Arya anilarya...@gmail.comwrote:

 http://ideone.com/nkTVN


 On Wed, Sep 21, 2011 at 11:43 PM, Saravana kumar 
 saravana@gmail.com wrote:

 Hello will be printed 45 times...


 On Wed, Sep 21, 2011 at 7:57 PM, sush57 sushaant...@gmail.comwrote:

 main()
 {
int tmp;
for(i=0;i9;i++)
{
tmp=fork();
if(tmp0)
break;
printf(Hello);
}
 }


 what's the output and how does this work

 can u give few other questions using fork...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Regards
 Ravi Maggon
 B.E. CSE, Final Year
 Thapar University

 www.algorithmguru.com

 *Failure is the opportunity to begin again more intelligently*

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 

[algogeeks] PLEASE HELP ME - Party Lamps

[Blackwizard]

I've read this following solution from USACO for IOI98 - Party Lamps
problem..but I don't know why 2^4 and I don't know why the complete
search works for this problem...!!!
I didn't get exactly what it say...
Can anybody help me to understand it?

Thanks...



IOI 98 - Party Lamps:

http://olympiads.win.tue.nl/ioi/ioi98/contest/day1/party/party.html


USACO solution with compelete search:

You are given N lamps and four switches. The first switch toggles all
lamps, the second the even lamps, the third the odd lamps, and last
switch toggles lamps 1, 4, 7, 10, ... .
Given the number of lamps, N, the number of button presses made (up to
10,000), and the state of some of the lamps (e.g., lamp 7 is off),
output all the possible states the lamps could be in.
Naively, for each button press, you have to try 4 possibilities, for a
total of 41 (about 106020 ), which means there's no way you could
do complete search (this particular algorithm would exploit
recursion).
Noticing that the order of the button presses does not matter gets
this number down to about 14 (about 1016 ), still too big to
completely search (but certainly closer by a factor of over 106000 ).
However, pressing a button twice is the same as pressing the button no
times, so all you really have to check is pressing each button either
0 or 1 times. That's only 24 = 16 possibilities, surely a number of
iterations solvable within the time limit.

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] plz help...

[Tushar Kanta Rath]

hello,

i want a good reference in web designing.can anyone plzz help me
with some good links, for reference..

plzz its urgent

Thanks in Advance

-- 
Tushar Kanta Rath,
Master In Computer Application
MNNIT, Allahabad

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: help

[DIVIJ WADHAWAN]

Try material of MBA coaching institutes wiz Career Launcher,Time
etc

On Sep 12, 6:11 pm, wellwisher p9047551...@gmail.com wrote:
 please suggest me some good aptitude books

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: help

[mithun bs]

Quantitative Aptitude by R.S.Agarwal.

On Tue, Sep 13, 2011 at 2:12 PM, DIVIJ WADHAWAN divij...@gmail.com wrote:

 Try material of MBA coaching institutes wiz Career Launcher,Time
 etc

 On Sep 12, 6:11 pm, wellwisher p9047551...@gmail.com wrote:
  please suggest me some good aptitude books

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Mithun.B.S
M:9916775380

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] need help

[payal gupta]

+1 techcoder,plzzz mail me 2..thanks in advance
Regards,
Payal Gupta


On Mon, Sep 12, 2011 at 11:01 AM, sukran dhawan sukrandha...@gmail.comwrote:

 +1 to tech coder

 On Mon, Sep 12, 2011 at 10:50 AM, tech coder techcoderonw...@gmail.comwrote:

 if somebody has the preparation material  and videos provided by
 Careercup.com. Then please send me.
 thanks.

 --
 tech codYou 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] need help

[tech coder]

if somebody has the preparation material  and videos provided by
Careercup.com. Then please send me.
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] need help

[sukran dhawan]

+1 to tech coder

On Mon, Sep 12, 2011 at 10:50 AM, tech coder techcoderonw...@gmail.comwrote:

 if somebody has the preparation material  and videos provided by
 Careercup.com. Then please send me.
 thanks.

 --
 tech codYou 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] plz help for C output

[abhishek]

(a)

#define f(g,g2) g##g2
int main()
{
  int var12=100;
  printf(%d,f(var,12));
getch();
}

what will be the output??

(b)

main()
{
int i=400,j-300;
printf(%d...%d);
}

(c)

void main()
{
char far *farther,* farthest ;
printf(%d..%d,sizeof(father),sizeof(farthest));
}

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help for C output

[abhinav gupta]

a) 100

On Sat, Sep 10, 2011 at 12:40 AM, abhishek abhishek.ma...@gmail.com wrote:

 (a)

 #define f(g,g2) g##g2
 int main()
 {
  int var12=100;
  printf(%d,f(var,12));
getch();
}

 what will be the output??

 (b)

 main()
 {
 int i=400,j-300;
 printf(%d...%d);
 }

 (c)

 void main()
 {
 char far *farther,* farthest ;
 printf(%d..%d,sizeof(father),sizeof(farthest));
 }

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
@ |3  # ! /\/ @ \./

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help for C output

[parag khanna]

1. 100
2. 400...300
3. 4 .. 2




-- 
Parag Khanna
B.tech Final Year
NIT,Kurukshetra

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help for C output

[bharatkumar bagana]

2nd answer is compiler dependent ..i think so .. in gcc it gives garbage
values .

On Sat, Sep 10, 2011 at 3:51 AM, parag khanna khanna.para...@gmail.comwrote:



 1. 100
 2. 400...300
 3. 4 .. 2




 --
 Parag Khanna
 B.tech Final Year
 NIT,Kurukshetra


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 

**Please do not print this e-mail until urgent requirement. Go Green!!
Save Papers = Save Trees
*BharatKumar Bagana*
**http://www.google.com/profiles/bagana.bharatkumarhttp://www.google.com/profiles/bagana.bharatkumar
*
Mobile +91 8056127652*
bagana.bharatku...@gmail.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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help for C output

[Sajal Choudhary]

in #definef(g,g2) g##g2

the ## operator concatenate the 2 arguments in the macro expansion.
thus it becomes var12


-- 
Sajal Choudhary
Undergraduate Student,
Division of Computer Engineering,
Netaji Subhas Institute of Technology,
New Delhi.

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] plz help

[sush57]

If 5/2 artists make 5/2 paintings using 5/2 canvases in 5/2 days then
how many artists r
required to make 25 paintings using 25 canvases in 25 days?

some sayin 25,some sayin 1...can anyone pls explain the answer
for this puzzle...

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] plz help

[rahul vatsa]

i think it should be 1.
5/2 paintings r made by 5/2 ppl in 5/2 days  using 5/2 canvas
= 1 painting is made by 1 person in 1 day using 1 canvas

i.e. 1 guy cn make a painting in 1 day using a canvas.

Now, the other case, to make 25 paintings using 25 canvases in 25 days.

As there r 25 days  total paintings required is 25, so u need just 1 guy to
do that. u have here 25 canvases, bt he cn make using just 1.




On Wed, Sep 7, 2011 at 8:15 AM, sush57 sushaant...@gmail.com wrote:

 If 5/2 artists make 5/2 paintings using 5/2 canvases in 5/2 days then
 how many artists r
 required to make 25 paintings using 25 canvases in 25 days?

 some sayin 25,some sayin 1...can anyone pls explain the answer
 for this puzzle...

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] ubuntu help

[UTKARSH SRIVASTAV]

hi anyone knows how to play vlc in root .i know root  is
not allowed by default   but i want to know some mean

-- 
*UTKARSH SRIVASTAV
CSE-3
B-Tech 3rd Year
@MNNIT ALLAHABAD*

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] ubuntu help

[Saket Choudhary]

Just type vlc in terminal. Else if you want to run it as root : sudo vlc

Sent from my iPhone

On Sep 4, 2011, at 1:31 PM, UTKARSH SRIVASTAV usrivastav...@gmail.com wrote:

 hi anyone knows how to play vlc in root .i know root  is 
 not allowed by default   but i want to know some mean
 
 -- 
 UTKARSH SRIVASTAV
 CSE-3
 B-Tech 3rd Year
 @MNNIT ALLAHABAD
 
 
 -- 
 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 at 
 http://groups.google.com/group/algogeeks?hl=en.

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] PLz help urgent

[mani walia]

Guys american express coming to our college for training.

Plz anyone who  has faced the written test and procedure.. please share
their views.. it wud be helpful for us..



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.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] sql help

[jega...@gmail.com]

Pls have a look at this site...
sqlauthority.com
On 21-Aug-2011 11:44 AM, sachin sabbarwal algowithsac...@gmail.com
wrote:
 plz suggest some link where i can get questions on sql queries to
practice.
 thanks in advance!!

 --
 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 at
http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] amazon help

[Akash Mukherjee]

thanx...downloaded :)

On Fri, Aug 12, 2011 at 10:56 AM, coolfrog$ dixit.coolfrog.div...@gmail.com
 wrote:

 @all
 can some plz suggest the source for  where i can fine the dates and news
 regarding amazon off-campus Placements.

 On Fri, Aug 12, 2011 at 6:36 AM, Akash Mukherjee akash...@gmail.comwrote:

 Hi,

 Can anyone suggest from where I should practice for the online coding
 round for amazon off-campus placements. I am looking for similar problems 
 not for the environment.

 Thanx,

 Akash

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Divesh*
 (¨`·.·´¨) Always
   `·.¸(¨`·.·´¨ ) Keep
   (¨`·.·´¨)¸.·´Smiling!
`·.¸.·´ Life can give u 100's of reason 2cry,but u can give life 1000's

 of reasons 2Smile

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] amazon help

[Akash Mukherjee]

Hi,

Can anyone suggest from where I should practice for the online coding round
for amazon off-campus placements. I am looking for similar problems  not
for the environment.

Thanx,

Akash

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] amazon help

[Akash Mukherjee]

thanx :)

On Fri, Aug 12, 2011 at 7:51 AM, Prakash D cegprak...@gmail.com wrote:

 www.projecteuler.net


 On Fri, Aug 12, 2011 at 6:52 AM, Dipankar Patro dip10c...@gmail.comwrote:

 Topcoder will be a good option.

 Amazon mainly makes you write functions in which the parameters and
 structure of any user defined data types are clearly mentioned.
 Just coding on a normal computer will also help.

 Suggestion:
 Make sure you are accustomed with Tree programs,



 On 12 August 2011 06:36, Akash Mukherjee akash...@gmail.com wrote:

 Hi,

 Can anyone suggest from where I should practice for the online coding
 round for amazon off-campus placements. I am looking for similar problems 
 not for the environment.

 Thanx,

 Akash

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --

 ___

 Please do not print this e-mail until urgent requirement. Go Green!!
 Save Papers = Save Trees

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] amazon help

[siddharam suresh]

down load the book called
**Cracking the Coding Interview, Fourth Edition: 150 Programming Interview
Questions and Solutions*.*
*
*
it contains max salutions
Thank you,
Siddharam


On Fri, Aug 12, 2011 at 10:22 AM, Akash Mukherjee akash...@gmail.comwrote:

 thanx :)


 On Fri, Aug 12, 2011 at 7:51 AM, Prakash D cegprak...@gmail.com wrote:

 www.projecteuler.net


 On Fri, Aug 12, 2011 at 6:52 AM, Dipankar Patro dip10c...@gmail.comwrote:

 Topcoder will be a good option.

 Amazon mainly makes you write functions in which the parameters and
 structure of any user defined data types are clearly mentioned.
 Just coding on a normal computer will also help.

 Suggestion:
 Make sure you are accustomed with Tree programs,



 On 12 August 2011 06:36, Akash Mukherjee akash...@gmail.com wrote:

 Hi,

 Can anyone suggest from where I should practice for the online coding
 round for amazon off-campus placements. I am looking for similar problems 
 not for the environment.

 Thanx,

 Akash

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --

 ___

 Please do not print this e-mail until urgent requirement. Go Green!!
 Save Papers = Save Trees

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] amazon help

[siddharam suresh]

Thank you,
Siddharam


On Fri, Aug 12, 2011 at 10:34 AM, siddharam suresh
siddharam@gmail.comwrote:

 down load the book called
 **Cracking the Coding Interview, Fourth Edition: 150 Programming
 Interview Questions and Solutions*.*
 *
 *
 it contains max solutions
 Thank you,
 Siddharam



 On Fri, Aug 12, 2011 at 10:22 AM, Akash Mukherjee akash...@gmail.comwrote:

 thanx :)


 On Fri, Aug 12, 2011 at 7:51 AM, Prakash D cegprak...@gmail.com wrote:

 www.projecteuler.net


 On Fri, Aug 12, 2011 at 6:52 AM, Dipankar Patro dip10c...@gmail.comwrote:

 Topcoder will be a good option.

 Amazon mainly makes you write functions in which the parameters and
 structure of any user defined data types are clearly mentioned.
 Just coding on a normal computer will also help.

 Suggestion:
 Make sure you are accustomed with Tree programs,



 On 12 August 2011 06:36, Akash Mukherjee akash...@gmail.com wrote:

 Hi,

 Can anyone suggest from where I should practice for the online coding
 round for amazon off-campus placements. I am looking for similar problems 
 
 not for the environment.

 Thanx,

 Akash

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --

 ___

 Please do not print this e-mail until urgent requirement. Go Green!!
 Save Papers = Save Trees

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] amazon help

[coolfrog$]

@all
can some plz suggest the source for  where i can fine the dates and news
regarding amazon off-campus Placements.

On Fri, Aug 12, 2011 at 6:36 AM, Akash Mukherjee akash...@gmail.com wrote:

 Hi,

 Can anyone suggest from where I should practice for the online coding round
 for amazon off-campus placements. I am looking for similar problems  not
 for the environment.

 Thanx,

 Akash

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
*Divesh*
(¨`·.·´¨) Always
  `·.¸(¨`·.·´¨ ) Keep
  (¨`·.·´¨)¸.·´Smiling!
   `·.¸.·´ Life can give u 100's of reason 2cry,but u can give life 1000's
of reasons 2Smile

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[programming love]

@sagar and @brijesh: awesome explanation!!! too good! 1 doubt!

the question says it has only 28 leaves. According to uour explanations, it
has 81 leaves. how is it possible??

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Brijesh Upadhyay]

It could have a maximum of 81 leaves with the same '40' no of internal 
nodes so for any value between 28 to 81, it would have only 40 internal 
nodes

-- 
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/-/hb7mifIIe1kJ.
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[sagar pareek]

Excatly

why dont u just make a rough diagram in paper for binary and ternary trees

and just see that each level has max of 2/3^i   where 2/3 is for
binary/ternary tree and i is level where root level is 0...

then make a complete ternary tree and see why leaves with 28 in numbers have
internal nodes 40...
just do it and then u will learn

On Wed, Aug 10, 2011 at 4:58 PM, Brijesh Upadhyay 
brijeshupadhyay...@gmail.com wrote:

 It could have a maximum of 81 leaves with the same '40' no of internal
 nodes so for any value between 28 to 81, it would have only 40 internal
 nodes

 --
 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/-/hb7mifIIe1kJ.

 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[vamshi vijay]

@Sagar

See at level 4, 81 leaf  nodes are possible, since in question it has been
given 28 leaf  nodes, if i  use just 10 nodes from level 3 (27 nodes), i can
get 28 leaves, but if u observe the remaining 17 nodes in the 3rd level are
also becoming leaf nodes, but in question given as 28 leaf nodes..Plz
correct me.

What i feel is we can have 2 cases

1) Minimum internal nodes posible

If we can observe nodes pattern in each level

1
3
9
27

so in 4th level there are 27 leaf nodes, to get 28 leaf nodes, select one
from 27 nodes and add 2 childs, so total leaf nodes become (27-1)+2=28
In this case, internal nodes= 1+3+9+1=14

2) maximum internal nodes

in the 4th level, add one child to each node, we get 27 leaf nodes in 5th
level  and similarly select 1nodes  in 5th level and add 2 childs to make
nodes 28, now we have interal nodes= 1+3+9+27+1=41

Correct me if wrong...

On 10 August 2011 05:19, sagar pareek sagarpar...@gmail.com wrote:

 Excatly

 why dont u just make a rough diagram in paper for binary and ternary trees

 and just see that each level has max of 2/3^i   where 2/3 is for
 binary/ternary tree and i is level where root level is 0...

 then make a complete ternary tree and see why leaves with 28 in numbers
 have internal nodes 40...
 just do it and then u will learn


 On Wed, Aug 10, 2011 at 4:58 PM, Brijesh Upadhyay 
 brijeshupadhyay...@gmail.com wrote:

 It could have a maximum of 81 leaves with the same '40' no of internal
 nodes so for any value between 28 to 81, it would have only 40 internal
 nodes

 --
 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/-/hb7mifIIe1kJ.

 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
With Regards,
N.Vamshi Vijay,
Mtech,CSE
IIT Kharagpur
Mobile:-07501541110

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Pratz mary]

ya ur right!!!

On 10 August 2011 18:44, vamshi vijay vamshi1...@gmail.com wrote:

 @Sagar

 See at level 4, 81 leaf  nodes are possible, since in question it has been
 given 28 leaf  nodes, if i  use just 10 nodes from level 3 (27 nodes), i can
 get 28 leaves, but if u observe the remaining 17 nodes in the 3rd level are
 also becoming leaf nodes, but in question given as 28 leaf nodes..Plz
 correct me.

 What i feel is we can have 2 cases

 1) Minimum internal nodes posible

 If we can observe nodes pattern in each level

 1
 3
 9
 27

 so in 4th level there are 27 leaf nodes, to get 28 leaf nodes, select one
 from 27 nodes and add 2 childs, so total leaf nodes become (27-1)+2=28
 In this case, internal nodes= 1+3+9+1=14

 2) maximum internal nodes

 in the 4th level, add one child to each node, we get 27 leaf nodes in 5th
 level  and similarly select 1nodes  in 5th level and add 2 childs to make
 nodes 28, now we have interal nodes= 1+3+9+27+1=41

 Correct me if wrong...

 On 10 August 2011 05:19, sagar pareek sagarpar...@gmail.com wrote:

 Excatly

 why dont u just make a rough diagram in paper for binary and ternary trees

 and just see that each level has max of 2/3^i   where 2/3 is for
 binary/ternary tree and i is level where root level is 0...

 then make a complete ternary tree and see why leaves with 28 in numbers
 have internal nodes 40...
 just do it and then u will learn


 On Wed, Aug 10, 2011 at 4:58 PM, Brijesh Upadhyay 
 brijeshupadhyay...@gmail.com wrote:

 It could have a maximum of 81 leaves with the same '40' no of internal
 nodes so for any value between 28 to 81, it would have only 40 internal
 nodes

 --
 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/-/hb7mifIIe1kJ.

 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 With Regards,
 N.Vamshi Vijay,
 Mtech,CSE
 IIT Kharagpur
 Mobile:-07501541110

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
regards Pratima :)

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[sagar pareek]

gr8 work vamshi

but  total nodes will be
1+3+9+27+*2*(not 1)=42


On Wed, Aug 10, 2011 at 6:59 PM, Pratz mary pratima.m...@gmail.com wrote:

 ya ur right!!!


 On 10 August 2011 18:44, vamshi vijay vamshi1...@gmail.com wrote:

 @Sagar

 See at level 4, 81 leaf  nodes are possible, since in question it has been
 given 28 leaf  nodes, if i  use just 10 nodes from level 3 (27 nodes), i can
 get 28 leaves, but if u observe the remaining 17 nodes in the 3rd level are
 also becoming leaf nodes, but in question given as 28 leaf nodes..Plz
 correct me.

 What i feel is we can have 2 cases

 1) Minimum internal nodes posible

 If we can observe nodes pattern in each level

 1
 3
 9
 27

 so in 4th level there are 27 leaf nodes, to get 28 leaf nodes, select one
 from 27 nodes and add 2 childs, so total leaf nodes become (27-1)+2=28
 In this case, internal nodes= 1+3+9+1=14

 2) maximum internal nodes

 in the 4th level, add one child to each node, we get 27 leaf nodes in 5th
 level  and similarly select 1nodes  in 5th level and add 2 childs to make
 nodes 28, now we have interal nodes= 1+3+9+27+1=41

 Correct me if wrong...

 On 10 August 2011 05:19, sagar pareek sagarpar...@gmail.com wrote:

 Excatly

 why dont u just make a rough diagram in paper for binary and ternary
 trees

 and just see that each level has max of 2/3^i   where 2/3 is for
 binary/ternary tree and i is level where root level is 0...

 then make a complete ternary tree and see why leaves with 28 in numbers
 have internal nodes 40...
 just do it and then u will learn


 On Wed, Aug 10, 2011 at 4:58 PM, Brijesh Upadhyay 
 brijeshupadhyay...@gmail.com wrote:

 It could have a maximum of 81 leaves with the same '40' no of internal
 nodes so for any value between 28 to 81, it would have only 40 internal
 nodes

 --
 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/-/hb7mifIIe1kJ.

 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 With Regards,
 N.Vamshi Vijay,
 Mtech,CSE
 IIT Kharagpur
 Mobile:-07501541110

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 regards Pratima :)

  --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[programming love]

@sagar: Thanks again :) But my doubt is it'll have more than 28 leaf nodes
when the ques clearly sayd it shud have 28 leaf nodes.
@vamshi: I kind of agree with what you say.

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Preprocessor Help !!

[Abhishek Gupta]

Answer 2) To prevent use of NULL with any other variable instead of 0(zero), 
it is set at void pointer.
 for ex, you cannot use in C like this, a=b+NULL;
but, i think, in C++ you can do.

-- 
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/-/JEkkEmJOYkkJ.
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Gaurav Menghani]

I am just increasing the size of the current string by one. So that a
new character can be appended.

On Sat, Aug 6, 2011 at 11:01 AM, Tushar Bindal tushicom...@gmail.com wrote:
 @gaurav
 didn't get this:
 Just to increase the size of the string by one.

 Then you can put any character at the the new last position, which is 'l'.

 can u pls explain that?

 On Fri, Aug 5, 2011 at 2:57 PM, Nitin Nizhawan nitin.nizha...@gmail.com
 wrote:

 Ok, Thanks

 On Fri, Aug 5, 2011 at 2:53 PM, Gaurav Menghani
 gaurav.mengh...@gmail.com wrote:

 Even if the number of elements is more than two, it is possible with
 bitwise operations, but it gets clumsy.

 Suppose your alphabet has 4 characters. You can either:
 - Count from 0 to (14*n)-1 and use four bits to denote the selection
 of the alphabet. Also, only one bit amongst those four should be set.
 It is highly inefficient.
 - Keep n nested loops and inside each loop you iterate from 0 to
 (14)-1 and use the standard bitwise operations. The con here is that
 you have to hardcode the number of nested loops.

 On Fri, Aug 5, 2011 at 2:44 PM, Nitin Nizhawan nitin.nizha...@gmail.com
 wrote:
  @Varun  I think it can be done using bits, if input character set has
  only
  two elements. Or could u plz explain?
 
  On Fri, Aug 5, 2011 at 2:29 PM, Varun Jakhoria
  varunjakho...@gmail.com
  wrote:
 
  I think it can be done using bitwise ANDing with a mask
 
  On Fri, Aug 5, 2011 at 12:58 PM, Gaurav Menghani
  gaurav.mengh...@gmail.com wrote:
   An Implementation:
  
   #includeiostream
   #includestring
   using namespace std;
  
   string alphabet;
   int maxlen;
   void backtrack(string s,int l)
   {
    if(l==maxlen) { coutsendl; return; }
    s.push_back('-');
    for(int i=0;ialphabet.size();i++)
          { s[l]=alphabet[i]; backtrack(s,l+1); }
   }
  
   int main()
   {
    maxlen=3;
    alphabet=op;
    backtrack(,0);
    return 0;
   }
  
  
   On Fri, Aug 5, 2011 at 12:42 PM, Kamakshii Aggarwal
   kamakshi...@gmail.com wrote:
   @gaurav:i could not understand ur sol.can u explain it again..
  
   On Fri, Aug 5, 2011 at 12:32 PM, Gaurav Menghani
   gaurav.mengh...@gmail.com
   wrote:
  
   On Fri, Aug 5, 2011 at 12:20 PM, Kamakshii Aggarwal
   kamakshi...@gmail.com wrote:
given a set of letters and a length N, produce all possible
output.(Not
permutation). For example, give the letter (p,o) and length of
3,
produce
the following output(in any order you want, not just my example
order)
   
ppp ppo poo pop opp opo oop ooo
   
another example would be given (a,b) and length 2
   
answer: ab aa bb ba
   
--
Regards,
Kamakshi
kamakshi...@gmail.com
  
   This can be done easily by backtracking
  
   void backtrack(string s, int l)
   {
     if(l == maxlen) { coutsendl; return; }
  
     s.push_back('-');
     for(int i=0;ialphabet.size();i++)
     {
       s[l]=alphabet[i];
       backtrack(s,l+1);
     }
   }
  
   --
   Gaurav Menghani
  
   --
   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 at
   http://groups.google.com/group/algogeeks?hl=en.
  
  
  
  
   --
   Regards,
   Kamakshi
   kamakshi...@gmail.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
   algogeeks+unsubscr...@googlegroups.com.
   For more options, visit this group at
   http://groups.google.com/group/algogeeks?hl=en.
  
  
  
  
   --
   Gaurav Menghani
  
   --
   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 at
   http://groups.google.com/group/algogeeks?hl=en.
  
  
 
 
 
  --
  Varun Jakhoria
  ...it's only about 0's  1's
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 



 --
 Gaurav Menghani

 --
 You 

[algogeeks] output help

[Rohit Srivastava]

#includestdio.h
#includeconio.h

int main()
{
struct value
{
int bit1:1;
int bit3:4;
int bit4:4;
}bit={1,2,2};
printf(%d %d %d\n,bit.bit1,bit.bit3,bit.bit4);
getche();
return 0;
}
 the above code gives output : -1 2 2
any idea why???

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] output help

[aditi garg]

I think it is because bit1 is only 1 bit fwide and whn u initialize it to
1,since MSB is 1 it treats it as a negative integer...Plz correct me if i am
wrong...

On Tue, Aug 9, 2011 at 12:24 PM, Rohit Srivastava access2ro...@gmail.comwrote:

 #includestdio.h
 #includeconio.h

 int main()
 {
 struct value
 {
 int bit1:1;
 int bit3:4;
 int bit4:4;
 }bit={1,2,2};
 printf(%d %d %d\n,bit.bit1,bit.bit3,bit.bit4);
 getche();
 return 0;
 }
  the above code gives output : -1 2 2
 any idea why???

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Aditi Garg
Undergraduate Student
Electronics  Communication Divison
NETAJI SUBHAS INSTITUTE OF TECHNOLOGY
Sector 3, Dwarka
New Delhi

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] output help

[sanjay ahuja]

Int bit3:4 will be read as lower order 4 bits of bit3 and this will be
treated as int (signed). Thus lower order bit of bit3 which is 2, are
0010 which is 2
try with
1) int bit3:2, output will be -2
2) unsigned int bit3:2, output will be 2.

I hope it is cleared now

On 8/9/11, Rohit Srivastava access2ro...@gmail.com wrote:
 #includestdio.h
 #includeconio.h

 int main()
 {
 struct value
 {
 int bit1:1;
 int bit3:4;
 int bit4:4;
 }bit={1,2,2};
 printf(%d %d %d\n,bit.bit1,bit.bit3,bit.bit4);
 getche();
 return 0;
 }
  the above code gives output : -1 2 2
 any idea why???

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
Sent from my mobile device

Sanjay Ahuja,
Analyst, Financing Prime Brokerage
Nomura Securities India Pvt. Ltd

-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] output help

[Rohit Srivastava]

hey guys thanks got it!!


On Tue, Aug 9, 2011 at 12:49 PM, sanjay ahuja sanjayahuja.i...@gmail.comwrote:

 Int bit3:4 will be read as lower order 4 bits of bit3 and this will be
 treated as int (signed). Thus lower order bit of bit3 which is 2, are
 0010 which is 2
 try with
 1) int bit3:2, output will be -2
 2) unsigned int bit3:2, output will be 2.

 I hope it is cleared now

 On 8/9/11, Rohit Srivastava access2ro...@gmail.com wrote:
  #includestdio.h
  #includeconio.h
 
  int main()
  {
  struct value
  {
  int bit1:1;
  int bit3:4;
  int bit4:4;
  }bit={1,2,2};
  printf(%d %d %d\n,bit.bit1,bit.bit3,bit.bit4);
  getche();
  return 0;
  }
   the above code gives output : -1 2 2
  any idea why???
 
  --
  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 at
  http://groups.google.com/group/algogeeks?hl=en.
 
 

 --
 Sent from my mobile device

 Sanjay Ahuja,
 Analyst, Financing Prime Brokerage
 Nomura Securities India Pvt. Ltd

 --
 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 at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
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 at 
http://groups.google.com/group/algogeeks?hl=en.