Prepare to spend atleast 20 Lakhs
On Tue, Jun 25, 2013 at 4:49 PM, Jagannath Prasad Das
jpdasi...@gmail.comwrote:
Folks,
I suppose this is not the right blog to query about the aforementioned
subject, but i am of opinion that i can get a comprehensive reply to my
question. On an average
I think you should go to Edulix.com. There you can find details about the
expenses for MS in a many different US universities
On Tue, Jun 25, 2013 at 4:54 PM, Shachin Sharma shac...@gmail.com wrote:
Most of the good/top universities will have many TA and RA positions.
Besides this University
Sorry for lot of typos
On Mon, Apr 9, 2012 at 1:53 PM, Varun Nagpal varun.nagp...@gmail.comwrote:
GP programming on GPU is useful for those algorithms which are
computationally intensive, can be paralleled with least overheads,
granularity of per thread computations is not big, less+similar
cool
On Tue, Feb 28, 2012 at 9:22 PM, Ravi Ranjan ravi.cool2...@gmail.comwrote:
hey Geeks thanx a lot .. for the valuable information in the
discussions
i got selected in Yatra.com (R n D profile)
thanx a lot for the algorithms explained by to guys
THANX A LOT
:D:D:D:D
--
Thats right. Clock speed is governed by slowest processing stage + register
delay. With clock cycle of (160+5) ns even the faster stages will be forced
to run slowly. As a result 1st instruction will take 165*4 ns and rest of
following 999 instructions will take 165*999 ns.
On Tue, Sep 27, 2011
Dude google C++ Faqs. You will find all your answers. You can also buy some
books
1. C++ Common Knowledge: Essential Intermediate Programming
2. Effective and More effective C++
3. C++ gotchas
On Sat, Sep 24, 2011 at 11:52 AM, Decipher ankurseth...@gmail.com wrote:
Q1) What does the compiler
list.*
*
*
*
*
*Thanks *
*V.*
*
*
*
*
On Thu, Jul 28, 2011 at 6:43 PM, Varun Nagpal varun.nagp...@gmail.comwrote:
Thanks a lot for your inputs Sunny. Your solution seems correct to me. Is
this the only method ? Can you think of any other methods which could be
more efficient. I heard merge sort
Thanks a lot for your inputs Sunny. Your solution seems correct to me. Is
this the only method ? Can you think of any other methods which could be
more efficient. I heard merge sort or quick sort are also used for linked
lists. Do you see their applicability in this case?
What about duplicate
Maybe this problem is related to pigeon hole problem
On Mon, May 30, 2011 at 8:44 AM, Aakash Johari aakashj@gmail.comwrote:
No, won't work. :(
On Sun, May 29, 2011 at 11:39 PM, Aakash Johari aakashj@gmail.comwrote:
Can this solution work?
Create adjacency matrix where adj[i][j]
Please refrain from sharing such links and engaging in piracy.
I kindly request the admin of this forum to delete all such posts and to
warn the users on the forum for possible barring in case they are found to
use this forum for piracy and malpractices.
On Sat, Apr 30, 2011 at 12:09 PM, Charles
I think these questions are stupid in the sense that no one would ever use
these constructs in their production code unless someone wants to write an
obscure obfuscated code in some competition. Many times similar expressions
are non-portable.
Anyways, to understand this and related concepts,
I do know about event based simulation in digital circuit simulators..
It would be interesting to know.what exactly algorithms they use
On Fri, Mar 4, 2011 at 5:27 PM, Luciano Junior luciano@gmail.comwrote:
Hello,
I need a clock algorithm to use with in a simulation system that I
Practical - Good mix of theory and practice
1. The Art of Multiprocessor Programming by Maurice Herlihy Nir Shavit
2. Introduction to Parallel Computing, Second Edition. By Ananth Grama,
Anshul Gupta, George Karypis, Vipin Kumar
3. Herb Sutter's Blog on Concurrency
API Specific
4. Oreilly's
I understand the algorithm, but what is the question?
On Wed, Jan 26, 2011 at 10:10 AM, bittu shashank7andr...@gmail.com wrote:
In order to make their newest microcontroller as cheap as possible,
the ACME Widget Company designed it with a very simple cache. The
processor is connected to a
Yeah,,,...lets hope the next turing goes to this Indian. Its still being
verified.
On Thu, Aug 12, 2010 at 12:54 AM, Kishen Das kishen@gmail.com wrote:
First attempt: sort them and add the 2 largest numbers
2nd attempt: find 1st and 2nd largest number and add them.
On Wed, Jul 14, 2010 at 7:27 AM, Debajyoti Sarma
sarma.debajy...@gmail.comwrote:
An array contains the set of positive integer. Find the largest number
c such that c=a+b where
Why do you want to try a brute force approach, when you have some better
algorithms and heuristics available?
On Mon, Jun 7, 2010 at 10:07 PM, Jean Carlo Mendes jean.men...@gmail.comwrote:
Hello Guys
Anyone have a implementation of knapsack 0-1 using brute force approach ?
Or… Do you
This question was asked in a Microsoft interview 2 years back.
On Mon, Jun 7, 2010 at 8:05 PM, divya jain sweetdivya@gmail.com wrote:
let a[n][n] be the input array nd b[][] be the output
for(i=0;in;i++)
for(j=0;jn;j++)
b[i][j]=a[n-j-1][n-i-1]
On 7 June 2010 08:26,
in the
complexity concept of algorithm. I do not understand that complexity
is for the algorithms or for programs.
On May 8, 11:20 am, Ralph Boland rpbol...@gmail.com wrote:
On May 5, 7:59 am, Varun Nagpal varun.nagp...@gmail.com wrote:
Complexity of an algorithms is focussed on two aspects
Complexity of an algorithms is focussed on two aspects: Time it takes to
execute the algorithm(Time Complexity) and the amount of space in memory it
takes to store the associated data(Space Complexity). Most literature in
computer science focuses on Time Complexity as it directly influences the
,
Prabagaran.
On Mon, May 3, 2010 at 12:25 PM, Varun Nagpal varun.nagp...@gmail.com
wrote:
I think its a good question and fairly complicated to explain at
hardware(RTL) level. Anyways, let me give it a try :
You suggested that only 1 instruction is executed by one processor,
which is not true(if you
I think its a good question and fairly complicated to explain at
hardware(RTL) level. Anyways, let me give it a try :
You suggested that only 1 instruction is executed by one processor,
which is not true(if you have read computer architecture). Briefly,
lets assume the instruction
Guys no one commented on my solution? Any takes on it?
Anyways, below is my solution (in pseudo code)
Pre-condition: A and B are sequences of equal length and sorted in
descending order
Input: Sequences A[1..N] and B[1..N] of equal lengths(N)
Ouput: Sequence C[1..N] containing sorted sum of
@Rajesh gave a simple elegant solution.
A look at a Linux calculator : you can even calculate 99! =
8.854887824e+5584950 in few seconds. I just looked at the code(its open
source right!), which is not so easy to understand in few minutes.
Here is the some part of code I extracted from
@Jitendra
I dont think so.Try these 2 examples to check:
A[1..n] :20 10 0
B[1..n] :18 13 5
Ans :38 33 28
A[1..n] :20 10 0
B[1..n] :18 17 16
Ans :38 37 36
My conjecture is: In the worst case, instead of combination of 1st
element of first array with all elements of second
25 matches
Mail list logo
