[algogeeks] PeP

Hi, Has anyone attended PeP (Particiaptory exam for palcement).Can u give me some guidance..?? -- 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 t

Re: [algogeeks] c++ doubt

my badadd const in copy construcori think...that compiler expect... On Sun, Jul 10, 2011 at 11:48 PM, rahul wrote: > use a(int arg) > { >x = arg; > } > > > ur call will work...:) > > > On Sun, Jul 10, 2011 at 11:46 PM, himanshu kansal < >

Re: [algogeeks] c++ doubt

use a(int arg) { x = arg; } ur call will work...:) On Sun, Jul 10, 2011 at 11:46 PM, himanshu kansal < himanshukansal...@gmail.com> wrote: > class a > { >int x; > public: >a() >{ >} >a(int i){x=i;cout<<"in a "

[algogeeks] Puzzle

At a movie theater, the manager announces that they will give a free ticket to the first person in line whose birthday is the same as someone who has already bought a ticket. You have the option of getting in line at any time. Assuming that you don't know anyone else's birthday, that birthdays are

Re: [algogeeks] Re: Puzzle

Got it...Thanks.. On Wed, Jul 6, 2011 at 11:31 PM, shiv narayan wrote: > speed of river=(distance traveled by object in it) / total time it > took to travel > > here hat has traveled a distance of 1 KM > and it has taken =5mn+5 min=10 min=10min/60=1/6 hrs; > so speed = 1/(1/6)=6km/hr > > On Jul 6

[algogeeks] Puzzle

Hi, A son and father goes for boating in river upstream . After rowing for 1 mile son notices the hat of his fathe falling in the river.After 5 min. he tells his father that his hat has fallen. So they turn round and are able to pick the hat at the point from where they began boating af

[algogeeks] MS Ques

Hi, Write a function which takes two char * s as inputs, one is a regular expression pattern and the other is a test string and check whether the test string is of the given regular expression pattern. The regular expression pattern can contain all lower-case letter, asterisk and ques

Re: [algogeeks] os

If u want us to solve the GATE paper, please attach the paper, we will post the solution. regards. On Tue, Jun 21, 2011 at 11:21 PM, Akshata Sharma wrote: > The atomic fetch-and-set x, y instruction unconditionally sets the memory > location x to 1 and fetches the old value of x n y without allo

Re: [algogeeks] OS

A, D On Tue, Jun 21, 2011 at 11:16 PM, Akshata Sharma wrote: > A thread is usually defined as a ‘light weight process’ because an > operating system (OS) maintains smaller data structures for a thread than > for a process. In relation to this, which of the followings is TRUE? > (A) On per-thread

Re: [algogeeks] kernel programming

read gorman. On Mon, Jun 20, 2011 at 10:27 PM, Douglas Diniz wrote: > Linux kernel development - 3th Edition - Robert Love > > On Mon, Jun 20, 2011 at 9:42 AM, Shachindra A C > wrote: > > Hi All, > >Can someone suggest me some good books to learn kernel > > programming in linux? > >

Re: [algogeeks] Re: google interview c testing

strangegoogle ask these type of question too. On Sat, Jun 18, 2011 at 3:07 AM, DK wrote: > using: delete[] arrayPointer; > > -- > DK > > http://twitter.com/divyekapoor > http://www.divye.in > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm G

[algogeeks] Re: HASHIT

You can check the modified code at http://ideone.com/7NFTd and got AC at spoj Thanks Rahul Singal Computer Science Department BITS PILANI -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to

Re: [algogeeks] help

bt increment operator has the higher precedence than || and && so all the variables should be incremented first then && and then || should be evaluated then how it is happening.plz explain rahul dixit Du-Mca -- You received this message because you are subscribed to t

[algogeeks] Re: FOR ALL INDIANS PLZ READ IT

Balaji.S balaji.ceg...@gmail.com -- 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

Re: [algogeeks] Algorithm or Program for convert word into number

gt; To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul -- You received this message because you are subscribed to the Google Groups

Re: [algogeeks] Algorithm or Program for convert word into number

Count the number of spaces in the sentence. If the last word is {one/two .} the just do the calling on the speciab part of code printing the rest of sentence On 6/11/11, rahul rai wrote: > I wonder if there is any practical use of this algorithm for real life > implementation . . Plea

Re: [algogeeks] C Question

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 > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul -- You received this message beca

Re: [algogeeks] C Question

Aditya Kumar > B-tech 3rd year > Computer Science & Engg. > MNNIT, Allahabad. > > -- > 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. &g

[algogeeks] required ebook of Top down approach networking book 4th edition + tenanbaum os solution

Dear All, If you have any ebook mentioned above, please share them. Thanks -- Rahul singhal -- 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

Re: [algogeeks] Re: Google Question

ions, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul -- 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 gro

Re: [algogeeks] do not click on the link of previous mail

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 > http://groups.google.com/group/

Re: [algogeeks] gcc debugger

gdb a.out b(break) main . den do press n(next) to execute next stmt. if next instruction is function... press s(step). On Sat, Jun 4, 2011 at 11:19 PM, nitish goyal wrote: > n ? > > do not understand it. > Please elaborate > > > On Sat, Jun 4, 2011 at 11:17 PM, rahul w

Re: [algogeeks] gcc debugger

n On Sat, Jun 4, 2011 at 11:16 PM, nitish goyal wrote: > Please tell me the commands to use the gdb debugger > > To run the code line by line > > -- > Regards, > Nitish Goyal > Undergraduate Student Of NSIT, > Computer Engineering (B.E.) > Asst. PlaceComm 2011 > contact me:- +91-605824 > Repl

Re: [algogeeks] Re: like dislike mathamatical quiz 17 may

digits with sum of 5 . On Tue, May 17, 2011 at 5:07 PM, Dave wrote: > Like: 50, 23, 14. Dislike: 39, 16. > > Dave > > On May 17, 2:29 am, Lavesh Rawat wrote: > > *like dislike mathamatical quiz solution* * > > * *I like the number 5, but not 6. I like 32, but not 33. I like 41, but > not > > 4

Re: [algogeeks] Error

it happens, v learn by making mistakes... keep coding. On Tue, May 17, 2011 at 9:35 AM, Akshata Sharma wrote: > ya.. sorry my mistake! > > > On Tue, May 17, 2011 at 9:31 AM, rahul wrote: > >> pop op doesn't return anything...use top.something like that op. >>

Re: [algogeeks] Error

pop op doesn't return anything...use top.something like that op. Rahul. On Tue, May 17, 2011 at 9:29 AM, Akshata Sharma wrote: > can someone please tell me why I am getting this error? > > #include > #include > #include > > using namespace std; > > int main()

Re: [algogeeks] Candy_splitting in GCJ

abhijith can you explain , how you got E(n) = N , Thanks in advance Rahul Singal -- 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, sen

Re: [algogeeks] Efficient Way to Detect Duplicate Document

et's not do it your way or my way; let's do it the > best way." > > -- > 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

Re: [algogeeks]

o algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul -- You received this message because you a

Re: [algogeeks] Amazon Question

But does there exist a general method to do this for all binary trees . . I mean if this answer were true then all binary trees would be complete :) correct me if i think wrong On 4/17/11, rahul rai wrote: > But does there exist a general method to do this for all binary trees > . . I m

Re: [algogeeks] Amazon Question

cribed 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 >

[algogeeks] Text book doubt

http://www.ocf.berkeley.edu/~wwu/riddles/cs.shtml#singleInstrComp -- Rahul -- 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, sen

Re: [algogeeks]

char * is pointer to constant data...here...that's y it would crash...dear.. do somedebugging On Thu, Apr 21, 2011 at 4:16 PM, riti gupta wrote: > why?can u please explain? > > > On Thu, Apr 21, 2011 at 4:15 PM, rahul wrote: > >> will crash... :) >> >&

Re: [algogeeks]

will crash... :) On Thu, Apr 21, 2011 at 4:14 PM, riti gupta wrote: > is there any error in following code? > > main > { > char *p="hello"; > p[0]='j'; > p[1]='j'; > puts(p); > } > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To p

