[algogeeks] Tree Center Problem

[Nitin Nizhawan]

hi,

   given a tree with N nodes find the node such that its average total
distance from each other node is smallest

   i.e.  if nodes are labeled 0N-1 then
 find i such that[ SUM d(i, j ){0<=jhttp://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: IVY comptech????

[htross]

which college did it  come???was  it off campus or oncampus???

On Oct 6, 2:01 am, vijay singh  wrote:
> It asks questions from C, C++, DS, Java, Networking, Puzzles...
> Its basically an internet gaming company, so it asks for conceptualising and
> designing games using OOP concepts...

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

[ankit sablok]

take a look at this and this is exactly the reason why it works :)

http://stackoverflow.com/questions/3801557/can-we-change-the-value-of-a-constant-through-pointers

On Thu, Oct 6, 2011 at 9:55 AM, Raghav Garg  wrote:

> *it is perfectly working in turbo c. can anyone explain how it can change
> the value of constant variable.
> *Thanking you
>
> *With regards-
> Raghav garg
> Contact no. 9013201944
> www.facebook.com/rock.raghavag
> B. tech (IT), 5th sem
> University School Of Information Technology
> Guru Govind Singh Indraprastha University
> Delhi*
>
>
>
>
> On Thu, Oct 6, 2011 at 9:52 AM, SUDHIR RAHEJA <
> raheja.sudhirah...@gmail.com> wrote:
>
>> its working..
>>
>> #include
>> #include
>> int main()
>> {const int a=123;
>> printf("%d\n",a);
>>
>> *(int *)&a=345;
>> printf("%d",a);
>> getch();
>>
>> }
>>
>>  --
>> 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] Re: constant

[Raghav Garg]

*it is perfectly working in turbo c. can anyone explain how it can change
the value of constant variable.
*Thanking you

*With regards-
Raghav garg
Contact no. 9013201944
www.facebook.com/rock.raghavag
B. tech (IT), 5th sem
University School Of Information Technology
Guru Govind Singh Indraprastha University
Delhi*



On Thu, Oct 6, 2011 at 9:52 AM, SUDHIR RAHEJA
wrote:

> its working..
>
> #include
> #include
> int main()
> {const int a=123;
> printf("%d\n",a);
>
> *(int *)&a=345;
> printf("%d",a);
> getch();
>
> }
>
>  --
> 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] Re: constant

[SUDHIR RAHEJA]

its working..

#include
#include
int main()
{const int a=123;
printf("%d\n",a);
*(int *)&a=345;
printf("%d",a);
getch();
}

-- 
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] COGNIZANT(CTS) HELP

[sourabh jain]

COGNIZANT(CTS) visited any clg?
Share all info.
Criteria, pkg etc
writtern exam patern, que/ans interview.
Thnx in adv.

-- 
Regards
SOURABH KUMAR JAIN
MCA,  NIT RAIPUR
MOB.-+919993878717

-- 
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] money matters

[shady]

http://apps.topcoder.com/forums/?module=Thread&threadID=714973&start=0&mc=6#1430589
approach
discussed

On Thu, Oct 6, 2011 at 2:59 AM, g4ur4v  wrote:

> how to approach this problem
> http://www.codechef.com/problems/MONEY
>
> --
> 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] Re: Qualcomm

[muruga vel]

I am not from iit,iim,iiscQualcomm visisted our college and taken 3 guys
for intern...Me and 1 other guy in waiting list

In written round 3 sections are thereThere is a time limit for each
section and you can jump from one section to other section

1)Logical Reasoning and Quants (Basic)
2)Algorithms and flowchart
3)Os and Data structures

It was pretty easy...But aware of the running time...
20 out of 80 were selcted

Next in technical round  I was asked to explain fully about my project and
summer intern...
What would be your preference google or qualcomm

.Nothing more than that

8 out of 20 were selected for Hr round

In HR round tell abt urselves , what companies u attended so far.

3 from 8 were selected and 2 in waiting list

On Wed, Sep 28, 2011 at 11:28 AM, Udit Gupta  wrote:

