Re: [algogeeks] 5 tyres 10000 Kilometers..
If there are total 5 tyres, including the 4 attached ones... you can change do a rotation, change tyre after every 2000 kms( or the factors of 2000), in that case, the journey by each one would be 8000. i think there can be several interpretations of the qn. IF for five extra tyres, wud mean equal use of the 5 new tyres, nt considering the old ones, even in that case, the above wud be true. On Tue, Aug 28, 2012 at 9:39 PM, Prem Krishna Chettri hprem...@gmail.comwrote: Guys Something good to share here.. Query :- Tomorrow I am Planning to take my car for a ride of 1 ( Ten Thousands ) Km. As the journey will be rough so I am planning to pack 5 new tyres.. Now being very conservative, I want to use each of them such that they all wear equally.. Now the question is how shall I achieve it and what will be the total journey traveled by each on of them. -- 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 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 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.
Re: [algogeeks] Tally Solutions Review
ne idea abt how r thy gonna conduct their interview rounds? On Fri, Sep 30, 2011 at 12:18 AM, Sahil Garg garg.sahi...@gmail.com wrote: plz do tell.. i also need sm intervw questions at the earliest.. Sahil Garg Computer Engineering Delhi College of Engineering On Thu, Sep 29, 2011 at 12:26 PM, Chunky Garg g.chunkyg...@gmail.comwrote: Can anyone tell me about tally solutions pvt ltd. how is the company and growth in it.. what all is asked in interviews.. -- Regards Chunky Garg -- 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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] INTEL recruitment process
college? On Thu, Sep 29, 2011 at 10:33 PM, aditya kumar aditya.kumar130...@gmail.com wrote: Guys does any one hve the idea about INTEL interview process for CS students ?? The area they focus and types of question they ask . If any have any idea plz help ! thnks -- 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 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 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.
Re: [algogeeks] Re: google os ques on pipelining
585 + (160 + 5)for slowest transactions *999 for the rest of the instructions! On Tue, Sep 27, 2011 at 12:49 AM, Gene gene.ress...@gmail.com wrote: You guys have the right idea except that since it's multiple choice you can do this with no math. With 1000 data items and only 4 stages, the bottleneck has to be the slowest pipeline stage with its register delay. So you can answer b in 10 seconds and move on to the next question! On Sep 26, 8:50 pm, Dumanshu duman...@gmail.com wrote: @bharat: for the second part where u multiplied (160+5) with 999, it should be 160*999 because it is max of (150,120,160,140,5). Correct me if i am wrong. On Sep 26, 4:02 pm, bharatkumar bagana bagana.bharatku...@gmail.com wrote: for the first instruction : 150+5+120+5+160+5+140=585 ns for the rest of the instructions , though pipeline max(150,120,160,140)=160 (160+5)*999=164835 ns we assume that there will be no extra stalls existed in our system -585 + 164835 =165420 ns =165.4 us... correct me if I'm wrong . On Sun, Sep 25, 2011 at 9:25 AM, siva viknesh sivavikne...@gmail.com wrote: A 4-stage pipeline has the stage delays as 150, 120, 160 and 140 ns (nano seconds) respectively. Registers that are used between the stages have a delay of 5 ns each. Assuming constant clocking rate, the total time taken to process 1000 data items on this pipeline will approximately be a. 120 us (micro seconds) b. 165 us c. 180 us d. 175 us ...plz give detailed explanation for the ans -- 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 http://groups.google.com/group/algogeeks?hl=en. -- **Regards *BharatKumar Bagana* **http://www.google.com/profiles/bagana.bharatkumar http://www.google.com/profiles/bagana.bharatkumar * Mobile +91 8056127652* bagana.bharatku...@gmail.com- Hide quoted text - - Show quoted text - -- 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 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 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.
Re: [algogeeks] Sourcebits [wrriten n interview round]
what package did they offer? On Mon, Sep 26, 2011 at 9:41 AM, aditya kumar aditya.kumar130...@gmail.comwrote: 1st round was a written test . It had 30 mcq's . This was the easiest mcq's . 20 simple aptitude questions were thr along with some 10 C questions . 21 students were shortlisted for the first round . in the interview round they asked me basics questions possibly from all the subjects . 1) deadlock and their condition . 2) any three unix command . 3) dangling pointer and how to avoid dangling ptr . 4) osi layers , their function and protocols used in applocation layer 5) virtual function . and why are they needed . 6) process management . 7) l-value .(this is the only question where i couldnt find proper example to explain ) 8) lseek , what happens if do lseek after we have reached the end of a file . 9) syntax of open command in unix . 10) features of oops and some real life example . 11) how to do data hiding in oops . and few more question which i dint remember For 15 mins he asked me about my project . He went into details of few of them . Since i had done my projects on android so i guess it added to my advantage . after the long four hour wait they announced shortlisted candidates for HR round . they short listed 13 out of 21. In HR round : This was very different Hr round as it was on skype that too video call. Here you got to be very careful coz you dont have the liberty to properly express yourself with hand gestures . There were basic HR questions . Basically you need to sell yourself acc to thier needs . So i convinced them with proper evidence and examples that i am kind of candidates they are looking for . Its very important to go thru the comoany websites since then only you can try explaining them how you can fit into company needs . It took them almost 36 hrs to announce the results . Finally they short-listed 6 out of 13 . On Mon, Sep 26, 2011 at 9:35 AM, manoj manojbag...@gmail.com wrote: hi guys sourcebits is visiting our campus tomorrow can anybody please telll us what type of question wiill be there in wrriten and interview around it would be great help :) -- 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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Yahoo
neone who has appeared for yahoo recently? can ne one mention thr i/w / written rounds experience; they visited dce 3 days back also nit surathkal... -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: D.E Shaw
vich coll? On Fri, Sep 23, 2011 at 5:28 PM, sameer gupta gupta.sameer...@gmail.comwrote: its a telephonic interview ..please guide how to prepare... and please post question if anyone had interview recently -- 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 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 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.
Re: [algogeeks] plz reply quickly
in arrays i guess it can be simply analysed checking the last element of array(which can be obtained by sizeof) checking how the entries are filled inn the array... in linked list hair tortoise rule...initialize two pointers...one's step size:1, second's step size two... run through the linked list, if they meet newhere ...it contains a loop or circular list. On Thu, Sep 22, 2011 at 10:51 PM, sukran dhawan sukrandha...@gmail.comwrote: use hair and tortoise rule for lists i don think we can do it for arrays On Thu, Sep 22, 2011 at 10:22 PM, Ishan Aggarwal ishan.aggarwal.1...@gmail.com wrote: In both the cases... what would be the condition? On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan sukrandha...@gmail.comwrote: queue represnted as array or linked list ? On Thu, Sep 22, 2011 at 10:08 PM, Ishan Aggarwal ishan.aggarwal.1...@gmail.com wrote: How will u detect if a queue is circular or not?? -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.com puneet.ar...@aricent.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 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 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. -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.com puneet.ar...@aricent.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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Min no of moves
doesnt ur soln fails for even n? suppose initial config : || now starting with second n +2 th FEFF||EFEE next 4, n+4: FEFE || EFEF 4th 5th EE are continuous, correct me if m wrong: my soln wud rather start with swaping 2nd 2n - 2 th element... n/4 swaps... On Sun, Sep 4, 2011 at 3:24 PM, SHIVAM AGRAWAL shivi...@gmail.com wrote: There are 2n glasses standing next to each other in a row, the first n of them are filled with a soda drink, while the remaining n glasses are empty. Make the glasses alternate in a filledempty- filled-empty pattern in the minimum no of glass moves. my soln is start with 2nd and (n+2)th swap them and then move to 4th and n+4th this is to be done n/2 times.total swaps are n/2 .. and total moves n/2*2 ie n... mine is n moves ...any1 with some better answer ??? -- 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 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 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.
Re: [algogeeks] Re: Info about Epic Written Exam
can ne one post their experience of their test??? On Mon, Sep 5, 2011 at 3:27 PM, siva viknesh sivavikne...@gmail.com wrote: plz mail me too once u ve attended On Sep 5, 7:09 am, Akshay Rastogi akr...@gmail.com wrote: Ditto harshit :) On Sun, Sep 4, 2011 at 7:36 PM, sinjanspecial sinjanspec...@gmail.com wrote: @harshit if u wl get EPIC paper pattern then plz forward it also to me On Sep 3, 11:59 pm, Harshit Sethi hshoneyma...@gmail.com wrote: hi,can anyone tell me what's the procedure of recruiting in EPIC. what's the format of written test.Which are the different sections in the exam ? Also,whether it is a good place to work or not? Thanks in advance !!! -- 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 http://groups.google.com/group/algogeeks?hl=en. -- AKSHAY RASTOGI BE(Hons) CS BITS PILANI , Pilani -- 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 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 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.
Re: [algogeeks] Immediate Need for Informatica Developer in IN !! $40/Hr Max...
@shady : +1 On Wed, Aug 31, 2011 at 10:22 PM, shady sinv...@gmail.com wrote: you are banned... if this mail is genuine and then message me. On Wed, Aug 31, 2011 at 9:16 PM, katie williams katiewilliams...@gmail.com wrote: *Immediate Need for Informatica Developer in IN !! $40/Hr Max...* ** Job Title: Informatica Developer Location: Indianapolis, IN Duration: 3+ Months *Please send all resumes to **ka...@itbrainiac.com*ka...@itbrainiac.com $40/Hr MAX Project/Position Description and Responsibilities: The Interface Developer will assist project team in designing a solution to create a new Enterprise Quality Management instance of a Trackwise database for Elanco. The Developer will interact with members of various organizations to understand data movement and uses and propose solutions, including utilization of web services. Thanks, Katie - Staffing Manager 201-855-4204 ka...@itbrainiac.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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: probability ques
@DAVE again u r considering a finite space... in the above case...but how
wud u take the space in real number thing...with no particular info thr
r infinite real number frm 1-100...if i cud change the qn to find the
probability the chosen number is in the range a to a+1 ...thn it cud be
aptly answered
On Tue, Aug 30, 2011 at 10:10 AM, Dave dave_and_da...@juno.com wrote:
@AnikKumar: Most people normally wouldn't have difficulty with
probabilities on the real numbers. E.g., there is a target with two
regions, the bullseye with radius 1 and a concentric region with
radius 2. What is the probability of a randomly-thrown dart hitting
the bullseye, given that it hits the target? Most people would say
that since the area of the bullseye is 1/4 the area of the target, the
probability is 1/4. Wouldn't you say that, too?
Dave
On Aug 29, 11:15 pm, AnilKumar B akumarb2...@gmail.com wrote:
Agree with Don.
But what if we want to find probability of on real line?
How we can consider R as sample space?
Is that Sample space should be COUNTABLE and FINITE?
*By the quadratic formula, a is 2.08712 or 47.9128.
The range is 45.8256.
A falls in the range of 1..100 or 99. So the probability is 47.9128/99*
*
*
*Here you are considering Sample space as length of the interval, right?
but
i think it should be cardinal({x/x belongs to Q and x belongs to
[1,100]}).*
On Fri, Aug 26, 2011 at 2:04 AM, Aditya Virmani
virmanisadi...@gmail.comwrote:
+1 Don... nthin is specified fr the nature of numbers if thy can be
rational or thy hav to be only natural/integral numbers...
On Wed, Aug 24, 2011 at 9:33 PM, Don dondod...@gmail.com wrote:
First find the endpoints of the region where the condition is met:
a + 100/a = 50
a^2 - 50a + 100 = 0
By the quadratic formula, a is 2.08712 or 47.9128.
The range is 45.8256.
A falls in the range of 1..100 or 99. So the probability is 47.9128/99
= 0.48397
Don
On Aug 23, 11:56 am, ramya reddy rmy.re...@gmail.com wrote:
Let 'a' be a number between 1 and 100. what is the probability of
choosing
'a' such that a+ (100/a) 50
--
Regards
Ramya
*
*
*Try to learn something about everything and everything about
something*
--
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
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 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.- Hide quoted text -
- Show quoted text -
--
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
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 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.
Re: [algogeeks] Doubt
it runs perfectly for me on both 64 bit 32 bit... check again
On Sun, Aug 28, 2011 at 2:20 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
The following C program segfaults of IA-64, but works fine on IA-32.
*int* main()
{
*int p;
p *=* (*int)malloc(*sizeof*(*int*));
***p *=* 10;
*return* 0;
}
Why does it happen so?
--
Nikhil Gupta
Senior Co-ordinator, Publicity
CSI, NSIT Students' Branch
NSIT, New Delhi, India
--
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
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 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.
Re: [algogeeks] Re: elitmus test
focus on quant di...verbal wud be easy...as in our college, thr were two papers, on which had gud level of quant qns...qns were nt tough to crack, but involved calculations which may take gud amt of time...like thr was 1 qn: find the sum of first 1234 terms in the series 121221222112. its easy but calculations may be high if u dun do it wit sum trick, second paper had tougher DI but pretty easy quant...so u hav to manage ur time well... On Sun, Aug 28, 2011 at 1:00 AM, prasanna rockslife2...@gmail.com wrote: thanks...:) hope someone adds some more questions..:) -- 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 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 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.
Re: [algogeeks] Re: probability ques
+1 Don... nthin is specified fr the nature of numbers if thy can be rational or thy hav to be only natural/integral numbers... On Wed, Aug 24, 2011 at 9:33 PM, Don dondod...@gmail.com wrote: First find the endpoints of the region where the condition is met: a + 100/a = 50 a^2 - 50a + 100 = 0 By the quadratic formula, a is 2.08712 or 47.9128. The range is 45.8256. A falls in the range of 1..100 or 99. So the probability is 47.9128/99 = 0.48397 Don On Aug 23, 11:56 am, ramya reddy rmy.re...@gmail.com wrote: Let 'a' be a number between 1 and 100. what is the probability of choosing 'a' such that a+ (100/a) 50 -- Regards Ramya * * *Try to learn something about everything and everything about something* -- 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 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 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.
Re: [algogeeks] C Trick
subtract the two check if its greater thn 0... c=a-b, if(c 1000 ) printf(a) else printf(b) On Tue, Aug 23, 2011 at 7:50 PM, *$* gopi.komand...@gmail.com wrote: int a,b; int c=a-b; c=c31; int x =c0x01; a=a-x*c; Thx, --Gopi On Tue, Aug 23, 2011 at 7:32 PM, Sanjay Rajpal srn...@gmail.com wrote: @teja : use of comparison operator is not allowed. Sanju :) On Tue, Aug 23, 2011 at 6:42 AM, teja bala pawanjalsa.t...@gmail.comwrote: int a,b,c; c=(ab)?a:b; print(c); On Tue, Aug 23, 2011 at 6:37 PM, Abhishek Yadav algowithabhis...@gmail.com wrote: Write a method which finds the maximum of two numbers You should not use if-else or any other comparison operator. -- 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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en. -- Thx, --Gopi -- 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 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 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.
Re: [algogeeks] sol
@priya..wht if a=b=0 ? or a=b= 1000 On Sat, Aug 20, 2011 at 11:33 PM, priya ramesh love.for.programm...@gmail.com wrote: the answer is 1 sum=1 -- 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 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 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.
Re: [algogeeks] Re: crossing a bridge; running away from zombies (logic puzzle)
thts a Google question...17 is the answer On Sat, Aug 20, 2011 at 2:08 AM, Dave dave_and_da...@juno.com wrote: @Icy: A few years ago this was reported to be a Microsoft interview question. It is so well publicized now that most people here have probably seen it. 1 and 2 cross. 1 returns. (alternatively, 2 returns) 5 and 10 cross. 2 returns. (alternatively, 1 returns) 1 and 2 cross. 17 minutes. Dave On Aug 19, 3:25 pm, icy` vipe...@gmail.com wrote: Hey everyone, I recently joined this group, so I thought I'd add a short interview/ logic puzzle that I remember hearing. Hopefully it wasnt already said. Part of the fun is the story, so here it goes... Four people have been running away from a pack of zombies, and are now injured in varying degrees. It is already nighttime, and they have come upon a bridge. They must cross the bridge as fast as possible before the pack of zombies comes upon them, but the bridge is very dark, slippery, and cannot support much weight. There is one flashlight. Rules: * the bridge must be crossed with the flashlight, only two people at most. A return trip must be made (the flashlight cannot be thrown back, etc) * the four people cross the bridge at different speeds: 1minute, 2 minutes, 5 min, and 10min. A trip time is determined by the slowest person. So if the 1min crosses together with the 5min, the trip time is 5min. *if a person falls off the bridge, he/she goes to /dev/null;P So what is the fastest way for everyone to cross the bridge, and how long does that take? ~icy -- 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 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 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.
Re: [algogeeks] Re: crossing a bridge; running away from zombies (logic puzzle)
:D just sayin mahn...bura mat maan :D On Sun, Aug 21, 2011 at 12:23 AM, sagar pareek sagarpar...@gmail.comwrote: @aditya Any puzzle asked by any company doesn't mean that it belongs to that particular company. I encounter this question first time in 2005 through a flash game. On Sun, Aug 21, 2011 at 12:17 AM, Aditya Virmani virmanisadi...@gmail.com wrote: thts a Google question...17 is the answer On Sat, Aug 20, 2011 at 2:08 AM, Dave dave_and_da...@juno.com wrote: @Icy: A few years ago this was reported to be a Microsoft interview question. It is so well publicized now that most people here have probably seen it. 1 and 2 cross. 1 returns. (alternatively, 2 returns) 5 and 10 cross. 2 returns. (alternatively, 1 returns) 1 and 2 cross. 17 minutes. Dave On Aug 19, 3:25 pm, icy` vipe...@gmail.com wrote: Hey everyone, I recently joined this group, so I thought I'd add a short interview/ logic puzzle that I remember hearing. Hopefully it wasnt already said. Part of the fun is the story, so here it goes... Four people have been running away from a pack of zombies, and are now injured in varying degrees. It is already nighttime, and they have come upon a bridge. They must cross the bridge as fast as possible before the pack of zombies comes upon them, but the bridge is very dark, slippery, and cannot support much weight. There is one flashlight. Rules: * the bridge must be crossed with the flashlight, only two people at most. A return trip must be made (the flashlight cannot be thrown back, etc) * the four people cross the bridge at different speeds: 1minute, 2 minutes, 5 min, and 10min. A trip time is determined by the slowest person. So if the 1min crosses together with the 5min, the trip time is 5min. *if a person falls off the bridge, he/she goes to /dev/null;P So what is the fastest way for everyone to cross the bridge, and how long does that take? ~icy -- 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 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 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. -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT 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. 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Puzzle
@prem... what if only M is married? if m is married, n is not married that says L may or may not be married. If L is not married, that gives for M may or may not be married. For only N to be married, L is not married, that says M may or may not be married. same does apply for L. On Fri, Aug 19, 2011 at 12:28 PM, Prem Krishna Chettri hprem...@gmail.comwrote: Only N is Married.. as if L is not married that n Must be married .. Again for M to marry N must not Marry. but as N is Married.. so.. M cannot marry... On Fri, Aug 19, 2011 at 9:24 AM, Dheeraj Sharma dheerajsharma1...@gmail.com wrote: M and N are married On Fri, Aug 19, 2011 at 5:19 AM, Abhishek Sharma jkabhishe...@gmail.comwrote: M (hint: replace ü and û with their actual meaning.. u 'll understand) On Fri, Aug 19, 2011 at 4:10 AM, payal gupta gpt.pa...@gmail.comwrote: was there anything more specified Regards, PAYAL GUPTA On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani virmanisadi...@gmail.com wrote: If ü - Married û - Not Married and M-ü N-û N-ü L-û L-û M-ü Who is married? qn was put up in this way, asked in Deloitte 2004. -- 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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en. -- *Dheeraj Sharma* Comp Engg. NIT Kurukshetra +91 8950264227 -- 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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Puzzle
this qn is copy pastewd as it is...no further instructions etc provided On Fri, Aug 19, 2011 at 6:06 PM, priya ramesh love.for.programm...@gmail.com wrote: i think the question should be elaborated a li'l more. Plz give the sentences given in the puzzle. May be we cud solve then -- 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 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 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.
[algogeeks] Puzzle
If ü - Married û - Not Married and M-ü N-û N-ü L-û L-û M-ü Who is married? qn was put up in this way, asked in Deloitte 2004. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] an amazing amazon question!
+1 sagar pareek... i used the following approach: let the num be xy so... (10y + x) - (10x + y) is the distance travelled in 1 hr... now, the the next milestone must be a three digit number, which can be of following compostion: 1xy or xzy or yzx whr 0=z9 coz aif z=9, distance travlled in tht hr wud be more thn 100, which can nt be the case( in contradiction with the distance in 1st hr)... now if its 1xy, 9(y-x) = 100 + 9 (x-y) which can nt give integral soln..so num must be xzy...thn 9(y-x) = 99x + 10z - 9y... now fr integral solution: z must be a multiple of 9, can be 0 or 9... hence it has to be 0. so 9(y-x)=9(11x-y) 2y=12x y=6x posbl soln: x=0,y=0...rejected x=1, y=6... accepted On Wed, Aug 17, 2011 at 11:22 PM, Rohit Srivastava access2ro...@gmail.comwrote: logic plz? On Wed, Aug 17, 2011 at 10:35 PM, sagar pareek sagarpar...@gmail.comwrote: 16, 61, 106 average speed is 45 miles/hour On Wed, Aug 17, 2011 at 10:28 PM, priya ramesh love.for.programm...@gmail.com wrote: A car is traveling at a uniform speed.The driver sees a milestone showing a 2-digit number. After traveling for an hour the driver sees another milestone with the same digits in reverse order.After another hour the driver sees another milestone containing the same two digits. What is the average speed of the driver? -- 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 http://groups.google.com/group/algogeeks?hl=en. -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT 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. 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. -- 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 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 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.
Re: [algogeeks] shop keeper and the buyer
if k is fixed, sort the items according to their price, buy k cheapest items
start taking the most expensive item fr free
actually tht is nt a real lyf prblem, usually the dealers limit no. of free
items on a single bill k i never constant, tht may create
inconsistencies.
On Sat, Aug 13, 2011 at 6:58 PM, Prakash D cegprak...@gmail.com wrote:
anyone?
On Fri, Aug 12, 2011 at 3:49 AM, cegprakash cegprak...@gmail.com wrote:
there are n number of items available in the shop
price[] {size n} gives the cost of each item
and there are quantity[] {size n} means that there are quantity[i]
number of i'th item
the shop keeper provides some free items
if you buy k nos of item i, you will get 1 item j for free (i may be
equal to j)
also there can be such offers for many items
what you have to do is to buy all the items in shop with minimum
expenditure.
.
source: own problem (i don't have the solution)
--
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
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 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.
--
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
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks]
u can never find tht thru ur prgm...sizeof int is compiler dependant whether its 32/64 bit... On Thu, Aug 11, 2011 at 4:35 PM, sukran dhawan sukrandha...@gmail.comwrote: how to determine whether the machine is a 32 bit or 64 bit using a c program? is it by sizeof(int) * 4? -- 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 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 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.
Re: [algogeeks] Probability question.. help
is it 100 men 100 women? On Wed, Aug 10, 2011 at 3:25 PM, programming love love.for.programm...@gmail.com wrote: is it 101/200?? On Wed, Aug 10, 2011 at 3:41 AM, Prakash D cegprak...@gmail.com wrote: is there anything like there should be atleast one man and one women should dance together? On Wed, Aug 10, 2011 at 2:26 AM, Shuaib Khan aries.shu...@gmail.comwrote: On Wed, Aug 10, 2011 at 1:45 AM, Brijesh Upadhyay brijeshupadhyay...@gmail.com wrote: No thers is not.. someone has asked me this., dont know anything else about the question :| Seems like you got half of the question there. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/mqMvDgb6TqUJ. 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. -- Shuaib http://www.bytehood.com http://twitter.com/ShuaibKhan -- 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 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 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. -- 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 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 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.
Re: [algogeeks] c question!
is it giving an error at *nodeptr declaration?
On Tue, Aug 9, 2011 at 8:26 PM, programming love
love.for.programm...@gmail.com wrote:
#includestdio.htypedef struct {char * a;
}*nodeptr;
main(){nodeptr *h;h-a=programming;printf(hi %s\n, h-a);}
this gives an error. Please explain the concept behind this.
--
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
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 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.
Re: [algogeeks] Re: MS question
i guess ur qn was how will u decide which frame shud b ur thumbnail...as after tht, the frame cud be set as a thumbnail which is pretty much an eay task in windows programming.i think most, dun hav much info abt it though, thumbnails shud contain more of data; i mean shudnt be unicolour(blank screen). On Tue, Aug 9, 2011 at 11:30 PM, *$* gopi.komand...@gmail.com wrote: I guess , it can be done using indexing , with time stamp as key , and frame pointer as data .. Please correct me if I am wrong. On Tue, Aug 9, 2011 at 11:03 PM, Priyanshu priyanshuro...@gmail.comwrote: Anyone?? Regards, Priyanshu Gupta On Fri, Aug 5, 2011 at 6:09 PM, priyanshu priyanshuro...@gmail.comwrote: Give an efficient algorithm to determine which part of the video should be displayed as a thumbnail?? -- 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 http://groups.google.com/group/algogeeks?hl=en. -- Thx, --Gopi -- 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 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 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.
Re: [algogeeks] mcq
yes it may reduce the space req...suppose a subroutine is never called by a execution, thn the memory req by tht subroutine wnt be allocated. On Mon, Aug 8, 2011 at 4:26 PM, vijay goswami vjrockks...@gmail.com wrote: it reduces the size of the source file On Mon, Aug 8, 2011 at 4:18 PM, sourabh jakhar sourabhjak...@gmail.comwrote: b On Mon, Aug 8, 2011 at 4:18 PM, Kamakshii Aggarwal kamakshi...@gmail.com wrote: Which is not an advantage of using subroutines? (a) Easier maintenance (b) Runtime reduces (c) Storage space reduces (d) Modularity one of the answer is b. what about c? does subroutine reduce space? -- Regards, Kamakshi kamakshi...@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 options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- SOURABH JAKHAR,(CSE)(Final year) ROOM NO 167 , TILAK,HOSTEL 'MNNIT ALLAHABAD The Law of Win says, Let'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. 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. -- 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 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 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.
Re: [algogeeks] Re: max product!
what if the input is all negative? On Mon, Aug 8, 2011 at 12:57 PM, WgpShashank shashank7andr...@gmail.comwrote: hey guys I think we can do it in O(N) Check out http://shashank7s.blogspot.com/2011/07/find-three-numbers-in-array-which-forms.html let me know missed something ? Thanks Shashank CSE,BIT Mesra -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/sC6zcqbh3ZUJ. 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: max product!
what if we can maintain three arrays: large_positives[3]: containing three largest positive numbers., large_negatives[2]: negative numbers with largest magnitude, small_negatives[3]: negative numbers with least magnitudes. Now thr may be following cases: 1) No. of postive numbers 3 no. of negative numbers=2, thn max product cud be, product of numbers in large_positives or product of largest positive number with numbers in large_negatives. 2) No. of positive numbers is 0(i.e all negatives), max product wud be product of numbers in small_negatives. 3)No. of positives is 1(though not required explicitly), product of numbers in large_negatives with positive number. 4) No. of positives is 2: max product wud be max of, product of two positive numbers with small_negative or product of small_negatives. Time complexity: O(n) Space complexity: O(1) I hope all the cases are covered, if not, please correct me On Mon, Aug 8, 2011 at 4:40 PM, Aditya Virmani virmanisadi...@gmail.comwrote: what if the input is all negative? On Mon, Aug 8, 2011 at 12:57 PM, WgpShashank shashank7andr...@gmail.comwrote: hey guys I think we can do it in O(N) Check out http://shashank7s.blogspot.com/2011/07/find-three-numbers-in-array-which-forms.html let me know missed something ? Thanks Shashank CSE,BIT Mesra -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/sC6zcqbh3ZUJ. 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] realloc and malloc
implementing these functions is not tht an easy task...google it...u ll find malloc for sure...thr r diff versions available. On Mon, Aug 8, 2011 at 10:56 AM, Aman Kumar amanas...@gmail.com wrote: Hiii tell me how to implement own realloc and malloc and free function? any link for this?? If anybody is implemented it,give code ? -- 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 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 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.
Re: [algogeeks] os
shared memory On Mon, Aug 8, 2011 at 5:43 PM, Himanshu Srivastava himanshusri...@gmail.com wrote: named pipes!!! On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal kamakshi...@gmail.comwrote: Fastest IPC mechanism is 1. ?shared memory 2. ?pipes 3. ?named pipes 4. ?Semaphores -- Regards, Kamakshi kamakshi...@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 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 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] realloc and malloc
In malloc, u wud hav to manage free memory too, avoid fragmentation etc
On Mon, Aug 8, 2011 at 5:29 PM, Prem Krishna Chettri hprem...@gmail.comwrote:
If U Knw the inner DS of MM.. I can help U ...
MALLOC :-
Jst retrun the add of the pointer from where U shoud start the
Allocation to the point upto where U want.
Say :- Memeory is a chuck of space which can be represented by my global
array like char Heap[1000]; Considering 1000 is the total heap size. Now I
wll take a counter variable like int Count=0; to calculate the data being
occupied.
Now here is your malloc :-
void * malloc ( int size)
{
void * loc = (void *) Heap[Count];
Count=Count + size;
retrun loc;
}
Now there is many flavour and check which I can explain U but probably this
is not the better way to give Demo..
enjoy ..
On Mon, Aug 8, 2011 at 5:23 PM, Aditya Virmani
virmanisadi...@gmail.comwrote:
implementing these functions is not tht an easy task...google it...u ll
find malloc for sure...thr r diff versions available.
On Mon, Aug 8, 2011 at 10:56 AM, Aman Kumar amanas...@gmail.com wrote:
Hiii
tell me how to implement own realloc and malloc and free function?
any link for this??
If anybody is implemented it,give code ?
--
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
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 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.
--
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
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 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.
Re: [algogeeks] mcq
link time i guess On Mon, Aug 8, 2011 at 5:38 PM, hary rathor harry.rat...@gmail.com wrote: link time -- 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 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 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.
Re: [algogeeks] Doubts
4.94 ns c c b On Tue, Aug 9, 2011 at 1:32 AM, aditi garg aditi.garg.6...@gmail.comwrote: Q1.in a memory hierarchy, M1,M2 M1 access time is 2 ns ,M2 accesstime is 100 ns . the hit ratio for M1 is .97, then what's the avg access time? Q2.two heaps of sizes m,n are given, then the time needed to merge them a)m b)n c)m+n d) none Q3.context switching is useful in a) spooling b) polling c)interrupt handling d) interrupt servicing Q4Reentrant os required a)multitasking b)multiuser c)both d)none -- 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 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 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.
Re: [algogeeks] OUTPUT????
output wud be:
0.00
float value= 00.0
integer value=1
1 1 1 0.00
On Sat, Aug 6, 2011 at 2:49 PM, SHIVAM AGRAWAL shivi...@gmail.com wrote:
any1 plz tell me y output of float type of dis prgrm is zero?
#includestdio.h
#define INT 1
main()
{
struct a
{
int type;
};
struct c
{
int type;
int e;
};
struct b
{
int type;
float f;
};
union
{
struct a n;
struct b nf;
struct c ni;
}all;
all.ni.type=INT;
all.nf.f=10.43;
all.ni.e=1;
printf(%f\n,all.nf.f);
if(all.nf.type==INT)
printf(float value =%2.1f,all.nf.f);
if(all.ni.type==INT)
printf(\ninteger value=%d,all.ni.e);
printf(\n%d %d %d %f,all.ni.type,all.nf.type,all.ni.e,all.nf.f);
--
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
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 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.
Re: [algogeeks] size -------
i guess it depends on ur system configuration...for 32 bit
machines...respective sizes allocated would be 4,4,8 :giving 16
on 64 bit machines it wud be 8,8,8: giving 24. Correct me if i am wrong.
On Sat, Aug 6, 2011 at 9:24 PM, SANDEEP CHUGH sandeep.aa...@gmail.comwrote:
@ sukran , nitish :
guys, i dnt knw about the output from these online compliers..
On Sat, Aug 6, 2011 at 9:20 PM, SANDEEP CHUGH sandeep.aa...@gmail.comwrote:
@payel : according to u,,starting address cannot be 4.. ok.
but wat if i hav used the following structure before that structure
struct demo1
{
char a;
int b;
char c;
}
On Sat, Aug 6, 2011 at 9:06 PM, Nitish Garg nitishgarg1...@gmail.comwrote:
Why does Ideone https://ideone.com/1Uwxx gives 16?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/L-zANxDDTUQJ.
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.
--
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
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 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.
Re: [algogeeks] GS on campus
@arvind : which college? @sameer: how much are they offering? On Sat, Aug 6, 2011 at 9:07 PM, arvind kumar arvindk...@gmail.com wrote: oh ok..for us on 12th! On Sat, Aug 6, 2011 at 6:46 PM, Shashank Jain shashan...@gmail.comwrote: 10th aug Shashank Jain IIIrd year Computer Engineering Delhi College of Engineering On Sat, Aug 6, 2011 at 6:37 PM, arvind kumar arvindk...@gmail.comwrote: @sameer:When is GS visitin ur coll?? On Sat, Aug 6, 2011 at 4:17 PM, sameer gupta sgsa...@gmail.com wrote: Delhi College Of Engg On Sat, Aug 6, 2011 at 4:12 PM, NIKHIL JAIN nikhil.jain.shali...@gmail.com wrote: which college -- 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 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 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. -- 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 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 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. -- 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 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 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.
Re: [algogeeks] address calculation
1033,2066? On Sat, Aug 6, 2011 at 11:09 PM, aditi garg aditi.garg.6...@gmail.comwrote: CHAR A[10][15] AND INT B[10][15] IS DEFINED WHAT'S THE ADDRESS OF A[3][4] AND B[3][4] IF ADDRESS OF A IS OX1000 AND B IS 0X2000 -- 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 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 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.
Re: [algogeeks] My senior's Interview Experience at Microsoft who got selected and offered a 16lacks package
thiis is theexact thing i thought abt segmentation error...but it is again system-dependent...if u wud try this on 7 or vista or XP...which are high on resources it wont give error to that...but there is definately an error in code... but y do u think tht junk wont be overwritten? s is simply a pointer to a memory address...contents can be changed whenever reqd...? On Thu, Aug 4, 2011 at 8:51 PM, Poised~ dip10c...@gmail.com wrote: @ Muthu raj: My bad, didn't check it properly. It is surely a runtime error. @ Niteesh Mehra: That code is even more wrong. without assigning any memory to str, how will you copy anything into it? This will definitely be a runtime error. http://ideone.com/erEXf -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/NrO6EJiurBkJ. 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. -- 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 http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: pointer question
it has 4bytes in memory, pointed by the char pointer...just remember *(s+1) means jump by the size of pointer(here char); so it will print first byte in 1st cycle, so on... On Thu, Aug 4, 2011 at 10:11 PM, Vijay Khandar vijaykhand...@gmail.comwrote: Thanks, but can u elaborate some more explanation, that how for loop is working here Vijay On Thu, Aug 4, 2011 at 9:52 PM, wastrel virmanisadi...@gmail.com wrote: floating point numbers are stored in 4 bytes with first 3 bytes storing the mantissa part...1st bit of last byte stores the sign of mantissa... rest of the bits store the magnitude of the exponent relative to +127( exponent + 127 wll be stored). Now ur num will be stored as 5375 in first 3 bytes 130 in last 7 bits of 7 byte...calculate for urself the bit representation... x in printing signifies printing in hexadecimal format...2 signifies no more than 2 hexadecimal numbers wud be printed... -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/JjIHYsEXmXcJ. 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. -- 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 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 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.