Re: [algogeeks] Compiler Design Help

www.cse.iitd.ernet.in/~sak/courses/cdp/slides.pdf there are a number of courses and free books on the net but the above 3 are by far the most succinct and awesome for AN ONLINE self learner On 4/16/11, rahul rai wrote: > http://dada.cs.washington.edu/dl/confxp/webviewer.html > >

Re: [algogeeks] Compiler Design Help

a > wrote: > >> Please mail me also. >> >> >> On Sat, Apr 16, 2011 at 10:02 PM, Arvinth Deenadayalan < >> arvint...@gmail.com> wrote: >> >>> Please cc me also. Tia. >>> >>> On 4/16/11, rgap wrote: >>> > Send me li

Re: [algogeeks] Compiler Design Help

e from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. T

Re: [algogeeks] DP sorting

O(n) . Thanks Rahul -- 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 mo

[algogeeks] Calculate sum of matrix

Hi geeks, Please help me in solving this problem you have to sum m+ m^2 + m^3 . + m^n where m is a square matrix how to efficiently do this better than O(n) time ?? Thanks Rahul -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks"

Re: [algogeeks] [brain teaser ] 29march

1+1+0, 2+2+1, 5+5+4, 14+14+13, 41+41+40 On Tue, Mar 29, 2011 at 1:05 PM, Lavesh Rawat wrote: > *Series Problem Solution* > > 1, 2, 5, 14, 41, x > Whats x ?? > > Update Your Answers at : Click > Here > > Solution: >

