Re: [algogeeks] Re: Interview Questions

o the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/gro

Re: [algogeeks] Android development

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

Re: [algogeeks] C Trick

On Wed, Aug 24, 2011 at 8:25 PM, praneethn wrote: > *max=(a>b)*a+(b>a)*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 rece

[algogeeks] Need info Regarding CA Technologies

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 algogeeks@g

Re: [algogeeks] C Trick

scribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Thx, > --Gopi > > -- > You received this message becau

Re: [algogeeks] C code scanf problem

o compile this > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com

Re: [algogeeks] Syllogism

eeks+unsubscr...@googlegroups.com. > For more options, visit 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 rece

Re: [algogeeks] SISO

gorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from 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]

>>>> Groups "Algorithm Geeks" group. >>>> To post to this group, send email to algogeeks@googlegroups.com. >>>> To unsubscribe from this group, send email to >>>> algogeeks+unsubscr...@googlegroups.com. >>>> For more options,

Re: [algogeeks] Re: sizeof structure

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 wrote: > >> @sandeep >> >> >> size = 16 address=3220095484 >

Re: [algogeeks] Re: sizeof structure

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 to this group, send email to a

Re: [algogeeks] Re: sizeof structure

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

Re: [algogeeks] Re: sizeof structure

char :3; ans =1 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 Geek

Re: [algogeeks] Re: sizeof structure

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"

Re: [algogeeks] sizeof structure

ed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.goog

Re: [algogeeks] Amazon Analytical Puzzle

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 wrote: > check this... > > Tournament Algorithm > > Another method is tournament algorithm. The idea is to conduct a knockout > minimal round tournament to decide th

Re: [algogeeks] Interview Question

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++ wrote: > If you represent dictionary as a hash table, lookup costs you O(L) at > least! > Cause you need to calculate hash for the strin

Re: [algogeeks] Interview Question

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++ wrote: > Use trie (or similar DS). > For each word, try to find second part of the target in a linear time > O(length). > > -- > You received this mes

Re: [algogeeks] Interview Question

please ignore earlier message...it was supposed to be a private message.. On Tue, Jan 11, 2011 at 6:52 PM, Vikas Singh wrote: > lalla..bruteforce na bako.. :P > > > On Tue, Jan 11, 2011 at 6:07 PM, manoj lalavat wrote: > >> you can optimize BF >> >> newspaper

Re: [algogeeks] Interview Question

time first word exist in > dictionary then only see whether the word with the remaining characters > exist in the dictionary or not. > > > On Tue, Jan 11, 2011 at 5:57 PM, Vikas Singh wrote: > >> Given a dictionary find out if given word can be made by two words in >> diction

[algogeeks] Interview Question

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 subscri

[algogeeks] Magic Cube

Hi all,I faced this problem in my lab exam.I wonder if there could be any other method than brute force(for finding out no.s to be swapped) is possible.We've all seen magic squares before. They are square grids full of numbers arranged so that the rows, columns and diagonals all have the same sum: