i do agree with rahul nice idea.. will work ...going to be great
On Tue, Oct 4, 2011 at 11:08 AM, Rahul Verma rahulverma@gmail.comwrote:
Hey,
I have a suggestion that why we don't have a discussion on some topic for
full one week and after that we can discuss problems from various
we have to find X^N let it would be N
YlogX=log(N)
antiLog(YlogX)=N
antilog for base 10 is power of 10
so 10^(YlogX)=N
and if we want to find 3^5
pow(10,5log3)--- pow(10,2.3856062735)=243
and if u want to find first 2 digits pow(10,(2.3856062735-1))=24.3=24
On Tue, Oct 4, 2011 at 1:46 AM, sunny
ya..great idea..if it works out well,it'll really be awesome! :)
On 10/4/11, vishwa vishwavam...@gmail.com wrote:
i do agree with rahul nice idea.. will work ...going to be great
On Tue, Oct 4, 2011 at 11:08 AM, Rahul Verma
rahulverma@gmail.comwrote:
Hey,
I have a suggestion that
Hi All,
Can someone explain the below problem's solution :
http://www.codechef.com/problems/MIXTURES
I have been struggling to solve DP problems and am not able to
think clearly in problems like the one mentioned. Kindly help me to
understand DP by providing some
anybody having HeadFirst's JSP SERVLET ebook...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
1.How to construct a tree from the list representation
for ex.- construct tree from (A(B(E(K,L),F),D(H(M,I),J)))
the tree would be binary
the structure of the node would be
struct node{
int data;
struct node *left,*right;
};
2.Given a binary tree..give its list representaion..(reverse of
int count(int x, int tree[], int s, int e, int n)
{
tree[n]++;
if (s==e) return 0;
int cnt = 0;
int mid = (s+e)/2;
if (mid x) return tree[2*n+1]+count(x, tree, mid+1, e, 2*n+2);
else return count(x, tree, s, mid, 2*n+1);
}
main()
{
for(i=n-1;i=0; i--)
{
sol[i] = insert(ar[i], tree, 0,
*you have to check for the braces where they have been used..in comman brace
that means they are on same level..i am providing answer to your problem in
attached file..
check that out..
*Raghav garg
On Tue, Oct 4, 2011 at 1:53 PM, Dheeraj Sharma
dheerajsharma1...@gmail.comwrote:
1.How to
*hello guyz..
can anyone suggest me the best book or tutorials to learn data structure..
*Raghav garg
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
Hey Raghav,
No methods are worst or best.
Just go through any book you have and try the atleast 5 or 6 problems of
various difficulty level based on that data structure.
Try to think about the functionality of the data structure, so that you can
implement it in various situations or use it
In which year you are now. May i can give you some 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
*i am presently in 3rd year..i have studied data structure in 1st year..but
i am not good in that..
*Raghav garg
On Tue, Oct 4, 2011 at 2:52 PM, anshu mishra anshumishra6...@gmail.comwrote:
In which year you are now. May i can give you some idea.
--
You received this message because you
yeah..but am looking for code..that takes the input...as string of
(A(B(E(K,L),F),D(H(M,I),J)))
and returns head of tree..
On Tue, Oct 4, 2011 at 2:11 PM, Raghav Garg rock.ragha...@gmail.com wrote:
*you have to check for the braces where they have been used..in comman
brace that means they are
can u change and if yes how to change value of constant variable?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
main()
{const int a=123;
printf(%d,a);
*(int *)a=345;
printf(%d,a);
}
On Oct 4, 3:48 pm, prajon jondhale.pra...@gmail.com wrote:
can u change and if yes how to change value of constant variable?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
Guys Qualcomm came to our college for internship selection(May-July
2012).They selected 3 guys and me and 1 guy in waiting listThey
are saying that they would inform about the confirmation on next year
mayIs it worth waiting ...
Note: I am not from IIT, IISc, IIM
They said usually they
Find out the smallest segment in a document containing all the given words.
Desired Complexity is O nlogK ..n is the total no of words in the document
and k is the number of input words
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
doesnt work in dev cpp
On Tue, Oct 4, 2011 at 4:22 PM, prajon jondhale.pra...@gmail.comwrote:
main()
{const int a=123;
printf(%d,a);
*(int *)a=345;
printf(%d,a);
}
On Oct 4, 3:48 pm, prajon jondhale.pra...@gmail.com wrote:
can u change and if yes how to change value of constant
check this(considering valid input)
http://www.ideone.com/Nuhil
On Tue, Oct 4, 2011 at 3:36 PM, Dheeraj Sharma
dheerajsharma1...@gmail.comwrote:
yeah..but am looking for code..that takes the input...as string of
(A(B(E(K,L),F),D(H(M,I),J)))
and returns head of tree..
On Tue, Oct 4, 2011
hi all ,
can anyone pls share citrix interview questions ...
thanks
raju
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
What is the source of this question?
On Sep 20, 4:49 am, Ankur Garg ankurga...@gmail.com wrote:
nice find bhanu..though i didnt get much :P on first read :D :D
On Tue, Sep 20, 2011 at 4:34 AM, Bhanu Kishore
bhanukishor...@gmail.comwrote:
See this algorithm:
This is the link for the book
*http://www.4shared.com/document/_Y7p3MLT/Head_First_Servlets_and_JSP.html*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
can anybody give me the steps you need to check while writing a
program to simulate sudoku
i don't want the exact codejust algorithm would me more than
sufficient.
suggest also the suitable languages for implementing that..VB or
java or any other
--
You received this
Hope it will be useful :)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
Thanks.
and congress...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
I think that Quantum Neural Network is a good choice for sudoku. You can find
some of paper about it at scholar.google.com.
I implemented it by Java and it worked fine :)
On Oct 4, 2011, at 11:21 PM, himanshu kansal wrote:
can anybody give me the steps you need to check while writing a
me too..also want to know how do i start with data structues...which book is
the best which covers almost every concept??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
I am using following statements to print the first...
scanf(%lf%lf,n,k);
double v = n*log10(n);
double dummy;
double ff = modf(v,dummy);
double val = floor(pow(10.0,ff+k-1));
printf(%.0f,val);
this code works fine when for big values of n like n=234232
there is nothing like best book... which covers all concepts... books are
there just to provide basics... you have to think on your own after that.
On Tue, Oct 4, 2011 at 10:08 PM, SUDHIR RAHEJA raheja.sudhirah...@gmail.com
wrote:
me too..also want to know how do i start with data
http://www.stanford.edu/class/cs106x/
http://see.stanford.edu/see/courseinfo.aspx?coll=11f4f422-5670-4b4c-889c-008262e09e4e
Awesome
You need to have Visual Studio 2005
On Tue, Oct 4, 2011 at 10:14 PM, shady sinv...@gmail.com wrote:
there is nothing like best book... which covers all
nk
34 9: 117566389
23 8: 20880467
92 9: 466101087
1997: 2963208
234232 9: 943982129
3476566 9: 226270832
56999 9: 349261536
9 9:
the above question is similar to matrix-chain multiplication on page number
-370,dynamic programming chapter,Introduction to Algorithms,t h
cormen,leiserson,rivest,stein
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
I also Faced the same problem when i tried this one and when i got to know
the mistake it was not very happy :(
Use methods powl and log10l instead of pow and log10 and u will get 9 digits
of precision :)
On Tue, Oct 4, 2011 at 10:21 PM, gaurav yadav gauravyadav1...@gmail.comwrote:
n
When you say Simulate Sudoku, do you mean solve a given Sudoku
problem?
Here is an overview of how I did that:
I used an array of 81 integers to represent the board.
Then I built a 27x9 table of all the groups: 9 rows, 9 columns, and 9
squares.
Then I built a 81x3 map which relates each location
i have a tree . i will do search is it BST or not if yes then
Can we reduce time complexity of BST...
http://www.geeksforgeeks.org/archives/3042
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
All non-static local variables declared in the body of a function are
unique to that call of the function.
So if you called f(0)
void f(int n)
{
int array[10] = {0};
if (n 10)
{
++array[n];
f(n+1);
for(int i = 0; i 10; ++i)
printf(%d , array[i]);
For a local value with an array type, yes, a fresh array is allocated
for each recursive call.
In C, C++, and languages with reference semantics like Java and Lisp,
array parameters are passed as pointers or references, so no fresh
array is allocated. In Pascal, call-by-value parameter arrays
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
Hi Don,
How is your method better than backtracking?
i hope you are implementing a sudoku solver..
Let me know.
Regds.
On Tue, Oct 4, 2011 at 10:42 PM, Don dondod...@gmail.com wrote:
When you say Simulate Sudoku, do you mean solve a given Sudoku
problem?
Here is an overview of how I did
39 matches
Mail list logo
