[algogeeks] find out the error in d program

2008-12-17 Thread arpit sarin
#include #include #include #include int main() { clrscr(); char a[256][32]; bool b[256][32]; int i,j,y,z; ofstream outfile; ofstream outf("C:\\boolean.txt"); cout --~--~-~--~~~---~--~~ You received this messag

[algogeeks] hi frns

2008-10-31 Thread arpit sarin
hi frns i hav a problem hav 2 create a prog in C++ it will create a file, ask user to input data 4m keboard save the dat in file and display it but the problem is data will b in d form of 1010..upto 32 bits long and max limit is 256 such type strings internaly prog will interpret it as binary

[algogeeks] a problem

2006-04-09 Thread arpit sarin
  hey frnds design an algo a directed Hamiltonian cycle DHC in a directed graph G+(V,E) is a directed cycle of length n=|V|,where |V|  is the number of vertices in G.So, the cycle goes through every vertex exactly once and then returns to the starting vertex. The DHC problem is to determine if a

[algogeeks] Re: breadth first search with cycle/ loop?

2006-04-04 Thread arpit sarin
  that ok but if we write an algorithm for the given problem how it should be if we suppose locks allow multiprocess to do same job at a time. On Tue, 04 Apr 2006 Kevin wrote : > >Locks can assure one process to do the job properly. It does not allow >multi process to do the same job at the sam