@ harry how it is possible man
On Mon, Aug 22, 2011 at 3:58 AM, WgpShashank wrote:
> Hey Geeks I think question can be solved by many ways . some of the
> algorithms are i have implemented & aware of are ->
>
> 1st. Algo
> Generate all palindromes (even & odd length ) of given string while keep
hi manglu
On Mon, Aug 22, 2011 at 7:05 AM, Mangal Dass wrote:
> Anybody pls tell me the questions coming into Information-Mosaic campus
> test.
> Mosaic has changed its pattern.
> Pls post both the pattern as well as questions(if something u remembered) .
>
> Thanks a lot,
>
> --
> You received t
@sukran ur r wrong man
the construdor of virtual base class are called first otherwise it is from
left to right
so the correct order is
D A B C Z
On Mon, Aug 22, 2011 at 8:25 AM, Sanjay Rajpal wrote:
> agree with sukran.
>
>
> Sanju
> :)
>
>
>
> On Mon, Aug 22, 2011 at 8:20 AM, sukran dhawan wr
apply BFS
the node after the particular node(whode cousin to be find) will be the
required node
On Wed, Aug 10, 2011 at 2:15 PM, Puneet Chawla wrote:
>
> Agree with mohit goel..
>
> On Wed, Aug 10, 2011 at 11:22 AM, Mohit Goel wrote:
>
>>10
>> 4
it's 3/5
On Tue, Aug 9, 2011 at 8:29 AM, Dave wrote:
> @Dipankar: You are correct about the answer to your alternative
> question being 17/80, but your answer 3/5 says that you don't think
> you have learned anything by the five heads flips. Don has given a
> good explanation as to why the answe
oh soory
On Sun, Aug 7, 2011 at 12:02 PM, Neha Sharan wrote:
> @coder: it is not bst.
>
>
> On Mon, Aug 8, 2011 at 12:15 AM, coder dumca wrote:
>
>> inoeder traversal is given 1 2 3 4 5 6 7 8 9
>> in preorder traversal root come fist , then left and then right.
>
inoeder traversal is given 1 2 3 4 5 6 7 8 9
in preorder traversal root come fist , then left and then right.
see the option
a.1 6 3 2 7 8 4 9
1 is root at left there is 6 , sine left child must be smaller than root
in this way none of options are satisfying this
b.6 7 3 8 1 9 2 7
in qyes no 9 I think none of options are correct
On Sun, Aug 7, 2011 at 8:25 AM, ankit sambyal wrote:
> Can anybdy explain the following questions :
> (5) Find the output
> int arr[2][3]={{1,2,3},{4,5,6}};
> int (*ptr)[3]=&a[0];
> printf("(%d,%d)",(*ptr)[1],(*ptr)[2]);
> ptr+=1;
> printf("(%d,%
1: choose 4 biggest numbers with abs value
following situations will arise
1: all 4 numbers are +ve then choose the biggest 3
2: 1 -ve3 +ve choose 3 positive numbers
3: 3 -ve1 +ve choose 2 -ve(with largest abs value) and 1 +ve
4: 2 +ve 2 -ve choose accordingly
4 all are -ve ch
given an array find all triplets such that a^2+b^2=c^2
--
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...@googl
default arguments are added right to left , in first one it is left to
right thats why error
On Sat, Aug 6, 2011 at 9:41 AM, siddharth srivastava wrote:
> Hi
>
> On 6 August 2011 12:08, swetha rahul wrote:
>
>> Hi,
>>
>> Q.No:1
>> what is wrong here
>> void foo(int x=10,int y)
>> how compile
on gcc it is 16 bytes and on dev cpp its 24 bytes
On Sat, Aug 6, 2011 at 11:10 AM, siddharth srivastava
wrote:
>
>
> On 6 August 2011 23:27, Nitin wrote:
>
>> I am also getting 24 bytes but y it is taking it every data type as 8,8,8
>> as if we take it alone it is 1 for char and 4 for int a
congrats man
On Sat, Aug 6, 2011 at 5:14 AM, parag khanna wrote:
> congrats dude ... can u plz tell me the questions asked ... microsoft is
> visiting our campus on 29th
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to thi
select top 1 salary from(select top 6 salary from employee
order by salary desc)asc
On Sat, Aug 6, 2011 at 6:40 PM, Reynald wrote:
> Could anyone please explain me how this query selects the employee
> with nth highest salary?
>
> select last_name, salary from employees e1
> where &n = (select
given an array , find three numbers a,b and c such that a^2+b^2=c^2 in
o(n^2)
--
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
a
i think it should be 3/4
On Fri, Aug 5, 2011 at 4:20 PM, aditi garg wrote:
> 1/8
>
> On Fri, Aug 5, 2011 at 4:14 PM, coder dumca wrote:
>
>> A man speaks truth 3 out of 4 times. He throws a die and reports it to
>> be a 6.
>> What is the probability of it being a
A man speaks truth 3 out of 4 times. He throws a die and reports it to be a
6.
What is the probability of it being a 6?
1 /2
3 /4
5 /8
1 /8
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@google
hi abhishek i dont have sample paper but i can ive u overview of aricent.
1 round written : logical reasioning , aptitude and c /c++/java
2 round technical interview go for the basics
On Wed, Aug 3, 2011 at 12:22 PM, abhishek kumar <
mailatabhishekgu...@gmail.com> wrote:
> hey guys..
> Aricent
system call causes a mode switch mode changes fron user to kernal.
On Wed, Aug 3, 2011 at 7:07 AM, naveen ms wrote:
> @rajeev and sourabh:..thanks a lot;...:)
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, s
hi reynald i have send u some questions on the group
On Wed, Aug 3, 2011 at 10:36 AM, Reynald Suz wrote:
> Sorry for the typo, Its "Thoughtworks"
>
>
> On Wed, Aug 3, 2011 at 11:04 PM, Reynald wrote:
>
>> Hi folks!
>> If any of you have Thoughworks flow questions, Coding rounds
>> questions, T
abe tumhe to factory me data entry ki job bhi nahi milehi , bada aaya google
me interns lene wala.
On Tue, Aug 2, 2011 at 6:35 PM, tmdhat wrote:
> dude
>
> keep threads clean.
> and please don't feed the trolls.
>
> it's obviously an entire bullshit from the beginning,,,
> why feed the trolls?
>
ass
> //constructor no ??? ..correct me if i m wrong
>
>
> }
>
> On Aug 1, 11:04 pm, coder dumca wrote:
> > base class constructor are called before derived class construtors.
> >
> > Base* pBase = new Derived(); statement creates a derived class
> >
hi algogeeks
can anybody tell mw the interview process of thoughtworks, the
kind of question in written and about the company.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@google
ry is going down). We
> can issue a request using system.gc but we cannot MAKE it run...
>
>
> On Sun, Jul 31, 2011 at 11:56 PM, vaibhav shukla
> wrote:
>
>> @mr coder : y do we need to call garbage collector explicitly when it
>> works automatically ?
>>
>&
hi frnds
can any body tell me how a student can appear for amazon or microsoft , if
these comanies are not coming to the campus.
--
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.
i think the answer should be 15
On Mon, Aug 1, 2011 at 12:46 PM, Abhishek Gupta wrote:
> let the array be A={ 3,5,7,10} then it should give output as 13 (3+10)
>
> In short, we need to find the possible maximum sum such that no 2 elements
> in the subarray has 2 elements adjacent. there is no bou
base class constructor are called before derived class construtors.
Base* pBase = new Derived(); statement creates a derived class
object hence calls derived class condstructor, which calls base call
constructor. base class constructor calls fun() which prints " Base
Function".
pls co
it can be done in O(n)
On Mon, Aug 1, 2011 at 5:37 AM, kumar raja wrote:
> I have seen the code in algorithmist ,but i am not getting it.
>
> @Piyush
>
> how will u solve it using 2-4 tree
>
> On 31 July 2011 23:39, Piyush Gaurav wrote:
>
>> u need a 2,4 tree for dat
>>
>>
>> On 1 August 2011 1
this is the correct working code
#define size 8
void main()
{
int a[]={16,2,4,10,1,12,5,6};
int sum=0,i,index;
for(i=0;ia[i+1])
{
sum=sum+a[i];
index=i;
i=i+2;
}
else
{
sum=sum+a[i+1];
index=i;
i=i+3;
}
}
if(i-index>1)
sum=sum+a[i];
prin
generally jvm runs on following occasions
1: periodicaliy
2: when program is about to run out of memory the JVM runs and finallize
the objects.
3: when we call using System.gc or Runtime.getruntime.gc
pls correct me if i m wrong
On Sat, Jul 30, 2011 at 11:10 AM, vaibhav shukla wrote:
> pleas
@ muthuraj
see here display in derived is overriding display() in base and also has
purpose
class A
{
int a;
public :
void dispaly()
{
cout< wrote:
> Function overriding gains significance only when functions are declared
> virtual. Otherwise Overriding does not serve any purpose. the main i
yes Sandeep(sir) is perfectly right , if we definig a base class function
in derived with exactly same function signature , the function in derived
class said to override the function in base class, does nt matter whether
it is virtual or not.
On Sun, Jul 31, 2011 at 10:22 AM, Sandeep Jain wro
@ Raghvendra thanks dude
On Mon, Jul 25, 2011 at 7:20 PM, raghavendhra rahul <
rahulraghavend...@gmail.com> wrote:
>
> hi ,
>
> i think this s the link for algorithm for interviews ebook
>
>
> http://code.google.com/p/interview/downloads/detail?name=Algorithms%2Bfor%2BInterviews%2B%28scan%2Bocr%
hi frnds
if some body have these books in pdf or can share the link of "the
google resume" and "algorithms for interviews".
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 algog
hi frndz
given an array which is circularly sorted like
6 ,7,8 ,1 ,2 ,3 ,4,5
search a given number.
--
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 unsub
so what ? supporting anna hazare is not a bad idea.
On Thu, Jun 9, 2011 at 12:54 PM, Naveen Kumar wrote:
> There is no such condition put up by the govt.
> If you give a missed call you are showing your support to Anna Hazare
> Please read
> http://theindiapost.com/delhi/support-hazare-give-call-
I need some more books specialy on algo ds and puzzles
On Wed, Jun 8, 2011 at 4:07 AM, coder dumca wrote:
> I am last year student preparing for placements
>
> can any one give some ebooks on data structure, algo etc. like beofre
> some time , some one posted a book " how to
wow it's working ...
On Wed, Jun 8, 2011 at 11:49 PM, sunny agrawal wrote:
> yup, it works, i tried it!!
>
>
> On Thu, Jun 9, 2011 at 12:15 PM, Abdul Rahman Shariff
> wrote:
>
>> did u try it ??
>> nd did u get the msg??
>>
>> On Thu, Jun 9, 2011 at 1:06 AM, kartik sachan wrote:
to sayan nayak last year MCA students can apply please reply( with some
idea abt compensation)
On Tue, Jun 7, 2011 at 11:39 PM, ross wrote:
> @sayan: thanks for the info :) Any idea on the compensation dude?
>
> On Jun 7, 10:53 pm, sayan nayak wrote:
> > :D.Sure.Afterall Destiny is not a ma
I have same problem to implement a to implement a stack with functions
push(int) pop min() and max() in O(1)
if some one know please elaborate.
On Tue, Jun 7, 2011 at 11:13 PM, ross wrote:
> Can u pls elaborate on your approach further?
>
> On Jun 7, 10:17 pm, NIKHIL JAIN
> wrote:
> > it
84 years really good .
On Tue, Jun 7, 2011 at 1:49 PM, Terence wrote:
> 84 years.
> The well known Diophantus Riddle:
> http://en.wikipedia.org/wiki/Diophantus#Biography
>
>
> On 2011-6-7 16:03, Lavesh Rawat wrote:
>
>*Salman age puzzle
> * * *
> *
> *
> **
> *salman's youth lasted one six
> pointer. Both ways are sanctioned by the Standard.
>
> On Wed, Jun 8, 2011 at 4:20 PM, coder dumca wrote:
>
>> can any one tell me why this code perfectly running and giving ouput 56
>>
>> int main()
>> {
>> int *p=malloc(0);
>> *p=56;
>> pr
I am last year student preparing for placements
can any one give some ebooks on data structure, algo etc. like beofre some
time , some one posted a book " how to crack the coding interview" that was
an awesome book thanks to the guy who send the book . if anyone has some
good ebooks or links
can any one tell me why this code perfectly running and giving ouput 56
int main()
{
int *p=malloc(0);
*p=56;
printf("%d",*p);
return 0;
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googleg
thanks arpit :)
On Tue, Jun 7, 2011 at 12:43 AM, Arpit Sood wrote:
> (3 5) (5 7) (11 13) (17 19)
> so in short if you do a +1, -1 to these pairs you will get one number
> 4, 6, 12, 18.. and it goes like this
>
>
> On Tue, Jun 7, 2011 at 12:04 AM, coder dumca w
I still didn't got arpit can u explain pls.
On Mon, Jun 6, 2011 at 7:15 AM, shashankreddy509 wrote:
> thanks Arpit
>
> --
> 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.
46 matches
Mail list logo