Re: [algogeeks] Application of Prime Number . An Interesting For Geeks

t; 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 > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul -- You receiv

Re: [algogeeks] random number generator

.(probability .6 x .6 + .4x.4 =.52 ) Thanks Rahul -- 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 algogeek

[algogeeks] nzec

can anyone help me with NZEC errorwhat it is ,how to find and remove it -- 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 algoge

Re: [algogeeks] virtual memory

http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul -- 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+un

[algogeeks] rahul rai wants to chat

I've been using Google Talk and thought you might like to try it out. We can use it to call each other for free over the internet. Here's an invitation to download Google Talk. Give it a try! ------- rahul rai wants

Re: [algogeeks] What is the error in the following function

char *start is const char *start, pointer to const char, u can't derefernce it and change it. take a char start[256].try this. On Tue, Feb 15, 2011 at 12:31 PM, dinesh bansal wrote: > Hi All, > > Can you please point me to the error in the following function. It gives > segmentation fault. > > i

Re: [algogeeks] Re: o/p

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 > http://groups.google.com/group/algogeeks?hl

Re: [algogeeks] Tree problem(Amazon)

unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul K Rai rahulpossi...@gmail.com -- You received this message because you are subscribed to t

[algogeeks] Re: Spoj Problem : Small Factorials

tually could read > >        t /= 1; > > Sorry for the typo. > > > Dave > > > On Feb 4, 11:58 am, Rahul Verma wrote: > > > @Dave > > > In the line t=p/100; > > > what is the value of p here or what it means? > > > > On F

[algogeeks] Re: BISHOPS

@king Can you pls told me that wat would be the position at where bishops might place in the 2X2, 3X3, 4X4 chessboard. On Feb 4, 8:39 pm, subramania jeeva wrote: > Use python for arithmetic operation of large numbers.. :) > > Cheers >           ~ Jeeva ~ > > > > > > > > On Fri, Feb 4, 2011 at

[algogeeks] Re: Spoj Problem : Small Factorials

@Dave In the line t=p/100; what is the value of p here or what it means? On Feb 4, 9:57 pm, Dave wrote: > @Rahul: Given that 100! < 100^100 = 10^200, we know that 100! has less > than 200 digits. Assuming 32-bit integers, we might choose to store > anywhere from 1 to 7 digits i

[algogeeks] Re: Spoj Problem : Small Factorials

gt; > On Fri, Feb 4, 2011 at 9:49 PM, Rahul Verma wrote: > > > > > > > > > Hi Group, > > > Let me help to solve this problem of SPOJ > >https://www.spoj.pl/problems/FCTRL2/ > > > The approach to solve the problem is very easy and I'm c

[algogeeks] Spoj Problem : Small Factorials

Hi Group, Let me help to solve this problem of SPOJ https://www.spoj.pl/problems/FCTRL2/ The approach to solve the problem is very easy and I'm confused that how to store such a large no. like 100! in a variable using C++ Language. Thanx & Regards, Rahul Verma -- You received thi

Re: [algogeeks] Re: SPOJ PROBLEM

does this has to do with floating point representation of numbers {IEE 754} {single precision } then the number would be like like for 32 bit field put 0 in the sign field all 1 in biased exponent field{8} and all zeros in the mantissa field{23} http://en.wikipedia.org/wiki/Single_precision_floa

Re: [algogeeks] can i know the best way to learn programming??

@Aniket If You Like That Link Then You Might be interested n reading my blog www.rahrai.wordpress.com i just wrote one entry there in August see On 2/2/11, aniket chatterjee wrote: > @Rahul: > > Awesome link dude!! > > -- > You received this message because you are subscr

Re: [algogeeks] can i know the best way to learn programming??

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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algog

[algogeeks] Re: Microsoft Written Test Questions

or topics they usually test. And also sample questions Regards, Rahul -- 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

Re: [algogeeks] Doubt regarding Pointers in C......

