Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from 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 and Regards
VIKAS
http://linuxconfig.org/get-started-with-android-application-development-using-linux-and-android-sdk
this link will definitly gonna give you running HELLO ANDROID app on ua
machine.
;)
--
Thanks and Regards
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1...@gmail.com
shyguy1
at
http://groups.google.com/group/algogeeks?hl=en.
--
Thanks and Regards
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1...@gmail.com
shyguy1...@gmail.com
http://smrit.wordpress.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from 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 and Regards
VIKAS
I need to know, What's the Recruitment Procedure in college of CA
Technologies.. Any Link, any info.. Plz Provide it ASAP..
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
On Wed, Aug 24, 2011 at 8:25 PM, praneethn praneeth...@gmail.com wrote:
*max=(ab)*a+(ba)*b;*
Not allowed ;) Read the constraints applied.
--
Thanks and Regards
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1...@gmail.com
shyguy1...@gmail.com
http://smrit.wordpress.com
--
You
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Thanks and Regards
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1...@gmail.com
shyguy1...@gmail.com
http://smrit.wordpress.com
--
You received this message because you are subscribed to the Google Groups
Algorithm
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1...@gmail.com
shyguy1...@gmail.com
http://smrit.wordpress.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
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from 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 and Regards
VIKAS SINGH
expect the PADDING would be.. try it..!
--
Thanks and Regards
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1...@gmail.com
shyguy1...@gmail.com
http://smrit.wordpress.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
bytes
short u :3;
ans=2 bytes
--
Thanks and Regards
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1...@gmail.com
shyguy1...@gmail.com
http://smrit.wordpress.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
struct demo
{
char c;
double d;
int s;
};
what wud be the size of struct demo object?
if you get the concept, then try this one... just one student asked this in
other thread :) :)
--
Thanks and Regards
VIKAS SINGH
MCA- final year
NIT DURGAPUR
email:
vikas.singh1
continuous execution of your code
struct node
{
char c;
double d;
int s;
};
int main(){
struct node a;
struct node *p;
p=a;
printf(size = %d \t address=%u, sizeof(a), p);
}
I don't know why you said 24 in the thread.. is it compiler dependent ??
--
Thanks and Regards
VIKAS
on dev c++.. i m getting correct out put as 24.
when i hav executed ur code on turbo version it shows 11 ,i.e it is doing
no padding at all..
On Sat, Aug 6, 2011 at 7:21 PM, vikas singh shyguy1...@gmail.com wrote:
@sandeep
size = 16 address=3220095484
size = 16 address=3220598412
size
Each game eliminates one participant 5622 will have to be eliminated, so
5622 games.
On Wed, Jan 12, 2011 at 3:09 PM, manoj lalavat manoj.lala...@gmail.comwrote:
check this...
Tournament Algorithm
Another method is tournament algorithm. The idea is to conduct a knockout
minimal round
Given a dictionary find out if given word can be made by two words in
dictionary. For eg. given newspaper you have to find if it can be made by
two words. (news and paper in this case). I cant think of anything but brute
force.
Thanks,
Vikas
--
You received this message because you are
whether the word with the remaining characters
exist in the dictionary or not.
On Tue, Jan 11, 2011 at 5:57 PM, Vikas Singh vikas.sing...@gmail.comwrote:
Given a dictionary find out if given word can be made by two words in
dictionary. For eg. given newspaper you have to find if it can be made
please ignore earlier message...it was supposed to be a private message..
On Tue, Jan 11, 2011 at 6:52 PM, Vikas Singh vikas.sing...@gmail.comwrote:
lalla..bruteforce na bako.. :P
On Tue, Jan 11, 2011 at 6:07 PM, manoj lalavat manoj.lala...@gmail.comwrote:
you can optimize BF
newspaper
Wouldn't that be O(n2) . what if n, ne, new, news, newsp etc all are valid
words ? Cant it be optimized?
On Tue, Jan 11, 2011 at 6:27 PM, juver++ avpostni...@gmail.com wrote:
Use trie (or similar DS).
For each word, try to find second part of the target in a linear time
O(length).
--
You
I agree with the trie solution. But now how do you generalise it for K. I
mean a word can be made from k other words.
On Wed, Jan 12, 2011 at 12:53 AM, juver++ avpostni...@gmail.com wrote:
If you represent dictionary as a hash table, lookup costs you O(L) at
least!
Cause you need to calculate
20 matches
Mail list logo
