DCE
i am also want to know recruitment process as it is coming on 23rd.
On Sep 21, 7:52 pm, Simran Singh sammy.4...@gmail.com wrote:
Hey.. Which college you from..?? And please do tell more about their
process..
On Wed, Sep 21, 2011 at 7:31 PM, abhishek abhishek.ma...@gmail.com wrote:
http://stackoverflow.com/questions/4573744/modify-a-given-number-to-find-the-required-sum/4573881#4573881
for
solution.. And please do share all the info you gather about the process..
On Wed, Sep 21, 2011 at 9:31 PM, abhishek abhishek.ma...@gmail.com wrote:
DCE
i am also want to know
Can anyone give an insight into the way XOR operations are used for swapping
two variables?
--
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/-/ZJ_fiB6VmlQJ.
To
@abhi For XOR
a=a^b;
b=a^b;
a=a^b;
On Tue, Jul 12, 2011 at 4:26 PM, Abhi abhi123khat...@gmail.com wrote:
Can anyone give an insight into the way XOR operations are used for
swapping two variables?
--
You received this message because you are subscribed to the Google Groups
Algorithm
@vaibhav
Overflow problem in case of big number in option b.
the best and simple one is option a.
Best Wishes
Sachin Sharma | Software Trainee | Information Mosaic
New York | Dublin | London | Luxembourg | New Delhi | Singapore | Melbourne
|
e-mail: sachinku...@informationmosaic.com
Option A: Works on all data types
Option B: Works on numerical data, (best on integral data) but leads to
overflow problem
Option C: XOR would solve the problem of overflow, but afaik bitwise
operators work on integral data
Regards,
Sandeep Jain
On Mon, Jul 11, 2011 at 12:03 PM, sachin sharma
only first is conditionally independent and other options are used with some
conditions thats why always first one is preferable.
On Mon, Jul 11, 2011 at 12:03 PM, sachin sharma sachin.bles...@gmail.comwrote:
@vaibhav
Overflow problem in case of big number in option b.
the best and simple
thanks sandeep sir
On Mon, Jul 11, 2011 at 12:16 PM, aditya pratap contacttoadity...@gmail.com
wrote:
only first is conditionally independent and other options are used with
some conditions thats why always first one is preferable.
On Mon, Jul 11, 2011 at 12:03 PM, sachin sharma
1.using temporary variable method is the best as it is applicable to all
datatype.
2.using airthmatic expresion:- problem arise if we r swap the value using
pointer and both pointer point to same location
let int *x and int *y both point to a=20;
now we write a method swap
void swap(int
@Vaibhav: Your method b doesn't work for floating point numbers
because they have finite precision. E.g.,as an extreme example, try it
on a = 1 and b = 1d-25. When you form a+b, the result is 1, not 1 +
1d-25. Then 1 - 1d-25 gives 1 (which is correct), and 1 - 1 = 0. The
latter should be 1d-25, so
using a temp variable is considered to be the best option..
On 7/11/11, Dave dave_and_da...@juno.com wrote:
@Vaibhav: Your method b doesn't work for floating point numbers
because they have finite precision. E.g.,as an extreme example, try it
on a = 1 and b = 1d-25. When you form a+b, the
Oh I got it.
If ( interview at google)
{
Map reduce
} else if(interview at yahoo) {
Hadoop
} else {
Your personal preference.
}
On Thu, Jun 30, 2011 at 4:02 AM, bittu shashank7andr...@gmail.com wrote:
1.Use Haddop Map Reduce Framework .Obviously We Need Distributed
Algo we will make
1.Use Haddop Map Reduce Framework .Obviously We Need Distributed
Algo we will make one computer as master assign the job to all
slave computer to do the crawling the web depending upon the
geographic area ( m thinking real time problem).to crawled the
maximum
pages in least time we need
lol... unfortunately i gave the same answer, and they told me to try my luck
at google..
Regards,
Priyanshu Gupta
On Tue, Jun 28, 2011 at 10:42 AM, pacific :-) pacific4...@gmail.com wrote:
Brin and Larry would be the best people to answer this question.
On Tue, Jun 28, 2011 at 12:10 AM,
:))
On 28 June 2011 23:27, Priyanshu priyanshuro...@gmail.com wrote:
lol... unfortunately i gave the same answer, and they told me to try my
luck at google..
Regards,
Priyanshu Gupta
On Tue, Jun 28, 2011 at 10:42 AM, pacific :-) pacific4...@gmail.comwrote:
Brin and Larry would be
anyone!!!
On Jun 23, 3:28 pm, Priyanshu priyanshuro...@gmail.com wrote:
You have 100 computers, connected with each other. Give the most efficient
way to design a web crawler, which will crawl most pages in least amount of
time.
Thanks,
Priyanshu.
--
You received this message because you
@umesh kewat :
In worst case it will be O(nk) in case of your solution.
check for this case:
01-06-11-16
02-07-12-17
03-08-13-18
04-09-14-19
05-10-15-20
--
Krunal
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
@umesh kewat:
In worst case it will be O(n*k), by your solution.
01-06-11-16
02-07-12-17
03-08-13-18
04-09-14-19
05-10-15-20
--
Krunal
By umesh kewat:
Create binary search tree using n nodes of K list den do in-order and
make a
single list
--
You received
@Bittu
I am confused about one point you need to process atleast n*k
elements so how will you do it in nlogk time. It seems really
tricky if possible.it's min time should be O(nk). correct me if I
am wrong.
On Sep 17, 6:34 am, tkcn tkcna...@gmail.com wrote:
Use k-way merging +1.
1.
Create binary search tree using n nodes of K list den do in-order and make a
single list
On Fri, Sep 17, 2010 at 12:58 PM, vikas kumar vikas.kumar...@gmail.comwrote:
@Bittu
I am confused about one point you need to process atleast n*k
elements so how will you do it in nlogk time.
@vikas: Total number of elements are not n*k. Total number of elements are
n, which are divided into k lists.
@Rahul Singal: +1 for ur answer.
On Fri, Sep 17, 2010 at 12:58 PM, vikas kumar vikas.kumar...@gmail.comwrote:
@Bittu
I am confused about one point you need to process atleast n*k
Use k-way merging +1.
1. Before the merging start, sorting these lists according to the
first element of each list. // O(k log k)
2. So the first element in the first list is the smallest element. Put
the smallest into the result array. // O(1)
3. Then, using binary search to find the new
22 matches
Mail list logo