> forget dude if u not an iitian, then forget about qualcomm
>
>
> On Wed, Sep 28, 2011 at 11:07 AM, siva viknesh wrote:
>
>> plz share the latest qualcomm questions and interview pattern if
>> anyone had attended
>>
>> On Sep 25, 12:52 am, mohit mittal  wrote:
>> > Hello yar,
>> > Please share the written paper format and interview questions.
>> > If dont want to display openly, plz share with my id
>> mohitm.1...@gmail.com.
>> >
>> > It will be of great help to 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.
>>
>>
>  --
> 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] help

[SHUBHAM BANSAL]

can anybody tell me about INFOEDGE working culture?

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

[algogeeks] Algorithm page

[Wladimir Tavares]

Hi Guys,

I created this page to place some materials on algorithms. Suggestions are
welcome.

https://sites.google.com/site/quixadamaratona/

Ps: The page is in Portuguese.

Best wishes,



*
*

-- 
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] money matters

[g4ur4v]

how to approach this problem
http://www.codechef.com/problems/MONEY

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

Re: [algogeeks] IVY comptech????

[vijay singh]

It asks questions from C, C++, DS, Java, Networking, Puzzles...
Its basically an internet gaming company, so it asks for conceptualising and
designing games using OOP concepts...

-- 
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] IVY comptech????

[htross]

Does anybody know what kind of questions are asked in ivy comptech???
''

-- 
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] New Group For Practicing and Learning Efficient Ways of Coding

[Kunal Patil]

Great work shady...+1
I was so bored of the company interview queries on this group..
Hope to see Real algorithmic discussion on the new group.

On Wed, Oct 5, 2011 at 11:27 PM, KARTHIKEYAN V.B.  wrote:

> +1
>
> --
> 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] [SPOJ] ZSUM

[hashd]

I'm getting WA on the question : ZSUM-SPOJ

Here is my code: 


#include
#define MOD 1007

typedef unsigned long long u64;
using namespace std;

u64 modExp(u64 x, u64 y){
if(x==0)
return 0;

if(y==0)
return 1;

u64 z = modExp(x,y/2);

if(y%2==0)
return (z*z)%MOD;
else
return (x*z*z)%MOD;
}

int main(){
u64 n, k; scanf("%llu%llu",&n,&k);
while(n&&k){
u64 ans = 0;

if(n>0)
ans = (2*modExp(n-1,k) + modExp(n,k) + 2*modExp(n-1,n-1) + 
modExp(n,n))%MOD;

printf("%llu\n",ans);
scanf("%llu%llu",&n,&k);
}

return 0;
}

-- 
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/-/p6j7nmaEUb4J.
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: Qualcomm

[Rahul Tiwari]

@prag .. dude those 2 guys r not frm cs-it  & 1 more thine udit is
also from our college (MNNIT Allahabad ) .. & udit hi vo banda hai
jiska technical sabse achha gaya tha qualcomm me but after 1 hour good
tech round, w/o any reason QUALCOMM rejects udit .. udit z jst
xpressing his xperiance .






On Oct 5, 10:17 pm, Prags  wrote:
> @Udit- U r wrong my frnd. Qualcomm visited to my college (MNNIT Allahabad)
> and recruited 2 students. So its nt true that if u r nt a IITIAN then
> Qualcomm wont take u Just we need to do hard work to satisfy their
> requirement . thats it. ... :)
>
> On Wed, Sep 28, 2011 at 11:28 AM, Udit Gupta  wrote:
> > forget dude if u not an iitian, then forget about qualcomm
>
> > On Wed, Sep 28, 2011 at 11:07 AM, siva viknesh 
> > wrote:
>
> >> plz share the latest qualcomm questions and interview pattern if
> >> anyone had attended
>
> >> On Sep 25, 12:52 am, mohit mittal  wrote:
> >> > Hello yar,
> >> > Please share the written paper format and interview questions.
> >> > If dont want to display openly, plz share with my id
> >> mohitm.1...@gmail.com.
>
> >> > It will be of great help to 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.
>
> >  --
> > 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] Opera Solutions

[parag khanna]

