Re: [algogeeks] Database Classes

Thanks A lot for sharing!! On Sat, Oct 8, 2011 at 2:03 PM, Rahul Verma wrote: > Hi friends, > > Sorry for this off topic, but I found that it would be interesting for us > that now we have online classes of Databases from Stannford. > db-class.org > > -- > You received this message because yo

Re: [algogeeks] Re: urgent :guys what type of ques does flipkart ask anyidea for written and interview

Flipkart asks good algo question as well as java question On Thu, Oct 6, 2011 at 10:10 PM, Akash Mukherjee wrote: > ne updates on flipkart n1?? > > On Fri, Sep 9, 2011 at 9:53 PM, siva viknesh > wrote: > > hi...which coll and package???...plz post the interview experiences > > after attending .

Re: [algogeeks]

Kudos to Anna... On Mon, Aug 22, 2011 at 12:57 AM, Maximilian Anthony < maximilian@gmail.com> wrote: > Huge Support to Anna Hazare!!! > > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email

Re: [algogeeks] Re: Amazon question

:)* > > > > On Fri, Aug 19, 2011 at 3:33 AM, monty 1987 <1986mo...@gmail.com> wrote: > >> @Sanju >> I think there exists a restriction in your approach that all numbers >> between 1and n has to be present in the array. >> >> Thanks >> Soumi

Re: [algogeeks] Re: Amazon question

@Sanju I think there exists a restriction in your approach that all numbers between 1and n has to be present in the array. Thanks Soumitra On Fri, Aug 19, 2011 at 9:53 AM, Sanjay Rajpal wrote: > In the first loop, numbers are the numbers in the given array > but in the second loop, numbers are j

Re: [algogeeks] Oracle !!

Pls do not join oracle IDC they are a bit conservative in hike and promotions. On Thu, Aug 18, 2011 at 10:56 PM, jestincobol nair wrote: > how to prepare for oracle plz give suggestions .. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group

[algogeeks] PLEASE MAKE SINCERE DONATION EVEN A SINGLE RUPEE MATTERS

Hi ALL, It is neither a issue of any sick person , it is the issue that mother India is sick with corrupt people. I know that most of us do not have time due to a busy schedule but we have other resources with us. I am not man of very high stature still i implore u all to contribute ge

Re: [algogeeks] Re: Java Book

The best book is effective java ...but it is not for beginners but SCJP java book is marvellous !!! On Mon, Jun 13, 2011 at 5:59 AM, naivenow wrote: > The Complete Reference By Herbert Shildt is comprehensive. > You can also look up some tutorials on youtube :) > > On Jun 13, 11:05 am, Anura

[algogeeks] error in code

Hi , i m getting error can u find the error in code for following problem?? We will use the following (standard) definitions from graph theory. Let V be a nonempty and finite set, its elements being called vertices (or nodes). Let E be a subset of the Cartesian product V×V, its elements being c

Re: [algogeeks] Re: In place sorting

er , two for the lists and the third one for > the position it should be placed. > time complexity will be O(m+n) > > > On Wed, Dec 29, 2010 at 2:55 PM, monty 1987 <1986mo...@gmail.com> wrote: > >> hi , >> this is not a research kind of problem i expect a simple

Re: [algogeeks] Re: In place sorting

hi , this is not a research kind of problem i expect a simple answer. On Wed, Dec 29, 2010 at 2:33 PM, juver++ wrote: > Use inplace merge algorithms along with merge sort. > http://www.logiccoder.com/Downloads/krnrd20.pdf > > -- > You received this message because you are subscribed to the Googl

[algogeeks] In place sorting

Hi Guys , We have an array of size m+n in which m elements are present in sorted order and other array of size n again in sorted order . We want both of them to be sorted and present in first array.No third array is supposed to be given. like 1, 3,55,66,77,_,_,_

Re: [algogeeks] Re: Interview question

Hi , the program outputs the co-ordinate of bottom-right of the largest 1*1 rectangular submatrix and the size is total number of elements in that matrix. On Mon, Dec 27, 2010 at 7:31 PM, juver++ wrote: > Program is incorrect. Why does it output the following answer: point at > (3,5 )s

Re: [algogeeks] Re: Interview question

