agreed with u~~ On 3月1日, 下午12时06分, atul anand <[email protected]> wrote: > didnt get this question :- > > *minimum separation distance between two nodes of tree * > minimum sepration on what basis , is it similar to Dijkstra algo ??? > > On Wed, Feb 29, 2012 at 11:35 PM, Ravi Ranjan <[email protected]>wrote: > > > > > > > > > @all > > > 3 round liye > > > 1.5 hours each only data structure n algorithm n 2 qstns from OS but > > ultimately the code for synchronization(a mix situation of linked-list n > > semaphore) > > > they asked linked list tree programs their variations(all to implement in > > C) > > > i stuck at this place when they tell me to write minimum separation > > distance between two nodes of tree > > first i use recursion then > > then they tell to write using one recursion and one loop..... :P > > and tell me to explain the stack formation on memory layout along with > > its complexity....... > > i got confused whther combining both loops and stack have same as that of > > two loops/ two recursions > > basically they are creating some mental pressure for me by confusing me > > crtisizing me...... i was tired till the last interview > > but finally they hired me..... :D:D:D:D > > > the last round was the difficult one here they are focussin on graph... my > > graph is little weak(implementation part) > > > i think most of the qstns were of MS and Amazon(trees n graph optimization) > > and is discussed here...... > > > thanx a lot to you guys....... > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
