explanation would be appreciated
surender
On Thu, Sep 8, 2011 at 12:12 AM, Piyush Grover piyush4u.iit...@gmail.comwrote:
4) a and b
On Thu, Sep 8, 2011 at 12:08 AM, Piyush Grover
piyush4u.iit...@gmail.comwrote:
1.)a
2.)b
3.)b
4)b
On Wed, Sep 7, 2011 at 11:08 PM, Mani Bharathi
1 a
2 c
3 b
On Wed, Sep 7, 2011 at 11:08 PM, Mani Bharathi manibharat...@gmail.comwrote:
“Kya-Kya” is an island inhabitants of which always answer any question with
two
answers , one of which is true and the other is false .
1.You are walking on a road and came to a park . You ask the
“Kya-Kya” is an island inhabitants of which always answer any question with
two
answers , one of which is true and the other is false .
1.You are walking on a road and came to a park . You ask the inhabitants Ram
, Laxman and Lila , “which road will
take me to the village ?”Ram says “I never
1. a)
2. c)
3. b)
cnt get the 4th one
On Wed, Sep 7, 2011 at 11:08 PM, Mani Bharathi manibharat...@gmail.comwrote:
“Kya-Kya” is an island inhabitants of which always answer any question with
two
answers , one of which is true and the other is false .
1.You are walking on a road and came to
4. a)
On Wed, Sep 7, 2011 at 11:56 PM, Rashmi Jain rashmi.jain...@gmail.comwrote:
1. a)
2. c)
3. b)
cnt get the 4th one
On Wed, Sep 7, 2011 at 11:08 PM, Mani Bharathi manibharat...@gmail.comwrote:
“Kya-Kya” is an island inhabitants of which always answer any question
with two
answers
ans of 2 should be (b)
On Wed, Sep 7, 2011 at 2:29 PM, Rashmi Jain rashmi.jain...@gmail.comwrote:
4. a)
On Wed, Sep 7, 2011 at 11:56 PM, Rashmi Jain rashmi.jain...@gmail.comwrote:
1. a)
2. c)
3. b)
cnt get the 4th one
On Wed, Sep 7, 2011 at 11:08 PM, Mani Bharathi
1.)a
2.)b
3.)b
4)b
On Wed, Sep 7, 2011 at 11:08 PM, Mani Bharathi manibharat...@gmail.comwrote:
“Kya-Kya” is an island inhabitants of which always answer any question with
two
answers , one of which is true and the other is false .
1.You are walking on a road and came to a park . You ask
4) a and b
On Thu, Sep 8, 2011 at 12:08 AM, Piyush Grover piyush4u.iit...@gmail.comwrote:
1.)a
2.)b
3.)b
4)b
On Wed, Sep 7, 2011 at 11:08 PM, Mani Bharathi manibharat...@gmail.comwrote:
“Kya-Kya” is an island inhabitants of which always answer any question
with two
answers , one of
1From the following options, select the correct pre-order representation of
the following expression.
– 16 – – 14 / – 12 - 2 * 8
-–16--/14–12*28
-–16--/-1412*28
-–16-/–14–12*28
*/--–16-14–1228
2 Which one of the following is NOT a referential integrity issue in a
relational database
ques 1 : ans : 3rd option
ques2 : 4th
ques 3 : ???
ques 4: 2nd
ques5 : option 1st
On Fri, Aug 19, 2011 at 8:38 PM, jestincobol nair jestinco...@gmail.comwrote:
1From the following options, select the correct pre-order representation
of the following expression.
– 16 – – 14 / – 12 - 2 * 8
1. c
2. d
3. no idea
4. b
5.b
--
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
5th is option 1 sorry!
--
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 options,
@nair
Are these questions of CITRIX?
coz all these questions i already faced somewhere
On Fri, Aug 19, 2011 at 9:12 PM, priya ramesh
love.for.programm...@gmail.com wrote:
5th is option 1 sorry!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
yeah even i think the same
but what about third ques ?? what is decoupling ??
On Fri, Aug 19, 2011 at 9:12 PM, priya ramesh
love.for.programm...@gmail.com wrote:
5th is option 1 sorry!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
@ sagar:no dude !! dese are of not of citrix :)
On Fri, Aug 19, 2011 at 9:14 PM, sagar pareek sagarpar...@gmail.com wrote:
@nair
Are these questions of CITRIX?
coz all these questions i already faced somewhere
On Fri, Aug 19, 2011 at 9:12 PM, priya ramesh
love.for.programm...@gmail.com
A binary search tree is defined as follows.
Each node has a key, a value, a (possibly null) left child, and a
(possibly null) right child.
An ordering is defined on the keys to be stored in the tree.
For a given node nd, the keys of all the nodes in its left subtree are
“before” nd’s
ok i got it!!
oracle apps !! :D :D
actually i got it from ur last post of bianry tree question :) :)
On Fri, Aug 19, 2011 at 9:38 PM, sagar pareek sagarpar...@gmail.com wrote:
ok nair so tell me from where u found these questions?
On Fri, Aug 19, 2011 at 9:19 PM, jestincobol nair
In (typical) object-oriented programming languages which one of the
following can be done by a subclass (derived class) of class *C*?
1. Remove methods defined in *C*
2. Define instance variables (data members) not defined in *C*
3. Remove instance variables (data members) defined in *C*
1
--
#include stdio.h
int main()
{
float f=0.0f;
int i;
for(i=0;i10;i++)
f = f + 0.1f;
if(f == 1.0f)
printf(f is 1.0 \n);
else
printf(f is NOT 1.0\n);
return 0;
}
--
You received this message because
f is NOT 1.0
On Thu, Jun 2, 2011 at 8:35 PM, Balaji S balaji.ceg...@gmail.com wrote:
#include stdio.h
int main()
{
float f=0.0f;
int i;
for(i=0;i10;i++)
f = f + 0.1f;
if(f == 1.0f)
printf(f is 1.0 \n);
else
You may use the following programming tricksto do the float
number comparison.
1) a == b = fabs(a - b) = eps
2) ab = b - a eps
3) a = b = b - a = -eps
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
I knew this problem with black and white hats.
Wladimir Araujo Tavares
http://www.si.ufc.br/~wladimir http://www.si.ufc.br/%7Ewladimir/
Fiz uma faculdade! Só não fiz a segunda porque acabaram os tijolos.
On Fri, Dec 17, 2010 at 8:41 AM, Amir hossein Shahriari
@Terence : I think this could be the best reason
On Fri, Dec 17, 2010 at 1:58 PM, Terence technic@gmail.com wrote:
I think nobody dies on the first 19 days and everyone dies on the 20th
day.
(I have no difference with other green-eyes. Why I have to suicide ealier?
: )
Given: a)
standard google version is here :
http://the-technical-interview.blogspot.com/2007/02/goolge-question.html
On Fri, Dec 17, 2010 at 12:49 PM, vamsee marpu marpu.vam...@gmail.comwrote:
Ans : Total 20 green-eyed people were there in the village.
--
You received this message because you are
There were 20 green eyed people and they will commit suicide on 20th day
altogether.
See, There is atleast one green-eyed man.
So let's take the case if there was only one gree-eyed man.
than that man could've seen the colour of all other blued-eyed people and
commit suicide on the very first day.
I think nobody dies on the first 19 days and everyone dies on the 20th day.
(I have no difference with other green-eyes. Why I have to suicide
ealier? : )
Given: a) there was at least one green-eyed among them,
we could get the following conclusions:
1) If there is exactly 1 green-eye, he
You can prove this using induction.
Basis: the number of green-eyed person is one.
The only one person have green-eyed only see blue-eyed person then the
person discover herself is a green-eyed person.
Hipothesis Induction: If have n person with green-eyed then n person
commited suicide in n-th
@aditya: the problem you mentioned is not like this one
if i'm a green eyed there is no reason to kill myself on the second day if
no one kills himself on the 1st day
actually in your solution there is no difference between blue eyed people
and green eyed people so a blue eyed might kill himself
In an ancient village, there were some green-eyed and blue-eyed
persons. One fi ne day,
God instructed them, the day on which you come to know that you are a
green-eyed,
you should commit suicide ... He also assured them that there was at
least one green-eyed
among them. Well, all the villagers
20 green eys ppl ..
At the end of first day person realize no body dies so he is the one with
green eye's so he commit sucide ...
Similarly on second day .. hence forth 20 people commit suicide in 20 days
..
On Fri, Dec 17, 2010 at 11:05 AM, punnu punnu.gino...@gmail.com wrote:
In an ancient
Aditya,
1) Nobody dies on the first 19 days everyone dies on the 20th day.
2) Even if it wasnt the case, why should he die just because nobody else
did? Is there any condition on THERE SHOULD BE ATLEAST ONE GREEN EYED GUY?
On Fri, Dec 17, 2010 at 12:52 PM, Aditya Agrawal adit6...@gmail.com
I think Aditya is correct,
1) it never says nobody dies on the first 19 days, just says by the 20th day
all the green eyed commit suicide.
2) God said that, He also assured them that there was at least one
green-eyed among them.
Cheers.
On Fri, Dec 17, 2010 at 1:30 PM, Krishna Narasimhan
Ans : Total 20 green-eyed people were there in the village.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
33 matches
Mail list logo
