[algogeeks] [brain teaser ] 8march

*Riddle Problem Solution* What goes up and down but doesn't move? *Update Your Answers at* : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/8march.html Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies

Re: [algogeeks] [brain teaser ] 8march

Stairs :) On Tue, Mar 8, 2011 at 1:33 PM, Lavesh Rawat lavesh.ra...@gmail.com wrote: *Riddle Problem Solution* What goes up and down but doesn't move? *Update Your Answers at* : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/8march.html Solution: Will be updated after 1 day

[algogeeks] Application of Data Structure

Given a pdf document which is the best data structure to read the document..??? write Class or pseudo code for reading data in PDF document using that data structure Thanks Shashank -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post

[algogeeks] Re: Construct Binary Tree From Ancestor Matrix

@all where r u guys.. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options,

[algogeeks] Interview questions for multithreading in Java

Hi, What interview questions one would expect for multi-threading? Thanks, Vaibhav -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to

[algogeeks] binary search for Linked List?

Is it possible to implement -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more

Re: [algogeeks] Re: Construct Binary Tree From Ancestor Matrix

1 2 3 4 1 0 1 1 0 2 0 0 1 0 3 0 0 0 0 4 0 1 1 0 Node numbers used in matrix are in bracket 5(3) | | 10(2) / \ / \ 12(1) 13(4) For every row in the matrix, calculate the number of non - zero numbers. This will give the level of that node in the tree. Now the node with level 0 is root. Traverse

[algogeeks] Need WebSphere Administrator -- IL

Dear Folks, Wishes for the Day !!! We Need consultant for WebSphere Admin Please share suitable profiles to s...@panzersolutions.com *Job Title : WebSphere Admin Location : Chicago,IL Duration : 6 Months Rate : $50/Hr* *Must have solid understanding of AIX, shell scripting,

Re: [algogeeks] Re: An interesting question

@rajnish: i think u missed the point , the matrix is binary.. so how will you store -1 in it. @pacific: Will you solution work fine if 0 th row has all 1's and 0th column has atleast one zero.?? On Mon, Mar 7, 2011 at 1:09 AM, yogesh kumar yoku2...@gmail.com wrote: @pacific: Good Algorithm

[algogeeks] HOT ACTRESS

HOT ARCHANA STILLS http://karomasti9.blogspot.com/2011/01/archana.html DEEKSHA SETH HOT WALLPAPERS http://karomasti9.blogspot.com/2011/01/deeksha-seth.html KATRINA KAIF HOT VIDEOSPHOTOS http://karomasti9.blogspot.com/2011/01/katrina-kaif.html

Re: [algogeeks] binary search for Linked List?

Yes , it is possible . But it does not make sense . The thing that matters while doing binary search for arrays is that we can access any element in O(1) time . But , for a linked list it becomes an average of O(n) . And on average we have an O(nlogn) algorithm with highly confusing code and messy

Re: [algogeeks] Interview questions for multithreading in Java

u can go through the following questions...not sure about the answers...: 1) What are the two types of multitasking? Ans : 1.process-based 2.Thread-based 2) What are the two ways to create the thread? Ans : 1.by implementing Runnable 2.by extending Thread 3) What is the signature of the

Re: [algogeeks] [brain teaser ] 7march

I will get the gold coin or nothing. On 2011-3-7 16:11, Lavesh Rawat wrote: ***Get Gold Coin **Problem Solution* * *Imagine there are 3 coins on the table: gold, silver, and copper. If you make a truthful statement, you will get one coin. If you make a false statement, you will get nothing.

Re: [algogeeks] Print Hello infinite..................

system(yes Hello); (on Linux) On 2011-3-7 2:09, sudheer kumar wrote: use GOTO On Sun, Mar 6, 2011 at 10:49 PM, UMESH KUMAR kumar.umesh...@gmail.com mailto:kumar.umesh...@gmail.com wrote: How to print Hello Infinite times without using Loop and Recursion function ? -- You

Re: [algogeeks] SPOJ DP : SUMITR

