http://in.careers.yahoo.com/students/content/186
check this .. it has visited many colleges including trichy NIT ..
contact them...kindly share ur experience after attending ...
On Sep 15, 8:09 am, Akash Mukherjee akash...@gmail.com wrote:
k...bt its a gud 2 weeks lefti guess der wud be sm
package ??
On Sep 14, 7:27 pm, Prachi Bhise prachi.bh...@gmail.com wrote:
Tech Mahidra is going to visit in my collage for recruitment.
Does anyone knows which type of question ask in written test and interview.
With Regards
Prachi Bhise
B.E (I.T)
Pune University
--
You received this
-- Forwarded message --
From: sivaviknesh s sivavikne...@gmail.com
Date: Fri, Sep 9, 2011 at 12:23 PM
Subject: Fwd: Interview question in Thoughtworks
To: Pritpal Singh pritpal2...@gmail.com
-- Forwarded message --
From: sasi kumar tmsasiku...@gmail.com
Date:
HI Prachi,
Tech mahindra interveiew will be very easy for you
1st round written xam (online) which has aptitude questions very easy
but you need to finish it on time..
2nd round technincal round --questions from your course
subjectswill be for an hr but easy...
3rd round HR round
-- Forwarded message --
From: Sesha krishnan sesha.naraya...@gmail.com
Date: Mon, Aug 22, 2011 at 6:04 PM
Subject: Re: ThoughtWorks Programming Questions
To: mitcse08i...@googlegroups.com
All,
We uploaded the thoughtworks interview questions from GCT yesterday @
-- Forwarded message --
From: sivaviknesh s sivavikne...@gmail.com
Date: Fri, Sep 9, 2011 at 12:28 PM
Subject:
To: Pritpal Singh pritpal2...@gmail.com
Interview Questions: Thoughtworks
As said by senior- S.Abhinaya
Round1:
Logic test- some simple numerical problems.This doesn't
Think about it. If lamp 1 is on, so is lamp 7, lamp 13, lamp 19, etc.
Every button which affects lamp 1 affects lamp 7, 13, 19... in exactly
the same way.
The same holds for every lamp n. Lamp n+6*x is affected the same way.
So you just need to figure out the state of lamps 1-6, and you know
the
-- Forwarded message --
From: LOKE$[-] sripathi.karth...@gmail.com
Date: Mon, Aug 22, 2011 at 4:13 PM
Subject: Fwd: ThoughtWorks Programming Questions
To: mitcse08info mitcse08i...@googlegroups.com
With regards
Lokesh Chandrakumar
-
Hi ,
Attached are the links to the
robert lafore
On Mon, Sep 12, 2011 at 1:43 PM, Ankuj Gupta ankuj2...@gmail.com wrote:
Hi
Which is a good book for C++ ( Robert Lafore or Bjarne Stroustrup or
Herbert Schildt) ?
Ankuj
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
@ akshat read the question properly before posting such solution
On Wed, Aug 31, 2011 at 12:27 PM, Akshat Sapra sapraaks...@gmail.comwrote:
Solution:
arr[n],sum = 0;
for ( int i = 0 ; i n; i++ ) {
sum ^= arr[i];
}
print sum; // required number
--
Akshat Sapra
Under
1: use bit array(hashing) then only it is possible in O(n)
On Fri, Sep 16, 2011 at 12:04 PM, tech coder techcoderonw...@gmail.comwrote:
@ akshat read the question properly before posting such solution
On Wed, Aug 31, 2011 at 12:27 PM, Akshat Sapra sapraaks...@gmail.comwrote:
Solution:
+1 to don
On Thu, Sep 15, 2011 at 9:40 PM, Don dondod...@gmail.com wrote:
Not really. Usually you would need a second parameter indicating the
size of the input. In theory it might be possible to put a marker
value at the end of the array.
Most implementations of malloc store the size of
You create another class which has the same structure as the given class.
and then create an object of the temporary class and typecast given object
into this new class object, and then access its element.
On Fri, Sep 16, 2011 at 10:04 AM, siddharam suresh
siddharam@gmail.comwrote:
i saw
My guess is that the and so on... means we should be able to solve
this assuming the pyramid is as high as it needs to be in order not to
overflow.
With this the problem gets more interesting. I worked it out a bit
farther:
L/C --- Filled cups
1 --- 1
3 --- 2,3
5 --- 5
7 --- 4-6
8 1/3 --- 8,9
and what is their shortlisting criteria?do they consider elitmus score
only or percentage as well?
On Sep 14, 8:01 pm, rahul sharma rahul23111...@gmail.com wrote:
they take elitmus test..and then interviewws
On Wed, Sep 14, 2011 at 12:17 PM, deepikaanand swinyanand...@gmail.comwrote:
check the groupsi have posted some 5 mails ...those ppl ask those
same ques repeatedly ..if u prepare well and strong in basics of all
areas of CS mainly oops u can crack it
On Sep 14, 7:36 pm, amrit harry dabbcomput...@gmail.com wrote:
dey would only look for OPPS concept with proper
I've read this following solution from USACO...but I don't know why 2^4 and
I don't know why the complete search works for this problem...!!!
Plz Help Me...
Thanks...
You are given N lamps and four switches. The first switch toggles all lamps,
the second the even lamps, the third the odd
#includestdio.h
int main()
{
int a[5]={1,2,3,4,5};
int *ptr=(a + 1);
printf(%d %d\n,*(a+1),*(ptr-1));
return 0;
}
Find the output!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Balagurusamy
On Mon, Sep 12, 2011 at 1:43 PM, Ankuj Gupta ankuj2...@gmail.com wrote:
Hi
Which is a good book for C++ ( Robert Lafore or Bjarne Stroustrup or
Herbert Schildt) ?
Ankuj
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
Saurabh, the compiler used in all the cases is gcc 4.3.4 and these examples
shows different behavior of c and c++ rather than gcc and g++.
--
Thanks and Regards
*Devansh Gupta*
*B.Tech Third Year*
*MNNIT, Allahabad*
--
You received this message because you are subscribed to the Google Groups
and also package??
On Sep 16, 12:24 pm, aashish bansal aashish.b...@gmail.com wrote:
and what is their shortlisting criteria?do they consider elitmus score
only or percentage as well?
On Sep 14, 8:01 pm, rahul sharma rahul23111...@gmail.com wrote:
they take elitmus test..and then
a[]= {1, 2, 3, 4,5}
a
a
a+1
a+1
a is address of whole array...so a+1 means next element after array
completion.
so ptr-1 will point to 5
...
On Fri, Sep 16, 2011 at 1:25 PM, Anup
Yeah..I've got it...you're true;
1 , 7 , 13 , 19 , ...
4 , 10 , 16 , 22 , ...
have the same state...
but what about 2 , 3 , 5 , 6 , 8 , 9 , ...?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
My guess is that the and so on... means we should be able to solve
this assuming the pyramid is as high as it needs to be in order not
to
overflow.
With this the problem gets more interesting. I worked it out a bit
farther:
L/C --- Filled cups
1 --- 1
3 --- 2,3
5 --- 5
7 --- 4-6
8 1/3 --- 8,9
compile time error
On Sep 16, 12:55 pm, Anup Ghatage ghat...@gmail.com wrote:
#includestdio.h
int main()
{
int a[5]={1,2,3,4,5};
int *ptr=(a + 1);
printf(%d %d\n,*(a+1),*(ptr-1));
return 0;
}
Find the output!
--
You received this message because you are subscribed to the Google
On Friday, 16 September 2011 13:25:38 UTC+5:30, Anup wrote:
#includestdio.h
int main()
{
int a[5]={1,2,3,4,5};
int *ptr=(a + 1);
int *ptr=(int *)(a + 1);
printf(%d %d\n,*(a+1),*(ptr-1));
return 0;
}
Find the output!
Now it will print 2 5
--
You received this message
it will print 2,5
On Fri, Sep 16, 2011 at 2:35 AM, Brijesh brijeshupadhyay...@gmail.comwrote:
On Friday, 16 September 2011 13:25:38 UTC+5:30, Anup wrote:
#includestdio.h
int main()
{
int a[5]={1,2,3,4,5};
int *ptr=(a + 1);
int *ptr=(int *)(a + 1);
printf(%d
Sorry. Small mistake. First test should have been
W(n,k) = (k 1 || k n) ? 0 :
This is fixed below.
On Sep 16, 4:48 am, Gene gene.ress...@gmail.com wrote:
My guess is that the and so on... means we should be able to solve
this assuming the pyramid is as high as it needs to be in order not
4.5
On Fri, Sep 16, 2011 at 11:45 AM, senthil mail2dsent...@gmail.com wrote:
HI Prachi,
Tech mahindra interveiew will be very easy for you
1st round written xam (online) which has aptitude questions very easy
but you need to finish it on time..
2nd round technincal round
Brijesh is right.until u do the type casting it will show an error
On Fri, Sep 16, 2011 at 5:57 AM, Pradip Singh qnit...@gmail.com wrote:
it will print 2,5
On Fri, Sep 16, 2011 at 2:35 AM, Brijesh brijeshupadhyay...@gmail.comwrote:
On Friday, 16 September 2011 13:25:38 UTC+5:30,
cpa:- 6
elitmus considered 100%
packakge around 7-7.5
On Fri, Sep 16, 2011 at 1:36 PM, siva viknesh sivavikne...@gmail.comwrote:
and also package??
On Sep 16, 12:24 pm, aashish bansal aashish.b...@gmail.com wrote:
and what is their shortlisting criteria?do they consider elitmus score
yeah...correct ..
On Fri, Sep 16, 2011 at 5:57 PM, rahul sharma rahul23111...@gmail.comwrote:
cpa:- 6
elitmus considered 100%
packakge around 7-7.5
On Fri, Sep 16, 2011 at 1:36 PM, siva viknesh sivavikne...@gmail.comwrote:
and also package??
On Sep 16, 12:24 pm, aashish bansal
Hey guys,
i am trying to solve this problem :
http://www.spoj.pl/problems/SQRBR/
But i can't decipher the problem what it is asking for . Could someone
please give test cases for input set 4 and 5?
What does proper proper bracket expressions mean in these cases?
--
You received this message
couldn't understand the problem
--
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
I'll do the 5th example. A proper bracket expression of size n has n
['s and n ]'s and every prefix has no more ]'s than ['s.
Test case 5 is n = 4 k = 2, so the possible bracket expressions are
[][][][] *
[][][[]]
[][[]][]
[][[][]]
[][[[]]]
[[]][][] *
[[]][[]]
[[][]][]
[[][][]]
[[][[]]]
thanks a lot gene. :)
On Fri, Sep 16, 2011 at 7:00 PM, Gene gene.ress...@gmail.com wrote:
I'll do the 5th example. A proper bracket expression of size n has n
['s and n ]'s and every prefix has no more ]'s than ['s.
Test case 5 is n = 4 k = 2, so the possible bracket expressions are
this is one is the elegant solution i came across
if u got an element just go to the elements index and mark the value to its
negative...
say for eg:
if u got a[i]=9;
then go to a[9] and make it as
a[9]=-a[9];
then do like this for all the elements in the array
so now u can get the logic to how to
Hi
Symantec is comin to our collanyone if attended plz share
written pattern and interview ques...thanks
--
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
@sarath:
it is not specified that the range is from 1 to n..it may look like this:
1 99 2 99
here you cant access a[99]..
On Fri, Sep 16, 2011 at 7:28 PM, sarath prasath prasathsar...@gmail.comwrote:
this is one is the elegant solution i came across
if u got an element just go to the
can anyone tell how to implement a hash table in C?? how to choose the hash
function?? algorithm??
--
*prasanth*
--
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
thank to explain to this problem...
On Fri, Sep 16, 2011 at 1:40 PM, Yogesh Yadav medu...@gmail.com wrote:
a[]= {1, 2, 3, 4,5}
a
a
a+1
a+1
a is address of whole array...so a+1
Hey guys,
I have the following grammar :
S - S{S}S or null
i want to generate 2n number of brackets using this grammar. I gave it a try
but my program is going out of stack.Could someone please help me code this
grammar?
On Fri, Sep 16, 2011 at 7:11 PM, mc2 . qlearn...@gmail.com wrote:
There are entire books on the subject, so I can't give you everything,
but here's a quick summary:
First you need a hash function which maps your input to an index in
the table. Hashing strings is a common application, and there are a
lot of string hash functions. Most common is something like
which college ? and package ?
On Fri, Sep 16, 2011 at 7:39 PM, siva viknesh sivavikne...@gmail.comwrote:
Hi
Symantec is comin to our collanyone if attended plz share
written pattern and interview ques...thanks
--
You received this message because you are subscribed to the
hi guys,plzz share interview questions that are asked in C-dot.
the topics and the key areas from which they raise questions.
It will be a great helpreply as soon as possible..
Share any information that u have related to c-dot .
God helps those who help themselves :D:D
--
You received
they do not take elitmus test for internship.Shortlisting is done on basis
of percentage.
On Fri, Sep 16, 2011 at 6:03 PM, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
yeah...correct ..
On Fri, Sep 16, 2011 at 5:57 PM, rahul sharma rahul23111...@gmail.comwrote:
cpa:- 6
elitmus
i am sorry..surely they must have shortlisted on the basis of elitmus
score.But what min elitmus score is required or they shortlist top 20-30
people based on elitmus score??i am still unclear as to how they shortlist
people for interviews.
On Fri, Sep 16, 2011 at 6:03 PM, Dheeraj Sharma
i don't know about the procedure for placement,i am also waiting for rbs to
come.
On Fri, Sep 16, 2011 at 8:58 PM, aashish bansal aashish.b...@gmail.comwrote:
i am sorry..surely they must have shortlisted on the basis of elitmus
score.But what min elitmus score is required or they shortlist
not possible
On Fri, Sep 16, 2011 at 12:17 PM, tech coder techcoderonw...@gmail.comwrote:
+1 to don
On Thu, Sep 15, 2011 at 9:40 PM, Don dondod...@gmail.com wrote:
Not really. Usually you would need a second parameter indicating the
size of the input. In theory it might be possible to put
Opportunities for the experienced candidates.
--
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/-/y6n4Hd9fqTQJ.
To post to this group, send email to
How much space does a pointer and integer takes?
For eg :-
int a;
int *a;
--
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/-/RmPHywrTUbkJ.
To post to this
Check the link: http://www.careercup.com/page?pid=yahoo-interview-questions
--
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/-/2N_Nig__1foJ.
To post to this
Generating all strings is probably a dead end as the number of strings
is exponential in n and n can be up to 19.
This can be solved as a DP with no counting.
Your grammar is not useful because it's ambiguous. An LL grammar is S
= empty | [ S ] S .
However to enumerate, even the LL grammar is
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
10it60...@iitkgp.ac.in
7797137043.
09491690115.
--
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,
Skiena's Algorithm Design Manual?
On Fri, Sep 16, 2011 at 12:07 PM, kumar raja rajkumar.cs...@gmail.com wrote:
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
10it60...@iitkgp.ac.in
7797137043.
09491690115.
--
You received this message because you are subscribed to the Google Groups
do share u experiences..n questions if possible 4 sure!!!
thnx..in advance...
Regards,
PAYAL GUPTA,
CSE-3rd yr
NIT-B
On Fri, Sep 16, 2011 at 11:31 AM, siva viknesh sivavikne...@gmail.comwrote:
http://in.careers.yahoo.com/students/content/186
check this .. it has visited many colleges
@Ravi
+1
--
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/-/E0NIFwY150EJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
somebody reply..
On Fri, Sep 16, 2011 at 8:53 PM, Harshit Sethi hshoneyma...@gmail.comwrote:
hi guys,plzz share interview questions that are asked in C-dot.
the topics and the key areas from which they raise questions.
It will be a great helpreply as soon as possible..
Share
When you pass an array as a formal parameter in a function, it decays to a
pointer, so it is mandatory for you to send in the length of the array as
well.
On Fri, Sep 16, 2011 at 9:06 PM, sukran dhawan sukrandha...@gmail.comwrote:
not possible
On Fri, Sep 16, 2011 at 12:17 PM, tech coder
What does one mean by 'address of the whole array' ?
On Fri, Sep 16, 2011 at 8:11 PM, mohan kumar mohankumar...@gmail.comwrote:
thank to explain to this problem...
On Fri, Sep 16, 2011 at 1:40 PM, Yogesh Yadav medu...@gmail.com wrote:
a[]= {1, 2, 3, 4,5}
I've read this following solution from USACO for IOI98 - Party Lamps
problem..but I don't know why 2^4 and I don't know why the complete
search works for this problem...!!!
I didn't get exactly what it say...
Can anybody help me to understand it?
Thanks...
IOI 98 - Party Lamps:
Hi all,
I wrote a pseudo code for a blocked/unrolled single linked list which does
global insertion sort(decreasing order) during insertion of elements in the
list.
Can someone look at pseudocode and let me know if it works correctly? I
think it does! Or do you see any corner cases which might
Thank you very much for the help.
On Fri, Sep 16, 2011 at 4:37 PM, Ved Garbha vedgar...@gmail.com wrote:
4.5
On Fri, Sep 16, 2011 at 11:45 AM, senthil mail2dsent...@gmail.com wrote:
HI Prachi,
Tech mahindra interveiew will be very easy for you
1st round written xam (online) which
In a matrix of characters, find an string. String can be in any way (all 8
neighbours to be considered)
like find Microsoft in below matrix.
A
C
P
*R
*C*
*X
*S
**O
*P
*C*
V
*O*
V
N
*I*
W
G
*F
**M
*N
Q
A
*T*
I
T
*Any Ideas How to Solve/Approach this problem ?*
--
You received this message
but your programming is giving compilation error
http://ideone.com/sqsNn
the first one is giving output 2 and 5
--
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
Given an infinite number of quarters (25 cents), dimes (10 cents), nickels
(5 cents) and pennies (1 cent), write code to calculate the number of ways
of representing n cents.
also do give an algorithm first..
--
*prasanth*
--
You received this message because you are subscribed to the Google
There are a lot of simplifications you can make to get this problem
down to a manageable size.
First of all, notice that each of the four buttons inverts itsself. So
if you press it twice, you are back to the initial state. The order of
button pushes does not matter. Any order of the same button
is this company eligible for cse?? for what post?? package??
On Sep 14, 9:12 pm, jestincobol nair jestinco...@gmail.com wrote:
Has anyone attended schneider electric placement ?? if yes plz share ur
experience it is coming after 2 days to my coll.
--
You received this message because you are
The algorithm is to count them, looping over the number of quarters
and dimes. Then it is easy to compute the number of nickles which
could be used, and the shortfall is made up with pennies.
It is very common to see a recursive solution, but that is not
necessary or beneficial when the iterative
#includestdio.h
int main()
{float t;
long x;
t=98;
printf(%d\n,t);
printf(%f\n,x);
{
x=1;
printf(%f\n,x);
{
x=30;
printf(%f\n,x);
}
printf(%f\n,x);
}
x==9;
printf(%f\n,x);
}
@Don:
thanks a lot
On Sat, Sep 17, 2011 at 12:28 AM, Don dondod...@gmail.com wrote:
The algorithm is to count them, looping over the number of quarters
and dimes. Then it is easy to compute the number of nickles which
could be used, and the shortfall is made up with pennies.
It is very
All possible subsets of 10 elements is B(100,10), which is over 17
trillion. Not a great algorithm.
You can do this by constructing sets S_0, S_1, S_2, ... S_10, S_11 of
stations accessible from the start in 0,1,2,...10, 11 hops. The 11th
is from the final station to the destination. It's simple
@Pankaj: Let's number the stations from 0 to 101, where stations 0 and
101 are the end stations and stations 1 through 100 are the
intermediate stations. Let a[i], i = 1, 2, ..., 100 be the distance of
station i from station 0, and finally assume that the a's are
increasing, i.e., that the
Some typos in my solution :(
Use a Max heap..
first take the first 10 stations and build a* Max *heap O(10)..Heap contains
distance between 2 stations . Initial Heap will contain 10 *minimum
*distances
with maximum of those at the top . Now 11 th comes u compare with the root
of the heap . If
--
**With Regards
Deoki Nandan Vishwakarma
*
*
--
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
is GD a part of a selection process or only personal interviews are
taken after shortlisting
On Sep 16, 10:30 pm, rahul sharma rahul23111...@gmail.com wrote:
i was teellling about placement procedure
On Fri, Sep 16, 2011 at 9:12 PM, Rahul Verma rahulverma@gmail.comwrote:
As WgpShashank once pointed out.
Search the whole matrix for the first character instances, for each
instance, send the array, string and that char's position to a function that
will recursively check its direct neighbors for the next character.
Exhaustively check like that for each starting
1. Minimum no.of comparisons required to select the 2nd max element in
an array of N numbers.
2. What are the number of counting ties for four horses. ( example for
two horses A and B there are three cases - A wins, B wins, A B
ties ).
3. What are the minimum no.of tournaments needed to get the
@ankur,
does this actually connects from start station to end station??
i think ur solution creates path which could be discontinuous,
but we want end to end connected path
surender
On Sat, Sep 17, 2011 at 5:39 AM, Ankur Garg ankurga...@gmail.com wrote:
Some typos in my solution :(
Use a Max
Printing a floating point with %d conversion specifier will not print the
expected resultss !
On Sat, Sep 17, 2011 at 1:13 AM, Anshul AGARWAL
anshul.agarwa...@gmail.comwrote:
#includestdio.h
int main()
{float t;
long x;
t=98;
printf(%d\n,t);
printf(%f\n,x);
{
80 matches
Mail list logo