Hi Guys , I have coded the first part soon i will come with the solution of part 2 :--- Let me know if u find any error case (hope u will find none) public class Largestsubmatrix { public point [][] a; int [][] binmatrix; public point loc; public Largestsubmatrix(int [][] a) { t

Re: [algogeeks] Find a specific number in a special matrix.

Suppose you have a matrix n*m. each column and row of the matrix is already sorted. For example: 1,2,3 2,3,4 4,5,6 *In how much time we can sort the elements of this matrix ? As far as i m getting idea that if we have n*n elements then we can sort it in n^3 time*. It can be done as-

[algogeeks] good question

Given a boolean matrix with all the true elements on left side in the row so that each row can be broken into two parts left part containing only true elements and right part containing only false elements. Find the row with max number of true elements in it. if the size of matrix is m*n then it c

Re: [algogeeks] Ruby on rails help

Ye naya Ruby on Rails ka kya funda hai On Wed, Nov 18, 2009 at 9:37 AM, nitin mathur wrote: > Hi > > Is there anybody working on Ruby on Rails..Plzz reply if there.. > > Thnx > Nitin Mathur > Joan Crawford > - "I, Joan Crawf

[algogeeks] Re: Good problem

not put them together to get a system of linear inequalities. >>> > 2009/10/21 Dave >>> > >>> > >>> > >>> > >>> > >>> > >>> > >>> > > This is a linea

[algogeeks] Re: Good problem

Hi, Still waiting for solution... On Wed, Oct 7, 2009 at 3:18 PM, monty 1987 <1986mo...@gmail.com> wrote: > The important thing is all the points do not lie in same range i.e. > x1 ,x2 ,x3 each of them have their own range. > > > On Wed, Oct 7, 2009 at 3:15 P

[algogeeks] Re: Good problem

The important thing is all the points do not lie in same range i.e. x1 ,x2 ,x3 each of them have their own range. On Wed, Oct 7, 2009 at 3:15 PM, monty 1987 <1986mo...@gmail.com> wrote: > The min. distance between two points i.e. the euclidean distance between > two points. > &g

[algogeeks] Re: Good problem

r2i-r1i) / (n-1) ! > it means ou put the first point on r1i and the last point on r2i, the > remaining point are distributed with equal distances ! > > On Oct 5, 5:22 pm, monty 1987 <1986mo...@gmail.com> wrote: > > We have to locate n points on the x-axis > > For each p

[algogeeks] Good problem

We have to locate n points on the x-axis For each point xi the x co-ordinate of it lies between a range [r1i,r2i] Now we have to decide the location of points such that minimum { distance between any two points } is maximum. Any answer is welcomed. --~--~-

[algogeeks] hamiltonian circuit

the hamiltonian circuit (HC) problem remains NP-complete when restricted to chordal bipartite graphs (cbg) and becomes polynomial when restricted further to bipartite distance hereditary graphs (bdhg). I'm not aware of any "well established" class of graphs between bdhg and cbg. If there is one, y

[algogeeks] Re: LIVE PROJECTS FOR FINAL YEAR STUDENTS 2008-09 M.Tech, B.E/B.Tech(CSE/ISE/ECE/EEE/IT/ BIOMEDICAL), MCA, BCA,M.Sc,B.Sc.

I'd like to know if u consider B.Tech 3ed year student. (CSE- IIT Kharagpur) On Dec 5, 3:24 pm, ravi <[EMAIL PROTECTED]> wrote: > Our company CLUSTER SOFTWARE SOLUTIONS provides LIVE Academic Projects > for FINAL YEAR students on > �� JAVA/J2EE > �� DOTNET > �� DATA WAREHOUSING > ��

[algogeeks] Geometric Algo..

Hi Frndz, If there are n points on the circumference of circle(order not known) ,how can we find out the closest pair in complexity O(nlgn)... pls help with the answer... thnx. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the G

[algogeeks] Re: question

Hi, i did not find the question... plz post the question here... Bharathi priyaa wrote: > Hi, > I could not find 2.4-5...Probably i was lookin for the wrong question.Can > u post the question here? > > 2008/11/20 OK <[EMAIL PROTECTED]> > > > > > Hi, > > > > I try to solve the question 2.4-5

[algogeeks] Regarding text mining

hi frnds, Can anyone help me to get a tool which will work in Fedora and contains the facility Latent Semantic Indexing tools --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks"

[algogeeks] Re: Can anyone recommend an interesting book relating algorithm

Pls see Cormen(Introduction to algorithms) On Thu, Apr 10, 2008 at 4:42 PM, tenxian <[EMAIL PROTECTED]> wrote: > > I want an interesting book which relates algorithm. > > > --~--~-~--~~~---~--~~ You received this message because you are subscribed to t

[algogeeks] Problem in code

Find out why this program is not working which converts list representation of graph in adjacency matrix #include using namespace std; struct node { node* point; node* next; int info; }; node * getnode(int i); void adja(int count,node **p); int main() { int count,wt,j,i; nod

[algogeeks] Summer Training

Hi:- Friends can anyone help me to get intern in summer ...I am in 3rd year CS right now... --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to alg

[algogeeks] algo.....

Hi Can anyone tell me about constraint satisfaying algorithm(simulated annealing)?? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@goog

[algogeeks] Re: road traffic

Hi, I am highly interested in such type of work.I would like to work with you On Jan 24, 2008 5:22 PM, Albert Sanchez <[EMAIL PROTECTED]> wrote: > Hi, > > Anyone interested in "road traffic" strategies? Flow optimization, time > dependent shortest paths problems? > > > > Albe

[algogeeks] Robot Path planning

Hi guys : Anyone interested in work of robot path planning... --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@goo

[algogeeks] For Some networking project

Hi Bloke, I am really interested in some good networking project.Can anyone suggest me and become my guider? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to thi

[algogeeks] monty 1987 wants to chat

--- monty 1987 wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-fd5190c7df-c1a0f28445-2ea2c0aaa877b289 You'

[algogeeks] Re: OPEN GL

Hi I have to devlop a graphic simulation project in which i hav to build a graphics engine . wht does it mean??? On 4/19/07, monty 1987 <[EMAIL PROTECTED]> wrote: > > hi, > Can anyone tell me more about open gl .How is the scope f

[algogeeks] OPEN GL

hi, Can anyone tell me more about open gl .How is the scope for this topic?? --~--~-~--~~~---~--~~ 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

[algogeeks] monty 1987 wants to chat

--- monty 1987 wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-fd5190c7df-578807e516-572fe5d0cb8f9527 You'

[algogeeks] algo problem

My problem is to find out longest subsequence of integers in increasing order in an array of integers. If any one have solution tell it to me. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. T

[algogeeks] hare krishna

Hi Friends, I have learnt an algorithm regarding the graph i.e. to find out the* DFS * DFS(G) { for each vertex u of V[G] do color[