pass a address of pointer. void insert(bst **head, int data); call it using insert(&record,8). try this. On Thu, Jan 27, 2011 at 4:47 PM, nishaanth wrote: > Hi guys, > > I have a small doubt regarding pointers and functions. > > Consider the following prototype > > void insert(bst * head, int

Re: [algogeeks] Re: Prime Numbers

or code from the trap frame, it will > be time for you to leave. > > -- > 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, se

[algogeeks] http://www.cs.princeton.edu/~wayne/cs423/demos.html ::a helpful resource i thought

-- 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 ht

[algogeeks] Re: http://www.cs.princeton.edu/~wayne/cs423/demos.html ::a helpful resource i thought

http://www.cs.princeton.edu/~wayne/cs423/demos.html -- 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...@googlegr

[algogeeks] i need Theory Of Computation By Sipser's Solution Mannual

-- can somebody give me sipser soluton mannual -- 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.

Re: [algogeeks] OS galvin sol..

t; > -- > 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

Re: [algogeeks] Distance in a dictionary

t; Computer Science and engineering, > IIT Madras. > > -- > 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

Re: [algogeeks] Sites for Interview Questions

http://www.ocf.berkeley.edu/~wwu/riddles/intro.shtml Rahul K Rai rahulpossi...@gmail.com On Tue, Jan 18, 2011 at 9:27 PM, Yellow Sapphire wrote: > Hi, > > Can someone suggest good books/websites/blogs for interview related > questions. > > > thanks-- > YS > >

Re: [algogeeks] Re: L values and r values

subscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Rahul K Rai rahulpossi...@gmail.com -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to thi

[algogeeks] bfs doubt

Let G = (V, E) be a **, cONNECTED undirected graph. Give an O(V + E)-time algorithm to compute a path in G that traverses each edge in E exactly once in each direction. Describe how you can find your way out of a maze if you are given a large supply of pennies. from clrs -- You received this me

[algogeeks] L values and r values

Do l values and r values hold any practical significance how do we find l and r values of things like \\*(&(&A))\\ if A is an integer if A is an array of integers If A in itself is a reference -- Rahul K Rai rahulpossi...@gmail.com -- You received this message because

[algogeeks] Re: Hellof Friends. Regarding Microsoft Internship test

Thanks for the replies @Sunny Last year when they came to our college, they also asked questions relating to Operating Systems and Database. Did you forgot to mention it or is MS avoiding such questions now? Regards Rahul -- You received this message because you are subscribed to the

Re: [algogeeks] Re: Hellof Friends. Regarding Microsoft Internship test

I think Im good at Algorithms and Data Structures. Could you name a few which gives good resources!! Actually google suggest a lot !! so it would be better if some human can share their choice :) Regards Rahul On Sun, Jan 16, 2011 at 6:54 PM, juver++ wrote: > Heh, to apply for interns

[algogeeks] Hellof Friends. Regarding Microsoft Internship test

subjects are, IMHO , DataStructures, Database, Operating System Specific topics if any, some one can mention it. Thankfully Rahul -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to

Re: [algogeeks] Re: Amazon Analytical Puzzle

gt; -- > best wishes!! > Vaibhav Shukla > DU-MCA > > -- > 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, se

Re: [algogeeks] Re: codechef jan challenge

oops it is running -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit

Re: [algogeeks] Re: codechef jan challenge

cam somebody provide hint in solving this problem ?? I am stuck :( . -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+uns

Re: [algogeeks] Divide an array into two equal subsets

> >>>> algogeeks+unsubscr...@googlegroups.com >>> . >>> >>>> For more options, visit this group at >>> >>>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >>> >> >>> >> -- >&g

Re: [algogeeks] Re: Interview question amazon

On Tue, Jan 4, 2011 at 8:13 AM, rahul patil wrote: > > > On Mon, Jan 3, 2011 at 6:08 PM, juver++ wrote: > >> Tree structure already have parent node link. Even we reconstruct the tree >> as linked list we are not allowed to achieve > > > Normal tree node does not

Re: [algogeeks] Re: Interview question amazon

unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards, Rahul Patil -- You received this message because you are subscribed to the Google Groups &qu

Re: [algogeeks] Re: Interview question amazon

ribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com >> . >> 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

Re: [algogeeks] Re: probability

@snehal: will the shooting take place in increasing order of accuracy of hitting the target and is that at a time only one person can take a shot??? if yes then @Salil: my answer would be the same as above. what C will do is that it will first let A and B kill each other first. After C wastes his s

Re: [algogeeks] Re: probability

@Dave: first of all "By shooting in air" I meant that C will not fire any one. That was my figure of speech:)) He will simply waste his shot. @Salil: its a duel. everyone will get chance to shoot in each round -- You received this message because you are subscribed to the Google Groups "Algo

Re: [algogeeks] probability

