Hope this works
http://ideone.com/MCLqO
On Sun, Mar 25, 2012 at 4:37 PM, atul anand atul.87fri...@gmail.com wrote:
@ Kalyanasundaram : no need to check you algo , bcozz i can clearly see
you are not saving output to the bufffer , you are just printing it to
stdout .
please read prev comment
Q1) Yes, as per my friend the only interface is that function. But how will
you traverse the matrix because if : BADCAT is one row then there are two
words BAD and CAT and you have to find both and it could be DAB and TAC
also ?
Q2) What will be the complexity when state machine is used ?
--
First we divide the large memory into some chunks and we hash them. For
each chunk, we need hash function.
If a thread accesses a memory location, we find which chunk of address it
is accessing, then we hash based on memory location. We can easily identify
what are all threads are accessing a
@don : still i didn't understand the logic .. 15th processor has to find
the best possible case which includes all 4 items along with 36 items..is
it not same as 40 items 0-1 knapsack?
On Wed, Mar 28, 2012 at 8:54 PM, Arun Vishwanathan
aaron.nar...@gmail.comwrote:
Thanks Don!
On Wed, Mar 28,
@don : but, finding longest path in a graph is NPC ... we should comeup
with better solution
On Sat, Mar 24, 2012 at 10:25 PM, Don dondod...@gmail.com wrote:
There is more to it than a longest increasing subsequence because the
greater than relationship is not transitive.
Don
On Mar
it depends on how you define the problem.finding the longest path in a
graph required O(N) where n is the total number of states.Dons
solution is not npc if i understand it right
On 4/1/12, bharat b bagana.bharatku...@gmail.com wrote:
@don : but, finding longest path in a graph is NPC ... we
if all values x are known to be contiguous then I think it will take o(1)
time because it will be majority element if it occurs more than n/2 times
as x must be at the middle.
so if mid=(low+high)/2 and x==a[mid]then x is majority element otherwise
not.
just checklet me know.
On Thu, Feb 9,
hey geeks!
My aim is to cluster my data using subtractive clustering and so that
further I can extract Fuzzy Rules from that.
suppose I have the following 2 dimensional data:-
X[]=[
hey guys!
google is coming to our college, their main requirements is from
operating systems and computer networks.
can some one post the sample questions for it..
thanks
Deepak
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
Q2 can be done using KMP algo or suffix tree
On Sun, Apr 1, 2012 at 1:12 PM, Decipher ankurseth...@gmail.com wrote:
Q1) Yes, as per my friend the only interface is that function. But how
will you traverse the matrix because if : BADCAT is one row then there are
two words BAD and CAT and you
hi i just like to know when you will go for binary search tree over
btree. advantage and disadvantage, application of both of them.
thank you in advance
Regards,
Arun kumar
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
--
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, visit this group at
@Arun
This is the java program to execute the fsck cmd from java pgm...
If any problem pls let me know
//code
import java.io.*;
public class JavaRunCommand {
public static void main(String args[]) {
String s = null;
try {
Process p =
http://www.geeksforgeeks.org/archives/11337
On Sun, Apr 1, 2012 at 9:18 PM, Ashish Goel ashg...@gmail.com wrote:
--
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
http://www.geeksforgeeks.org/archives/503
On Sun, Apr 1, 2012 at 6:54 PM, sanjiv yadav sanjiv2009...@gmail.comwrote:
if all values x are known to be contiguous then I think it will take o(1)
time because it will be majority element if it occurs more than n/2 times
as x must be at the middle.
@sanjiv : if x is the majority element then it is ok, but if not(x is
present and not majority element), u'r method doesn't work ..
On Sun, Apr 1, 2012 at 9:38 PM, rahul sharma rahul23111...@gmail.comwrote:
http://www.geeksforgeeks.org/archives/503
On Sun, Apr 1, 2012 at 6:54 PM, sanjiv
A common puzzle asked during interviews is how to measure 4 liters of
water with just two uneven shaped buckets, one of 3 liter another of 5
liter, in minimum number of steps. To extend and generalize this, write a
program to evaluate the minimum number of steps to measure “X” liters
Computational Thinking
http://www.cs.cmu.edu/~wing/publications/Wing06.pdf
Computer Science for the Rest of Us
http://www.nytimes.com/2012/04/01/business/computer-science-for-non-majors-takes-many-forms.html?_r=2ref=technology
PENSAMIENTO COMPUTACIONAL Una habilidad de la era digital al alcance
It was telling that error after doing some modifications...
Yeah i think bharat u r saying correct...
I will try it...
Thanks for reply...
On Sat, Mar 31, 2012 at 11:45 AM, bharat b bagana.bharatku...@gmail.comwrote:
u should get an error: argument of type ‘void* (TraCISagar::)(void*)’ does
19 matches
Mail list logo