which college ?? package ??


-- 

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] New Group For Practicing and Learning Efficient Ways of Coding

[KARTHIKEYAN V.B.]

+1

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

[akshay khatri]

Hi

Did anyone kno or have appeared for EIL written exam ?

What type of question do they ask ?

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

[Prags]

@Udit- U r wrong my frnd. Qualcomm visited to my college (MNNIT Allahabad)
and recruited 2 students. So its nt true that if u r nt a IITIAN then
Qualcomm wont take u Just we need to do hard work to satisfy their
requirement . thats it. ... :)

On Wed, Sep 28, 2011 at 11:28 AM, Udit Gupta  wrote:

> forget dude if u not an iitian, then forget about qualcomm
>
>
> On Wed, Sep 28, 2011 at 11:07 AM, siva viknesh wrote:
>
>> plz share the latest qualcomm questions and interview pattern if
>> anyone had attended
>>
>> On Sep 25, 12:52 am, mohit mittal  wrote:
>> > Hello yar,
>> > Please share the written paper format and interview questions.
>> > If dont want to display openly, plz share with my id
>> mohitm.1...@gmail.com.
>> >
>> > It will be of great help to 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.
>>
>>
>  --
> 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]

@Akanksha- thank u

On Mon, Oct 3, 2011 at 7:10 PM, Akanksha .  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  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 . 
> 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  wrote:
> >> > @Akaknsha- hv sapient visited ur college ?? if yes , then what is its
> >> > procedure ?
> >> >
> >> > On Wed, Sep 28, 2011 at 9:32 PM, Akanksha . 
> >> > 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 
> 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.

Re: [algogeeks] amazon,microsoft link list probs

[Ankur Garg]

Implement recursive merge sort for first question

For second just swap the values of node and node b



On Wed, Oct 5, 2011 at 9:18 PM, 9ight coder <9ightco...@gmail.com> wrote:

> 1.perform inplace(we cant create new node)merge sort of two sorted
> linked list.(asked in amazon 1 mon before)
> 2.a->b->c->d->e  convert to b->a->d->c->e  without creating new node.
> (asked in microsoft on 4rth oct at thapar).
>
> sugeest solutions.
>
> --
> 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: Sudoku

[Don]

My method does use backtracking, but only when the first two methods
fail. When the cell-based and group-based analysis do not produce any
results, it picks one cell and tries each possible value in that cell.
If that results in a contradiction, it backs out to that point and
tries something else.

I have implemented a Sudoku solver. C++ code follows.

Don


#include 
#include 
#include 
#include 

// The contents of the 81 cells
int board[81];

// The rows, columns, and squares which must each
// contain a permutation of the digits 1-9
int groups[27][9] = {
{ 0, 1, 2, 3, 4, 5, 6, 7, 8},
{ 9,10,11,12,13,14,15,16,17},
{18,19,20,21,22,23,24,25,26},
{27,28,29,30,31,32,33,34,35},
{36,37,38,39,40,41,42,43,44},
{45,46,47,48,49,50,51,52,53},
{54,55,56,57,58,59,60,61,62},
{63,64,65,66,67,68,69,70,71},
{72,73,74,75,76,77,78,79,80},

{ 0, 9,18,27,36,45,54,63,72},
{ 1,10,19,28,37,46,55,64,73},
{ 2,11,20,29,38,47,56,65,74},
{ 3,12,21,30,39,48,57,66,75},
{ 4,13,22,31,40,49,58,67,76},
{ 5,14,23,32,41,50,59,68,77},
{ 6,15,24,33,42,51,60,69,78},
{ 7,16,25,34,43,52,61,70,79},
{ 8,17,26,35,44,53,62,71,80},

{ 0, 1, 2, 9,10,11,18,19,20},
{ 3, 4, 5,12,13,14,21,22,23},
{ 6, 7, 8,15,16,17,24,25,26},
{27,28,29,36,37,38,45,46,47},
{30,31,32,39,40,41,48,49,50},
{33,34,35,42,43,44,51,52,53},
{54,55,56,63,64,65,72,73,74},
{57,58,59,66,67,68,75,76,77},
{60,61,62,69,70,71,78,79,80}
};

