ne updates on flipkart n1??
On Fri, Sep 9, 2011 at 9:53 PM, siva viknesh sivavikne...@gmail.com wrote:
hi...which coll and package???...plz post the interview experiences
after attending ..thx
On Sep 8, 6:03 pm, htross htb...@gmail.com wrote:
please post the questions after the first round
hey...d code doesn't compile on gcc though
On Sat, Oct 1, 2011 at 7:32 PM, rahul sharma rahul23111...@gmail.comwrote:
but it is ++(*ptr)
i mean valure at ptr is incremented..n hw AN when we have written
%ci cant get dat
On Sat, Oct 1, 2011 at 6:47 PM, SAMM somnath.nit...@gmail.com
nebody has OPERATING SYSTEMS DESIGN AND IMPLEMENTATION by Andrew S. Tanenbaum
thanx :)
On Sun, Oct 2, 2011 at 8:38 AM, Deoki Nandan deok...@gmail.com wrote:
--
With Regards
Deoki Nandan Vishwakarma
--
You received this message because you are subscribed to the Google Groups
Algorithm
On Wed, Sep 28, 2011 at 8:16 PM, Akash Mukherjee akash...@gmail.comwrote:
hi dis is a qn posted in this grp itself
Q3) Input - India is a great country. Key(alphanumeric) - B2. You have to
encrypt the given sentence, in such a way that only the words should be
jumbled.
Output - great India
any language pref?? are bash solns acceptable??
On Mon, Sep 26, 2011 at 12:04 PM, abhishek abhishek.ma...@gmail.com wrote:
a file is given containing lots of records seprated by new line
(records can be repeat)
and a substring given for egabc
now check for the record which contains the
hican ne1 suggest good books for dbms...not theory types but more of a
question bank like maybe a cracking the coding interview is for
coding/algo...
thanx :)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
@payal : thanx but des are more of theory books ryt??
On Fri, Sep 23, 2011 at 5:32 PM, payal gupta gpt.pa...@gmail.com wrote:
KORTH OR NAVATHE is nyc...:)
regards,
PAYAL GUPTA,
CSE 3rd yr,
NIT_B
On Fri, Sep 23, 2011 at 1:09 PM, Akash Mukherjee akash...@gmail.comwrote:
hican ne1
,
PAYAL GUPTA,
CSE_3rd yr
NIT_B
On Fri, Sep 23, 2011 at 11:21 PM, Akash Mukherjee akash...@gmail.comwrote:
@payal : thanx but des are more of theory books ryt??
On Fri, Sep 23, 2011 at 5:32 PM, payal gupta gpt.pa...@gmail.com wrote:
KORTH OR NAVATHE is nyc...:)
regards,
PAYAL GUPTA,
CSE
, Sep 12, 2011 at 6:33 PM, Akash Mukherjee
akash...@gmail.comwrote:
this is a case, but isnt der a case of circular permutation 2??
what say abt dis
0,1
2,3
4,5
0,1
2,3
4,5
it wrks i gues??
On Mon, Sep 12, 2011 at 12:56 PM, teja bala
pawanjalsa.t...@gmail.com wrote:
I think it is 1
anybody has any yahoo campus placements papers/questions or tips etc. please
share
thanx in advance
Akash
--
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
bit mesra, cg 7...dunno nething else :(
On Wed, Sep 14, 2011 at 3:00 PM, rahul sharma rahul23111...@gmail.comwrote:
in which col it is cumingn wats is its procedure???waht is cgpa
creteria?
On Wed, Sep 14, 2011 at 6:26 PM, Akash Mukherjee akash...@gmail.comwrote:
anybody has any yahoo
k...bt its a gud 2 weeks lefti guess der wud be sm other clg visits b4
dat
On Wed, Sep 14, 2011 at 9:22 PM, htross htb...@gmail.com wrote:
please share the questions asked after the company visits ur campus
On Sep 14, 8:53 pm, Akash Mukherjee akash...@gmail.com wrote:
bit mesra, cg 7
+1
On Mon, Sep 12, 2011 at 3:42 PM, pg@manit gpt.pa...@gmail.com wrote:
Cud some 1 suggest me 4m how 2 practise test cases type of questions
which usually cum in MS written Papers?
thanx..in advance
Regards,
PAYAL GUPTA
--
You received this message because you are subscribed to the
given a rand(N) a random generator 0 - N-1.
now
//assume N is defined somewhere
int A[N]
for(i = 0; i N; i++){
int m = rand(N);
int n = rand(N);
swap(A[m],A[n]);
}
what is the probability that array A remains the same?
p.s. rand n swap are o(1) in case it makes any diff
--
You received this
this is a case, but isnt der a case of circular permutation 2??
what say abt dis
0,1
2,3
4,5
0,1
2,3
4,5
it wrks i gues??
On Mon, Sep 12, 2011 at 12:56 PM, teja bala pawanjalsa.t...@gmail.comwrote:
I think it is 1/N
let N=6 that means rand(6)= takes values 0-5 i.e 6 values.
rand(m)=6
+1
On Wed, Aug 31, 2011 at 8:12 AM, arvind kumar arvindk...@gmail.com wrote:
Hi
Can any1 temme process,questions,experiences,etc for zynga intern??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
heap is true but i am not getting y we can't use a balanced binary tree
searching for the smallest is logn(leftmost node), then deleting it is logn
so, should it be both??
thanx :)
On Sun, Aug 21, 2011 at 6:54 PM, sukran dhawan sukrandha...@gmail.comwrote:
its heap
On Sun, Aug 21, 2011 at
@sagar : deletion in logn, check
http://en.wikipedia.org/wiki/Heap_%28data_structure%29
i would say that the re-heapify is implicit just as the re-balance is
implicit in balanced bst
On Mon, Aug 22, 2011 at 12:58 AM, sagar pareek sagarpar...@gmail.comwrote:
+1 Dumanshu
This question was asked
just my 2 cents in d binary search, replacing key with mid, ie
if(a[mid] mid)
check lower half
else upper half
should work??
On Mon, Aug 15, 2011 at 12:26 AM, aditi garg aditi.garg.6...@gmail.comwrote:
Given an ordered array A[1…n] with numbers in strictly increasing
order. Find a ‘j’
dp problem, refer to dp from AFI
On Sat, Aug 13, 2011 at 9:01 PM, Decipher ankurseth...@gmail.com wrote:
There is a river and there are n number of steps between two banks of the
river to cross the river.
A frog wants to cross the river with the condition that he can jump max one
step. Find
thanx...downloaded :)
On Fri, Aug 12, 2011 at 10:56 AM, coolfrog$ dixit.coolfrog.div...@gmail.com
wrote:
@all
can some plz suggest the source for where i can fine the dates and news
regarding amazon off-campus Placements.
On Fri, Aug 12, 2011 at 6:36 AM, Akash Mukherjee akash
sure, thanx :)
On Fri, Aug 12, 2011 at 4:15 PM, WgpShashank shashank7andr...@gmail.comwrote:
@Akshmkj , A Blog For Geeks , Fresher Might Stuck !!!
http://shashank7s.blogspot.com - Cracking The Code You Might Enjoy
Regards
Shashank Mani
Computer Science
Birla institute of Technology
Hi,
Can anyone suggest from where I should practice for the online coding round
for amazon off-campus placements. I am looking for similar problems not
for the environment.
Thanx,
Akash
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
of any user defined data types are clearly mentioned.
Just coding on a normal computer will also help.
Suggestion:
Make sure you are accustomed with Tree programs,
On 12 August 2011 06:36, Akash Mukherjee akash...@gmail.com wrote:
Hi,
Can anyone suggest from where I should practice
@srinivas if any of the characters (i,n,d,a) appear den it is no longer
readso gujr
On Tue, Aug 9, 2011 at 6:04 PM, Srinivas Varanasi srinivas4...@gmail.comwrote:
Can any one explain question number 8?
On Tue, Aug 9, 2011 at 12:19 PM, Akash Mukherjee akash...@gmail.comwrote:
@prashant
i think its 1 though ...
On Mon, Aug 8, 2011 at 10:21 PM, rohit rajuljain...@gmail.com wrote:
What will the following code snippet do, when is it passed the root of
a binary tree ?
func( Node *node){
if(node-right != NULL)
func( node-right);
if(node-left != NULL)
@udit : thanx man...they were really helpful
2 allcan u plzz chk d answers 4 the qns :
18c,20b
also how do i solve 14,16 ??
thanx
On Mon, Aug 8, 2011 at 1:24 PM, Udit Gupta uditgupta...@gmail.com wrote:
helloamazon's this year paper is attached with d mail
cn u plz tell me
segmented trees??
On Sat, Aug 6, 2011 at 2:05 AM, Ankur Pandey ankur.0002...@gmail.comwrote:
U can use merge sort for this.. try and picture the problem, u'll get my
point..
On Fri, Aug 5, 2011 at 1:27 PM, amit kumar amitthecoo...@gmail.comwrote:
can u plz xplain d qstn a litl more
directi updated
On Mon, Jul 25, 2011 at 10:53 PM, shady sinv...@gmail.com wrote:
@all
Microsoft Questions
https://docs.google.com/document/d/1exjvawzl5PRefTu5umJM5KpMBJs15PZVDMzYG_C2FEA/edit?hl=en_US
Amazon Questions
sorry if it seems to be off the topic, but any good resources for trie
for a newbie??
thanks :)
On Sat, Jul 23, 2011 at 11:02 PM, varun pahwa varunpahwa2...@gmail.com wrote:
Use trie tree and store word count also along with the pointer. So, that
search could take at max word size time.
On
@rajeev ty :)
On Sun, Jul 24, 2011 at 4:24 PM, rajeev bharshetty rajeevr...@gmail.com wrote:
http://www.youtube.com/watch?v=uhAUk63tLRM
This would be helpful
On Sun, Jul 24, 2011 at 4:21 PM, Akash Mukherjee akash...@gmail.com wrote:
sorry if it seems to be off the topic, but any good
wud be glad if u cud post all the ms questions 2 :)
On Sun, Jul 24, 2011 at 8:19 PM, Agyat jalsa.n.sa...@gmail.com wrote:
recently, MS visited our campus ..and i saw that same questions
were repeated in ANNA univ. so it will be helpful to post question if
some company visits your
already discussed many timestry using bitmasks
On Sat, Jul 23, 2011 at 1:26 PM, Akshata Sharma
akshatasharm...@gmail.com wrote:
better than O(n^2)..
On Sat, Jul 23, 2011 at 1:08 PM, Akshata Sharma akshatasharm...@gmail.com
wrote:
Given a string *Str of ASCII characters, write the pseudo
we could maybe keep an array of keys and sort them according to the values
stored in the hashtablejust my 2 cents
On Sat, Jun 18, 2011 at 6:10 PM, Harshal hc4...@gmail.com wrote:
@KK,
yes set is not indexed, but you can insert the map elements in set in
sorted order( based on value, here
+1
On Mon, Jun 13, 2011 at 4:47 AM, Supraja Jayakumar suprajasank...@gmail.com
wrote:
Hi All
Can someone suggest a simple application that I can develop and host on
Azure.
I have very little web based programming experience and have some knowledge
with
.net but nothing major.
I am
search nd read chinese remainder theorem
On Thu, Apr 14, 2011 at 7:04 PM, AAMIR KHAN ak4u2...@gmail.com wrote:
*Output:*
0
0
On Thu, Apr 14, 2011 at 7:01 PM, AAMIR KHAN ak4u2...@gmail.com wrote:
#includecstdio
#define MOD (int)1e9
using namespace std;
int main() {
int A =
@ anurag
temp - data = ( temp - next ) - data ;
but data cannot be moved, ryt??
On 4/6/11, Anurag atri anu.anurag@gmail.com wrote:
in case you are given a pointer to the first node simply do
temp -next = ( temp - next ) - next .
if you are given a pointer to the second node do ,
temp -
wouldn't a modified dijkstra do the trick??
On 4/2/11, Tech id ilovea...@gmail.com wrote:
Given a directed graph G, with V vertices and E edges. Each edge in E
is associated with a real number ‘r’,a reliabilty factor with r
between 0(exclusive) and 1(inclusive). You are also given a pair of
dc nt givin tle??
On Mon, Mar 28, 2011 at 11:42 AM, sukhmeet singh sukhmeet2...@gmail.comwrote:
Well this was asked by codechef on it's intern contest...!! Make a
recursive algorithm using divide and conquer paradigm
On Thu, Mar 10, 2011 at 11:20 AM, Akash Mukherjee akash...@gmail.comwrote
what about a graph, edges represent the paths allowed for the knight??
On Sat, Mar 26, 2011 at 12:51 AM, Gene gene.ress...@gmail.com wrote:
A knight can move 8 possible ways, so you need 3 bits to encode a
movement.
To convert these 3 bits into relative motion on a board, define
integer
where to register??
On Fri, Mar 25, 2011 at 2:22 AM, radha krishnan
radhakrishnance...@gmail.com wrote:
ITRIX OPC 2011 ---Prizes worth 16000 INR to be won and exciting prizes
The contest will be conducted in SPOJ.
Participants must register in ITRIX WEBSITE(http://itrix.org.in) in
order
22, 2011 at 12:51 PM, balaji a peshwa.bal...@gmail.comwrote:
Thnx :-) I am from SSN College of Engineering,Chennai
On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee akash...@gmail.comwrote:
u r welcome :), nd all the best for ur test.btw, which clg??
On Tue, Mar 22, 2011 at 11:45 AM
hey, dis is what i was told by a friend working @ amazon -
Sometimes they do go to the level of the subject basics like OS or DS but
you should be able to tackle these if you had studied well. No separate prep
is needed.
Few Favs DS Algos ( i should get treat for revealing this.;)... )
1) All
u r welcome :), nd all the best for ur test.btw, which clg??
On Tue, Mar 22, 2011 at 11:45 AM, guru peshwa.bal...@gmail.com wrote:
Thank you very much for the info friendAnd sure will give u a
treat :-)
On Mar 22, 11:02 am, Akash Mukherjee akash...@gmail.com wrote:
hey, dis is what
@all : thank :)
On Mon, Mar 21, 2011 at 5:45 PM, cegprakash cegprak...@gmail.com wrote:
Anurag's method is better than saurabh's
if u want to find the sum of digits from 1 to 1048
just apply Anurag's method from 1 to 1039 and saurabh's method from
1040 to 1048
--
You received this
Majid is a 3rd-grade elementary student and quite well in mathematics. Once,
Majid's teacher asked him to calculate the sum of numbers 1 through n.
Majid quickly answered, and his teacher made him another challenge. He asked
Majid to calculate the sum of the digits of numbers 1 through n.
Majid
thanks, :)
On Sun, Mar 20, 2011 at 8:21 PM, Anurag atri anu.anurag@gmail.comwrote:
http://mathforum.org/library/drmath/view/57919.html
check this out .
On Sun, Mar 20, 2011 at 7:38 PM, Akash Mukherjee akash...@gmail.comwrote:
Majid is a 3rd-grade elementary student and quite well
hi,
can anybody plzz look at this problem. i tried a recursive greedy approach
but it was too slow i guess
You have a truck that you need to completely fill up with merchandise. You
have an infinite supply of merchandise of dimension 1x1x1, 2x2x2, 4x4x4,
8x8x8, 16x16x16, ..., 2k x 2k x 2k for
Hi,
I need some help. I am still a nube so if this is too easy, plz don't flame.
I cannot understand how to approach the problem. Would appreciate any help.
At CodeChef, The Chef can make 10 types of dishes numbered 0 through 9. He
can however only make dishes one after another. Suppose The Chef
hi, i implemented something i called bin2d, here's the pseudo code :
int binSearch2D(int key, int p, int q)
//here we are using binary search on the first row
if(p == q)
if (a[0][p] == key)
i = 0; j = p;
int mid_row = (p + q) / 2;
if (a[0][mid_row] == key)
hi,
i have a slightly different but related probelm, i am trying to implement
djiktra's in c++ how should i deal with the infinity weights( i mean does
c++ have infinity)?
thanx in advance :)
On Fri, Feb 18, 2011 at 10:16 PM, Balaji S balaji.ceg...@gmail.com wrote:
just output..unicode of
represent infinity by a long value like INT_MAX or
LONG_MAX, not necesarily infinity.
2011/2/18 Akash Mukherjee akash...@gmail.com
hi,
i have a slightly different but related probelm, i am trying to implement
djiktra's in c++ how should i deal with the infinity weights( i mean does
c++ have
52 matches
Mail list logo