This my code: #include stdio.h #define R(i,b) for(i=0;ib;i++) #define D(i,a) for(i=a;i=0;i--) #define I(d) scanf(%d,d); main(){int t,n,i,j,m[100][100];I(t) while(t--){I(n)R(i,n)R(j,i+1)I(m[i][j]) D(i,n-2)R(j,i+1)m[i][j] += m[i+1][j] m[i+1][j+1]?m[i+1][j]:m[i+1][j+1];printf(%d\n,m[0][0]);}} 297

Re: [algogeeks] SPOJ DP : SUMITR

I create some macros like this: #define R(i,a,b) for(i=a;ib;i++) #define D(i,a,b) for(i=a;i=b;i--) #define I(d) scanf(%d,d); But i don't get the accepted in this problem! On Sun, Mar 6, 2011 at 1:55 PM, Logic King crazy.logic.k...@gmail.comwrote: i solved the problem on spoj based on DP

Re: [algogeeks] [brain teaser ] 7march

i hope statement is- i am telling lie if i don't get a gold coin. clear me if i am wrong On Mon, Mar 7, 2011 at 5:59 PM, amit singh amit.lu...@gmail.com wrote: i will get a gold coin or i will not get a coin On Mon, Mar 7, 2011 at 1:41 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Get

Re: [algogeeks] SPOJ DP : SUMITR

Well tried, i have got the correct answer after working on it for almost 2 hours here is my code #includeiostream using namespace std;int a[100][100];main(){int

Re: [algogeeks] SPOJ DP : SUMITR

algorithm isn't required for C++ 4.0.*. The same code will give Compile Error in C++ 4.3 and above On Tue, Mar 8, 2011 at 10:42 PM, Logic King crazy.logic.k...@gmail.comwrote: Well tried, i have got the correct answer after working on it for almost 2 hours here is my code

Re: [algogeeks] SPOJ DP : SUMITR

I submitted it in g++4.3.2 it was AC...but acc. to you it should have been error...i think you are wrong somewhere !! On Tue, Mar 8, 2011 at 10:46 PM, abhijith reddy abhijith200...@gmail.comwrote: algorithm isn't required for C++ 4.0.*. The same code will give Compile Error in C++

Re: [algogeeks] Interview questions for multithreading in Java

I think you can go some basic concept which help you. I have collected some info about threading . hope so it will little bit useful http://www.cppcoffe.blogspot.com/ On Tue, Mar 8, 2011 at 9:35 PM, Abhishek Sharma jkabhishe...@gmail.comwrote: u can go through the following questions...not

Re: [algogeeks] Interview questions for multithreading in Java

Thanks Abhishek! I was looking for something in Java On Tue, Mar 8, 2011 at 11:13 PM, Abhishek Goswami zeal.gosw...@gmail.comwrote: I think you can go some basic concept which help you. I have collected some info about threading . hope so it will little bit useful

[algogeeks] Need Senior QA consultant -- Minnetonka, MN (Only Local to MN)

Dear Folks, Wishes for the Day !!! We Need consultant for Senior QA consultant Please share suitable profiles to s...@panzersolutions.com *Job Title : Senior QA consultant Location : Minnetonka, MN (Only Local to MN) Duration : 3+ months Rate : $45/Hr* We are looking for a QA

Re: [algogeeks] SPOJ DP : SUMITR

My accepted solution. I am using DP to precompute, each interval. ar[i][j] gives the answer for interval i to j; for(i=0;in;i++) ar[i][i] = v[i]*n; for(i=n-2;i=0;i--) for(j=i+1;jn;j++) ar[i][j] = max(ar[i+1][j]+v[i]*(n-(j-i)),ar[i][j-1]+v[j]*(n-(j-i))); output

[algogeeks] Need SAP ABAP with AFS consultant -- CA !!!!!!!!!!!!!

Dear Folks, Wishes for the Day !!! We Need consultant for SAP ABAP with AFS consultant Please share suitable profiles to s...@panzersolutions.com *Job Title : SAP ABAP with AFS consultant Location : San Jose, CA Duration : 6 Months Rate : Market* Senior ABAP developer (at least