// Maps each cell back into its three groups
int map[81][3];

int oneAvail[1023] = {0};
int bits[1023];

unsigned int avail[27];

int known = 0;

// History of moves used to back out wrong guesses
int rec[81];

// Set position to value "num"
void set(int pos, int num)
{
board[pos] = num;
if (num)
{
avail[map[pos][0]] ^= 1 << num;
avail[map[pos][1]] ^= 1 << num;
avail[map[pos][2]] ^= 1 << num;
rec[known++] = pos;
}
}

// Back out to position k
void backout(int k)
{
while(known > k)
{
int pos = rec[--known];
int num = board[pos];
avail[map[pos][0]] ^= 1 << num;
avail[map[pos][1]] ^= 1 << num;
avail[map[pos][2]] ^= 1 << num;
board[pos] = 0;
}
}

// Alternative method which evaluates each group to determine how many
// locations each missing digit could occupy. If there is only one
place
// it could go, it puts it there. Returns 1 unless a contradiction is
found.
int elimination()
{
int i,j,k;

for(i = 0; i < 27; ++i)
for(j = 1; j < 10; ++j)
if (avail[i] & (1< -1)
set(pos, j);
else if (pos == -1) // Contradiction: there is 
a digit required
with no place to go
return 0;
}
return 1;
}