Suppose three gunmen are A, B, and C who have a probability of 100%, 50% and 33% respectively. The shooting will start from C, then B and at last A. Now there are several possibilities for C. If C shoots B, then A would shoot C with an accuracy of 100% or in other case if C shoots A, then B would s

Re: [algogeeks] Find The Looping Node

@sneha... WOW we should hang out...:-) On Wed, Dec 22, 2010 at 9:56 PM, snehal jain wrote: > @ above > > well this a ver old and easy problem.. but unlike u, criticizing others wen > u knw the solution i wud rather post my solution.. > > int removeCycle(list head) > { > > struct listnode

Re: [algogeeks] spy in the city

Is there any condition that the people in the city may or may not know each other??? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email t

Re: [algogeeks] Generic Linked list

Use template. On Fri, Dec 17, 2010 at 12:41 PM, siva viknesh wrote: > How to implement a generic linked list?? > > ..this is one of the frequently asked interview question > > ..for this we have to use void pointers > > struct node > { > void *data; > struct node *link; > }; > > ..can anybo

Re: [algogeeks] C output... ???

you would like to read peter ven der linden.(deep C secrets). On Tue, Dec 14, 2010 at 11:19 PM, Saurabh Koar wrote: > When u r passing an array to a function u only pass the base address > nt the total array...bt when sizeof is applied in main() u hv the > whole array. Thats why in the first case

Re: [algogeeks] Re: C aps ques

correct me if I am wrong. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options

Re: [algogeeks] Re: C aps ques

for 2nd problem: statement inside the do-while is executed once. Now for the condition checking inside the while loop. The condition i++<5 is evaluated which turns out to be true. So the rest of the part ++ch<='F' is not evaluated and hence letter A is printed six times. Now when the condition "i++

Re: [algogeeks] for loop performace in terms of speed makes any difference when we run from max to min and min to max

ogle Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com > . > For more options, visit this group at > http://groups.google

Re: [algogeeks] matrix [MS]

oglegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Regards, Rahul Patil -- You received this message because you

Re: [algogeeks] Yahoo coding round question

rray is 10, -3 , 2 , 105, 13 code will fail > 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 i ] > break > } > > } > > Kishen > > On Tue, Oct 19, 2010 at

Re: [algogeeks] Yahoo coding round question

egroups.com > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Regards, Rahul Patil -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send em

Re: [algogeeks] Re: Maximum set of Collinear points

; You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com > . > For more opti

Re: [algogeeks] Modify Queue Data Structure which returns min in O(1) time.

it look like a priority queue type of DS to me. well min-heap is another solution,which do the heap process at each insertion and deletion,so that min element stay the root position. comments invited. regards. On Wed, Oct 13, 2010 at 11:52 PM, malli wrote: > A queue data structure has function

Re: [algogeeks] Re: Do This

n front of some other node,he might want to access it first,so i did the same thing here. He can access his node as he has inserted his node at 3rd place,but actually his node is at 4th place. I hope it will clear your doubt. Rahul. On Thu, Oct 7, 2010 at 4:10 PM, tech rascal wrote: >@Rahul

Re: [algogeeks] linked lists

How about merge sort. On Thu, Oct 7, 2010 at 1:22 PM, snehal jain wrote: > There are two linked list, both containing a character in each node. > > If one linked list contain characters o x e n c and second contain > characters e n c a r t a then the final linked list should contain o x > e n c

Re: [algogeeks] Re: Do This

). Rahul. On Thu, Oct 7, 2010 at 1:05 PM, Akarsh D wrote: > @Rahul : I think the swapping method will work. But still have to use two > pointers. > > On Thu, Oct 7, 2010 at 12:34 AM, sajj wrote: > >> In a single linked list its is not at all possible i hope correct me &g

Re: [algogeeks] Re: Smallest window of K[] in N[]. Best order solution

@prodigy: how is it coming O(nlogk) can u explain??? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googleg

Re: [algogeeks] Do This

@shobhan: Ya,I got it!! -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options,

Re: [algogeeks] Do This

previous solution using two pointer,was it allowed. ? Ans : How about insert after the given pointer and swap the value of newly inserted node with the given pointer node. On Wed, Oct 6, 2010 at 11:20 PM, RAHUL KUJUR wrote: > Take two pointers p and q. Initially p points to head. > >

Re: [algogeeks] Do This

Take two pointers p and q. Initially p points to head. while(p!="given pointer") { p=p->link; q=p; }; Now you hv pointer at 3rd and 4th position. Now insertion is simpleHope this will work -- You received this message because you are subscribed to the Google Groups "Algorithm Geek

<    3   4   5   6   7   8   9   >