What will be the input for the graph?
Kishen
On Thu, Oct 21, 2010 at 5:22 AM, Algorithimist yogi15...@gmail.com wrote:
Design an algorithm to determine whether a graph has any parallel
edges in time proportional to E + V.
--
You received this message because you are subscribed to the
MapReduce is the best option .
For the word count its explained here -
http://en.wikipedia.org/wiki/MapReduce
Interesting thing is that the Map step can easily be made parallel.
Once again I request the members of this group to go through all the
parallel constructs. ( Parallel sorting,
nothing to do with time
complexity.
Thanks,
- Ravindra
On Fri, Oct 22, 2010 at 8:17 AM, Kishen Das kishen@gmail.com wrote:
Ok, if you look at the inner loop, it is -
for ( j = i to j = 0 ) {
sum[j] += A[ i]
product[j] *= A [ i]
}
This is as good as executing -
sum[i] = sum [ i
mean parallelised=not have to do the computation at all?
did you mean without knowing the boundary of the inner loop which is
depended on the outer loop, the inner loop would be smart enough to
figure out the i and j?
On Oct 20, 7:33 pm, Kishen Das kishen@gmail.com wrote:
Well, looks like
.
Also Kishen can you explain how is the complexity for two loops runninf in
parallel equal to O(1).
On Wed, Oct 20, 2010 at 3:06 PM, rahul patil
rahul.deshmukhpa...@gmail.com wrote:
On Wed, Oct 20, 2010 at 5:11 AM, Kishen Das kishen@gmail.com wrote:
In the below code the jth and kth
have O(n). it
will most likely run O(n^2)
On Oct 19, 7:41 pm, Kishen Das kishen@gmail.com wrote:
In the below code the jth and kth inner for loops can be run in parallel
making them O(1) and the entire thing O(n).
for ( i=0 to i=N-1 )
{
for ( j = i to j = 0 ) {
sum[j] += A[ i
:
On Wed, Oct 20, 2010 at 5:11 AM, Kishen Das kishen@gmail.com wrote:
In the below code the jth and kth inner for loops can be run in parallel
making them O(1) and the entire thing O(n).
for ( i=0 to i=N-1 )
{
for ( j = i to j = 0 ) {
why till 0?
if S=107 , P= 210
and array is 10
Lets say A is the array of length N.
Create an array sum of length N and initialize it to 0.
Create an array product of length N and initialize it to 1.
for ( i=0 to i=N-1 )
{
for ( j = i to j = 0 ) {
sum[j] = sum[j] + A[ i]
product[j]= product[j] * A [i]
}
for( k=0 to k= i )
if ( sum[k] == S
In the below code the jth and kth inner for loops can be run in parallel
making them O(1) and the entire thing O(n).
for ( i=0 to i=N-1 )
{
for ( j = i to j = 0 ) {
sum[j] += A[ i]
product[j] *= A [ i]
}
for( k=0 to k= i )
if ( sum[k] == S and product[k] == P ) {
Answer is the sub array A[k to
, LawCounsels lawcouns...@aol.com wrote:
On 11 Aug, 23:54, Kishen Das kishen@gmail.com wrote:
http://www.telegraph.co.uk/science/science-news/7938238/Computer-scie...
Check out this cool news.
Kishen
On 10 Aug, 06:50, Niels Fröhling spamt...@adsignum.com wrote:
Up to date reactions
:-) that was funny.
I think you can take a look at the concepts of web-page ranking algorithms
- http://www.cpccci.com/academics/surveypagerank.htm
http://www.cpccci.com/academics/surveypagerank.htmKishen
On Thu, Aug 12, 2010 at 1:33 AM, thiru pujari thiru.puj...@gmail.comwrote:
i found this
http://www.telegraph.co.uk/science/science-news/7938238/Computer-scientist-Vinay-Deolalikar-claims-to-have-solved-maths-riddle-of-P-vs-NP.html
Check out this cool news.
Kishen
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
...@gmail.comwrote:
Yeah,,,...lets hope the next turing goes to this Indian. Its still being
verified.
On Thu, Aug 12, 2010 at 12:54 AM, Kishen Das kishen@gmail.com wrote:
http://www.telegraph.co.uk/science/science-news/7938238/Computer-scientist-Vinay-Deolalikar-claims-to-have-solved-maths-riddle
May be if you want to discuss what sort of algorithms MS might be using to
generate the serial key, then this is the right place :D
Kishen
On Sun, Jun 20, 2010 at 4:16 AM, Rohit Saraf rohit.kumar.sa...@gmail.comwrote:
So, is this the place for that?
And apart from that, it is illegal to
Answer is k! * k^(n-k).
You can select k number of balls in K! ways and then rest of (n-k) balls in
k ways.
This way you are ensuring that you have all k color balls and n number of
balls in total.
- Kishen Das
On Fri, Apr 30, 2010 at 6:04 AM, Ashish Mishra amishra@gmail.comwrote:
One
array right away after looking at
the indices of a and b )
indices/2: 2 3 3 4 6 6
corresponding final values6 6 6 11 14 14
- Kishen Das
On Fri, Apr 30, 2010 at 7:05 AM, divya sweetdivya@gmail.com wrote:
Given two sorted postive integer arrays A(n) and B(n) (W.L.O.G
16 matches
Mail list logo