// Tries to solve the given puzzle.  Returns 1 if solution is found.
int solve()
{
int i,j;

while(known < 81)
{
int priorKnown = known;
int leastPos;
int leastBits=9;
unsigned int leastA;

// Look for a cell which can have only one value
for(i = 0; i < 81; ++i)
if (board[i] == 0)
{
unsigned int a = avail[map[i][0]] & 
avail[map[i][1]] & avail[map[i]
[2]];
if (!a)  // There is a space where no digit 
fits.
return 0;
if (oneAvail[a]) // Exactly one digit can go 
here
set(i,oneAvail[a]);
else // Keep track of which cell has the 
smallest possible number
of options
if (bits[a] < leastBits)
{
leastPos = i;
leastBits = bits[a];
leastA = a;
}
}

if ((known == priorKnown) && !elimination()) return 0;

if (known == priorKnown)
{
// Take a guess
for(j = 1; j < 10; ++j)
if (leastA & (1<>1];

for(i = 0; i < 27; ++i)
avail[i] = 1022;

known = 0;
}

// Read in the board from the user
void readBoard()
{
printf("Enter the given numbers and zeros for blanks\n");
for(int i = 0; i < 81; ++i)
{
char c=0;
while(!isdigit(c))
c = getch();

[algogeeks] amazon,microsoft link list probs

[9ight coder]

1.perform inplace(we cant create new node)merge sort of two sorted
linked list.(asked in amazon 1 mon before)
2.a->b->c->d->e  convert to b->a->d->c->e  without creating new node.
(asked in microsoft on 4rth oct at thapar).

sugeest solutions.

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

[gaurav yadav]

which college?

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from 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] Opera Solutions

[DIVIJ WADHAWAN]

Need help regarding Opera Solutions placements for the position of an
analyst.
What kind of questions they ask etc.

-- 
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] What is generally asked by people having 1/2 years experience?

[algo geek]

HI,
Does anyone has idea about what is asked in interviews for the people who
have 1/2 year experience ?
You can tell about good companies like adobe, microsoft, amazon, google.

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.

[algogeeks] Adobe

[DIVIJ WADHAWAN]

Hi I need help regarding Adobe Placements for the position of software
developer.
What kind of questions they ask ? Their interview rounds etc . its
coming in my college on 13th October.

-- 
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] nagle's algorithm

[Rahul Tiwari]

plz suggest any good link that covers the complete basics abt nagle's
algo ...

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

[shady]

saurabh... atleast people doing +1 are agreeing to the solution... separate
group is created where we will discuss codes along with algorithms...

@all interview ques. for google, MS, fb was allowed because they are
algorithmic in nature... anyone asking database, network questions... will
be banned straight away. search threads... redundant posts shouldn't be
there respect other people's time also

On Wed, Oct 5, 2011 at 11:03 AM, saurabh singh  wrote:

> well lets face it.90 pc of the posts these days are queries on
> companies recruiting interview questions etc.even the algorithm
> questions asked are not strictly algorithmic in nature.only a few
> people keep giving solutions other just keep doing +1.the point is
> with over 5000 members its not possible anymore to maintain this group
> as a quality discussion forum.why not create a seperate group with
> restricted membership and trying to maintain the quality there.the
> membership basis can be left on the discretion of admins.
>
> On 10/3/11, sunny agrawal  wrote:
> > And About Posting Questions on The Group
> > It is a humble request to the members of the group (who are reading this
> > post) that Please Don't Post Question in the subject of the message.
> > rather put related topic name in the subject, which can give a idea what
> the
> > question is about.
> >
> > On Mon, Oct 3, 2011 at 8:09 PM, sunny agrawal
> > wrote:
> >
> >> There is a Website that was initiated after the success of its community
> >> Algorithms on ORKUT
> >> but if i will post the link here people will start spamming there also
> :P
> >> like shady sad :(
> >>
> >> People have taken this group from Algorithms Group to
> >> X_Interview_Questions_Database_Group.
> >> seriously Bad :(
> >>
> >>
> >>
> >>
> >> On Mon, Oct 3, 2011 at 7:54 PM, shady  wrote:
> >>
> >>> people can't even post questions properly
> >>> same question being asked again and again, so many coders from Russia,
> >>> Poland, have stopped participating here :-(
> >>> all discussions are which company ? what is ctc ? what is asked ? what
> >>> should i do ? if one gets job and then that person becomes immune :-/
> >>> seriously lol
> >>>
> >>>
> >>> On Mon, Oct 3, 2011 at 7:50 PM, Ankur Garg 
> wrote:
> >>>
>  Nice Idea but for pulling this you need committed people :)
> 
>  On Mon, Oct 3, 2011 at 7:36 PM, sukran dhawan
>  wrote:
> 
> > Hello guys,
> > Here is a suggestion.With so much talented people in this group,why
> > cant
> > we a website that is similar to geeksforgeeks.
> > It will be really helpful to others if all the topics are well
> > organised
> > in the form of website
> > This is just a suggestion.just ignore the message if im wrong or u
> guys
> > don like the idea
> >
> > --
> > 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.
> >>>
> >>
> >>
> >>
> >> --
> >> Sunny Aggrawal
> >> B.Tech. V year,CSI
> >> Indian Institute Of Technology,Roorkee
> >>
> >>
> >
> >
> > --
> > Sunny Aggrawal
> > B.Tech. V year,CSI
> > Indian Institute Of Technology,Roorkee
> >
> > --
> > 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.
> >
> >
>
>
> --
> Saurabh Singh
> B.Tech (Computer Science)
> 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 o

[algogeeks] Qualcomm Internshhip Paper

[deepikaanand]

folowing is d internship paper of qualcomm (software position)
 3 sections analytical,programming skills and CSE

analytical paper had qs from relationships,to derive code ,pattern
matching,sets ,i found it a little bit tough in comparison to other
two sections
programming paper had input o/p qs ver easy.considerable number od qs
were asked from OS (virtual memory,multitasking computers,shallow
copy, OS used by IBM pc/2)
.ouptut qs from a given  flow chart.
in CSE section qs like to find avg waiting time for round robin,page
fault using FIFO technique,avg waiting time for FCFS scheduling.
time complexity for merging to sorted files of diff sizes
50,10,15,25 ;.Program to find reverse of a number as an o/p qs
This section ws easy too..
after switching over to another section,the previous attempted section
couldnt be accessed

-- 
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] Qualcomm exam

[deepikaanand]

folowing is d internship paper of qualcomm (software position)
 3 sections analytical,programming skills and CSE

analytical paper had qs from relationships,to derive code ,pattern
matching,sets ,i found it a little bit tough in comparison to other
two sections
programming paper had input o/p qs ver easy.considerable number od qs
were asked from OS (virtual memory,multitasking computers,shallow
copy, OS used by IBM pc/2)
.ouptut qs from a given  flow chart.
in CSE section qs like to find avg waiting time for round robin,page
fault using FIFO technique,avg waiting time for FCFS scheduling.
time complexity for merging to sorted files of diff sizes
50,10,15,25 ;.Program to find reverse of a number as an o/p qs
This section ws easy too..
after switching over to another section,the previous attempted section
couldnt be accessed

-- 
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] unix book

[rahul patil]

the design of operating system by morris bach !!!
He has covered all basics about unix.

On Wed, Oct 5, 2011 at 5:07 PM, bihari  wrote:

> tell me good books on unix
>
> --
> 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,
Rahul Patil

-- 
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] Help sourcebit !!!

[praveen raj]

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.

[algogeeks] unix book

[bihari]

tell me good books on unix

-- 
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] unix book

[bihari]

tell me good books on unix

-- 
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] Deepak Nandihalli wants to chat

[Deepak Nandihalli]

---

Deepak Nandihalli wants to stay in better touch using some of Google's
coolest new
products.

If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-7b5a2e465a-6472bb1010-q9IBY4cKM9nnTSGeyY56zED255Y
You'll need to click this link to be able to chat with Deepak Nandihalli.

To get Gmail - a free email account from Google with over 2,800 megabytes of
storage - and chat with Deepak Nandihalli, visit:
http://mail.google.com/mail/a-7b5a2e465a-6472bb1010-q9IBY4cKM9nnTSGeyY56zED255Y

Gmail offers:
- Instant messaging right inside Gmail
- Powerful spam protection
- Built-in search for finding your messages and a helpful way of organizing
  emails into "conversations"
- No pop-up ads or untargeted banners - just text ads and related information
  that are relevant to the content of your messages

All this, and its yours for free. But wait, there's more! By opening a Gmail
account, you also get access to Google Talk, Google's instant messaging
service:

http://www.google.com/talk/

Google Talk offers:
- Web-based chat that you can use anywhere, without a download
- A contact list that's synchronized with your Gmail account
- Free, high quality PC-to-PC voice calls when you download the Google Talk
  client

We're working hard to add new features and make improvements, so we might also
ask for your comments and suggestions periodically. We appreciate your help in
making our products even better!

Thanks,
The Google Team

To learn more about Gmail and Google Talk, visit:
http://mail.google.com/mail/help/about.html
http://www.google.com/talk/about.html

(If clicking the URLs in this message does not work, copy and paste them into
the address bar of your browser).

-- 
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] Deepak Nandihalli wants to chat

[Deepak Nandihalli]

---

Deepak Nandihalli wants to stay in better touch using some of Google's
coolest new
products.

If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-7b5a2e465a-40f0e550aa-Ng3I1B7zDPWOU4cmeunUpV0TaBM
You'll need to click this link to be able to chat with Deepak Nandihalli.

To get Gmail - a free email account from Google with over 2,800 megabytes of
storage - and chat with Deepak Nandihalli, visit:
http://mail.google.com/mail/a-7b5a2e465a-40f0e550aa-Ng3I1B7zDPWOU4cmeunUpV0TaBM

Gmail offers:
- Instant messaging right inside Gmail
- Powerful spam protection
- Built-in search for finding your messages and a helpful way of organizing
  emails into "conversations"
- No pop-up ads or untargeted banners - just text ads and related information
  that are relevant to the content of your messages

All this, and its yours for free. But wait, there's more! By opening a Gmail
account, you also get access to Google Talk, Google's instant messaging
service:

http://www.google.com/talk/

Google Talk offers:
- Web-based chat that you can use anywhere, without a download
- A contact list that's synchronized with your Gmail account
- Free, high quality PC-to-PC voice calls when you download the Google Talk
  client

We're working hard to add new features and make improvements, so we might also
ask for your comments and suggestions periodically. We appreciate your help in
making our products even better!

Thanks,
The Google Team

To learn more about Gmail and Google Talk, visit:
http://mail.google.com/mail/help/about.html
http://www.google.com/talk/about.html

(If clicking the URLs in this message does not work, copy and paste them into
the address bar of your browser).

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

[rahul sharma]

dnt agreee..everyone should get chance...the admin should post that wat
to post n wat not not toif again someone post abou the companies n ctc
etc.. he should be warn...else on second chance he should be droped from the
group

On Wed, Oct 5, 2011 at 11:03 AM, saurabh singh  wrote:

> well lets face it.90 pc of the posts these days are queries on
> companies recruiting interview questions etc.even the algorithm
> questions asked are not strictly algorithmic in nature.only a few
> people keep giving solutions other just keep doing +1.the point is
> with over 5000 members its not possible anymore to maintain this group
> as a quality discussion forum.why not create a seperate group with
> restricted membership and trying to maintain the quality there.the
> membership basis can be left on the discretion of admins.
>
> On 10/3/11, sunny agrawal  wrote:
> > And About Posting Questions on The Group
> > It is a humble request to the members of the group (who are reading this
> > post) that Please Don't Post Question in the subject of the message.
> > rather put related topic name in the subject, which can give a idea what
> the
> > question is about.
> >
> > On Mon, Oct 3, 2011 at 8:09 PM, sunny agrawal
> > wrote:
> >
> >> There is a Website that was initiated after the success of its community
> >> Algorithms on ORKUT
> >> but if i will post the link here people will start spamming there also
> :P
> >> like shady sad :(
> >>
> >> People have taken this group from Algorithms Group to
> >> X_Interview_Questions_Database_Group.
> >> seriously Bad :(
> >>
> >>
> >>
> >>
> >> On Mon, Oct 3, 2011 at 7:54 PM, shady  wrote:
> >>
> >>> people can't even post questions properly
> >>> same question being asked again and again, so many coders from Russia,
> >>> Poland, have stopped participating here :-(
> >>> all discussions are which company ? what is ctc ? what is asked ? what
> >>> should i do ? if one gets job and then that person becomes immune :-/
> >>> seriously lol
> >>>
> >>>
> >>> On Mon, Oct 3, 2011 at 7:50 PM, Ankur Garg 
> wrote:
> >>>
>  Nice Idea but for pulling this you need committed people :)
> 
>  On Mon, Oct 3, 2011 at 7:36 PM, sukran dhawan
>  wrote:
> 
> > Hello guys,
> > Here is a suggestion.With so much talented people in this group,why
> > cant
> > we a website that is similar to geeksforgeeks.
> > It will be really helpful to others if all the topics are well
> > organised
> > in the form of website
> > This is just a suggestion.just ignore the message if im wrong or u
> guys
> > don like the idea
> >
> > --
> > 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.
> >>>
> >>
> >>
> >>
> >> --
> >> Sunny Aggrawal
> >> B.Tech. V year,CSI
> >> Indian Institute Of Technology,Roorkee
> >>
> >>
> >
> >
> > --
> > Sunny Aggrawal
> > B.Tech. V year,CSI
> > Indian Institute Of Technology,Roorkee
> >
> > --
> > 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.
> >
> >
>
>
> --
> Saurabh Singh
> B.Tech (Computer Science)
> 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 Gee

[algogeeks]

[Vendetta .]

any idea how wud b the written test of IVY Comptech???

-- 
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: rise and fall of power

[Piyush Kapoor]

>
> Yes these are in cmath(or math.h) ,
>

  /* 7.12.6.8 Double in C89 */
  extern float __cdecl log10f (float);
  extern long double __cdecl log10l (long double);

> --
> *Regards,*
> *Piyush Kapoor,*
> *2nd year,CSE
> IT-BHU*
>
>


-- 
*Regards,*
*Piyush Kapoor,*
*2nd year,CSE
IT-BHU*

-- 
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: rise and fall of power

[Piyush Kapoor]

In which library do powl() and log10l() lie(they r not in cmath,i think)
,can anybody post a good reference to these..(I could not find much on
googling)
-- 
*Regards,*
*Piyush Kapoor,*
*2nd year,CSE
IT-BHU*

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