what would be the complexity of your solution O(n) or O(log n)..?
On Sat, Aug 20, 2011 at 12:19 PM, sukran dhawan wrote:
> traverse bst inorder and each time u encounter a node find the difference
> between the element and given element in question . if the absolute
> difference is minimum after
Guys suggest me some topics , some sites , some stuffs and watever known to
the best of ur knowledge , it will be helpful for me
On Sat, Aug 20, 2011 at 11:47 AM, mani walia wrote:
> no they are not asking for money , even they are providing gud stipend and
> if performance is good , then we ca
traverse bst inorder and each time u encounter a node find the difference
between the element and given element in question . if the absolute
difference is minimum after traversing the tree that is the element . u can
getback the element using another element which keeps sign of the element so
that
Given a BST and a number, Find the closest node to that number in the
BST. Give an algorithm for that.
Let there be binary search tree having nodes with values
12,34,64,23,64,25,76,6 and the number given is 28, then the answer
would be 25 as it is the closest node.
--
You received this message be
ORACLE COMING TO OUR COLLEGE FOR TRAINING...
CAN ANYONE FROM THIS GROUP TELL ME ABOUT HOW TO PREPARE FOR THAT?
I WILL BE REALLY THANKFUL TO THAT PERSON..
PLEASE HELP ME..
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this grou
most of them look for ur communication skills if though they ask technical
stuffs .thats the worst part of banking and finance companies
On Wed, Aug 17, 2011 at 11:33 AM, SAMMM wrote:
> Can anyone tell me wht does banking firm ask in interview other than
> Technical stuffs , algo , puzzles?? Any
Yes ans is fff0, my mistake.
On Sat, Aug 20, 2011 at 11:56 AM, sukran dhawan wrote:
> check o/p once.it shud be fff0 coz rightmost bits are filled with 0s
>
>
> On Sat, Aug 20, 2011 at 11:56 AM, sukran dhawan wrote:
>
>> i got the answer as fff0
>>
>>
>> On Sat, Aug 20, 2011 at 11:55 AM, V
check o/p once.it shud be fff0 coz rightmost bits are filled with 0s
On Sat, Aug 20, 2011 at 11:56 AM, sukran dhawan wrote:
> i got the answer as fff0
>
>
> On Sat, Aug 20, 2011 at 11:55 AM, Vijay Khandar
> wrote:
>
>> Thank you very much..now i got it.
>>
>>
>> On Sat, Aug 2
i got the answer as fff0
On Sat, Aug 20, 2011 at 11:55 AM, Vijay Khandar wrote:
> Thank you very much..now i got it.
>
>
> On Sat, Aug 20, 2011 at 11:51 AM, Ayswarya Srinivasan <
> krsayswa...@gmail.com> wrote:
>
>> i guess the output is fff0
>>
>> -1 = 0001
>>
Thank you very much..now i got it.
On Sat, Aug 20, 2011 at 11:51 AM, Ayswarya Srinivasan wrote:
> i guess the output is fff0
>
> -1 = 0001
> taking 1's complement
> 1110
> taking 2's complement
>
> -1<<
@ gopi:
I think you are referring to the even number of elements in the list.
Anyhow, here is the solution to the odd number of elements.
http://ideone.com/5nmzL
Now is the problem solved?
On 20 August 2011 10:47, *$* wrote:
> Hi,
> But as per the given problem , that constraint is not specifi
i guess the output is fff0
-1 = 0001
taking 1's complement
1110
taking 2's complement
-1<<4
left shifting 4 bits
%x prints in hexa decimal format
so o/p- f f f 0
On Sat, Aug 20, 2011 at 11:39 AM,
no they are not asking for money , even they are providing gud stipend and
if performance is good , then we can get the PPO.
please help me regarding that , i dnt want to let that opportunity go..
please help
On Sat, Aug 20, 2011 at 11:43 AM, Rahul wrote:
> dude ,are they asking for money , if
Congrates
On Sat, Aug 20, 2011 at 10:20 AM, Ankur pratik wrote:
> samsung engineering labs
>
>
> On Sat, Aug 20, 2011 at 10:18 AM, sukran dhawan wrote:
>
>> where ?
>>
>> On Sat, Aug 20, 2011 at 10:16 AM, ankur pratik wrote:
>>
>>> thanx to all members of algo geeks... i got a job... this gou
dude ,are they asking for money , if they are then they might not ask
even questions .
On 8/20/11, mani walia wrote:
> yeah
>
>
> On Sat, Aug 20, 2011 at 11:33 AM, sukran dhawan
> wrote:
>
>> for training ?
>>
>> On Sat, Aug 20, 2011 at 11:32 AM, mani walia wrote:
>>
>>> ORACLE COMING TO OUR COL
main()
{
printf("\n %x",-1<<4);
}
o/p-
Plz tell me anyone how this program is working? what is the meaning of
-1<<4, 45>>6,-6<<65 etc.. how this statement is executed..?
Vijay
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks
yeah
On Sat, Aug 20, 2011 at 11:33 AM, sukran dhawan wrote:
> for training ?
>
> On Sat, Aug 20, 2011 at 11:32 AM, mani walia wrote:
>
>> ORACLE COMING TO OUR COLLEGE FOR TRAINING...
>>
>> CAN ANYONE FROM THIS GROUP TELL ME ABOUT HOW TO PREPARE FOR THAT?
>>
>> I WILL BE REALLY THANKFUL TO THAT
for training ?
On Sat, Aug 20, 2011 at 11:32 AM, mani walia wrote:
> ORACLE COMING TO OUR COLLEGE FOR TRAINING...
>
> CAN ANYONE FROM THIS GROUP TELL ME ABOUT HOW TO PREPARE FOR THAT?
>
> I WILL BE REALLY THANKFUL TO THAT PERSON..
>
> PLEASE HELP ME..
>
>
>
>
>
> THANKS
> MANI
>
> --
> You recei
ORACLE COMING TO OUR COLLEGE FOR TRAINING...
CAN ANYONE FROM THIS GROUP TELL ME ABOUT HOW TO PREPARE FOR THAT?
I WILL BE REALLY THANKFUL TO THAT PERSON..
PLEASE HELP ME..
THANKS
MANI
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To
If the binary equivalent of 5.375 in normalised form is - 0100
1010 1100
what is the o/p of following code-
main()
{
float a=5.375;
char *p;
int i;
p=(char *)&a;
for(i=0;i<=3;i++)
printf("%02X",(unsigned char)p[i]);
}
O/P= 00 00 AC 40
Plz, Plz anyone explain me in detail
yes
On Sat, Aug 20, 2011 at 10:26 AM, geek_one wrote:
> Statement: Some girls are beautiful.
> Conclusion: Some girls are not beautiful.
>
> is the conclusion is true on the basis of Statement?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks"
Hi,
But as per the given problem , that constraint is not specified..
thx,
--Gopi
On Sat, Aug 20, 2011 at 9:25 AM, Dipankar Patro wrote:
> Fixed the problem. There was a problem with the first element positioning.
>
> Here is the final solution:
> http://ideone.com/XwymV
>
> ^^ Time complexity
Share ur Experience here. By this u can Help also..
On Fri, Aug 19, 2011 at 11:53 PM, Anushruti Gupta <
anushrutithegr...@gmail.com> wrote:
>
> Congratulations:)
>
> On Sat, Aug 20, 2011 at 10:20 AM, Ankur pratik wrote:
>
>> samsung engineering labs
>>
>>
>> On Sat, Aug 20, 2011 at 10:18 AM, s
Hello all
I have just joined the group and I am happy that I took this decision..:)
However I want to direct all the mails from the group to another id that I
made specifically for this group..but it is not showing the email id in the
drop down box in the setting ...Please help
Cosmexia
On
Statement: Some girls are beautiful.
Conclusion: Some girls are not beautiful.
is the conclusion is true on the basis of Statement?
--
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.goog
Congratulations:)
On Sat, Aug 20, 2011 at 10:20 AM, Ankur pratik wrote:
> samsung engineering labs
>
>
> On Sat, Aug 20, 2011 at 10:18 AM, sukran dhawan wrote:
>
>> where ?
>>
>> On Sat, Aug 20, 2011 at 10:16 AM, ankur pratik wrote:
>>
>>> thanx to all members of algo geeks... i got a job... t
samsung engineering labs
On Sat, Aug 20, 2011 at 10:18 AM, sukran dhawan wrote:
> where ?
>
> On Sat, Aug 20, 2011 at 10:16 AM, ankur pratik wrote:
>
>> thanx to all members of algo geeks... i got a job... this goup is
>> awesome for any discussion
>>
>> --
>> You received this message because yo
where ?
On Sat, Aug 20, 2011 at 10:16 AM, ankur pratik wrote:
> thanx to all members of algo geeks... i got a job... this goup is
> awesome for any discussion
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, sen
thanx to all members of algo geeks... i got a job... this goup is
awesome for any discussion
--
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
if the sie is 0 then objects cannot ve unique addresses. atleast one byte is
required to hold a unique address
On Fri, Aug 19, 2011 at 5:46 PM, priya ramesh <
love.for.programm...@gmail.com> wrote:
> why will the objects have same addresses if the size is 0??
>
> --
> You received this message be
may be it places the variable in read only memory
On Thu, Aug 18, 2011 at 2:38 AM, bihari wrote:
> How to prevent the compiler to alter the value of i in statement:
> const int i=2;
> Just give the idea about the implementation of const int i=somevalue;
>
> --
> You received this message becaus
NetApp Pattern at MNIT Jaipur :
1. Written
Apti-10
C and C++-15
Data Structure- 15
OS and Networking(they called this section System)- 10
2. Coding Test
4 Problem Simple like
1. how to find nth element from last in linklist
2. how to find path b/w two nodes in a tree
3. how to find rotation (AB
some more questions apart from them
1. area of the largest square such that it lies only on the black square of
chess such that the side of the chess square is 2 cm.
2. there is a rectangle area such that in it m number of roads are moving
from east to west and n number of roads are moving from no
they didn't asked a single question neither in written nor in
interviews...
On Aug 19, 9:57 am, priya ramesh
wrote:
> @saurabh: thanks a lot! isn't DBMS important??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send
Fixed the problem. There was a problem with the first element positioning.
Here is the final solution:
http://ideone.com/XwymV
^^ Time complexity - O(2n)
Space complexity O(1)
:)
On 20 August 2011 08:14, Dipankar Patro wrote:
> http://ideone.com/ucO4d
>
> Total no. of elements should be even (
http://ideone.com/ucO4d
Total no. of elements should be even (I assume) and it is also failing for
some test cases. Working on to zero down to the error in algo.
On 20 August 2011 02:11, JAIDEV YADAV wrote:
> this was earlier in this group...
> Please see this paper: http://j.mp/rtNp4W
>
>
> On
k thanxgot it
On Aug 19, 9:07 pm, sagar pareek wrote:
> search the archives ...
> direct i's questions already discussed many times
>
>
>
> On Fri, Aug 19, 2011 at 9:33 PM, Agyat wrote:
> > Hi, friends
> > tom i m having directi written test followed by coding(ol) and written
> > test is eli
I could not visualize the situation, could please elaborate on the
positioning of the axis and the spheres?
You haven't told whether they are touching each other or not ?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discuss
this was earlier in this group...
Please see this paper: http://j.mp/rtNp4W
On Fri, Aug 19, 2011 at 2:40 PM, Abhishek Yadav wrote:
> Its the same as we do merge sort where we merge the two sorted array into
> one which will require an extra array..
> Is there any algorithm for inplace merges
@Icy: A few years ago this was reported to be a Microsoft interview
question. It is so well publicized now that most people here have
probably seen it.
1 and 2 cross.
1 returns. (alternatively, 2 returns)
5 and 10 cross.
2 returns. (alternatively, 1 returns)
1 and 2 cross.
17 minutes.
Dave
On A
@DK: What in the statement of the problem led you to believe that
these were if-then statements?
Dave
On Aug 19, 3:15 pm, DK wrote:
> Note that in the answer above, the table given is of the form:
>
> If condition is true then what predicate is true
> -- ---
Hey everyone,
I recently joined this group, so I thought I'd add a short interview/
logic puzzle that I remember hearing. Hopefully it wasnt already
said. Part of the fun is the story, so here it goes...
Four people have been running away from a pack of zombies, and are now
injured in varying de
Note that in the answer above, the table given is of the form:
If condition is truethen what predicate is true
-----
M - married N - not married
N - married L - not married
L - not married M -
M - married N - not married
N - married L - not married
L - not married - M - married
When M is married and L and N are not married. This does not violate any
condition but you have only 1 of the 3 people married.
When N is married, by condition (2) L is not married which implies M is
married (
they ask very easy questions in interviews.
i had faced their interview.
first of all they asked me if i had done any project work.
then they asked about the platform used and why i had chosen it.
then few easy questions about algo of the project.
they questioned me on bubble sort.
then i was aske
thanks for pointing it out
On Sat, Aug 20, 2011 at 12:16 AM, Dave wrote:
> @Sagar: So far so good, but you are not guaranteed to get an
> exception. Example, int a[987] is followed in memory by char
> b[1000], which is a dictionary. You won't detect an exception
> until you get to at least a
@Sagar: So far so good, but you are not guaranteed to get an
exception. Example, int a[987] is followed in memory by char
b[1000], which is a dictionary. You won't detect an exception
until you get to at least a[262144] (2 to the 18th). But you will pick
up plenty of garbage which may throw off
kon app?
On 19 August 2011 22:27, priya ramesh wrote:
> @saurabh: thanks a lot! isn't DBMS important??
>
> --
> 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
Well in that case additive approach will work.
Sanju
:)
--
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...@goo
Well
sorry but i forget to mention exceptions in the solution.
Here is the complete solution :-
The key idea here is to simultaneously do a binary search
for the end of the array as well as the key. We try to look for A[2k ] in
the
k-th step and catch exceptions for successive values of k till eit
thanks all
On Fri, Aug 19, 2011 at 11:24 PM, Dipankar Patro wrote:
> (c)
>
>
> On 19 August 2011 23:18, sukran dhawan wrote:
>
>> yes c is the answer.for ex for stack the valid operations are
>> push,pop,isempty,peep
>>
>>
>> On Fri, Aug 19, 2011 at 10:57 PM, ghsjgl k wrote:
>>
>>> An abstract
@Everyone: The problem says that the array is of UNKNOWN length, but
all of the solutions presented assume that the array is of INFINITE
length. Suppose, e.g., that the length is 987, but you don't know
that. Then it will be meaningless to probe at 1, 10, 100, 1000, etc,
or 1, 2, 4, ..., 512, 1024
GOOD one dave
and thanks divye for a wonderful explanation
On Fri, Aug 19, 2011 at 11:44 PM, DK wrote:
> For those of you who want an explanation of Dave's answer, please refer to
> the diagram below.
>
> | 0.5 in |-| 0.5 in |
> xxx -
> xxx
:)
On Fri, Aug 19, 2011 at 11:43 PM, Sanjay Rajpal wrote:
> Thats wat I said, it depends. Searching in the interval will compensate
> reaching the index earlier.
> So both are almost equivalent.
>
> Sanju
> :)
>
>
>
> On Fri, Aug 19, 2011 at 11:12 AM, sagar pareek wrote:
>
>> Well i think it dep
For those of you who want an explanation of Dave's answer, please refer to
the diagram below.
| 0.5 in |-| 0.5 in |
xxx -
xxx 0.5 in
xxx -
xx...xx |
xx...xx |
x
Thats wat I said, it depends. Searching in the interval will compensate
reaching the index earlier.
So both are almost equivalent.
Sanju
:)
On Fri, Aug 19, 2011 at 11:12 AM, sagar pareek wrote:
> Well i think it depends...
> because range of x and 10x is more than i and 2i
> no doubt multip
Well i think it depends...
because range of x and 10x is more than i and 2i
no doubt multiple of 10 will give us early index but then to find number in
b/w indexes is more than of 2^i
On Fri, Aug 19, 2011 at 11:38 PM, Sanjay Rajpal wrote:
> Multiplication by 10 or 2^i , it depends.
>
> Multip
Multiplication by 10 or 2^i , it depends.
Multiplication by 10 will be faster, I think.
Sanju
:)
On Fri, Aug 19, 2011 at 11:05 AM, sagar pareek wrote:
> hmmm ok
> i found a solution in which index searching is done by 2^i
> which is more optimal
> multiplication by 10 or 2 power i ??i=0,1
yeah
now if u know then pls tell which is more optimal?
On Fri, Aug 19, 2011 at 11:36 PM, Sanjay Rajpal wrote:
> but the logic is same na ?
>
> Sanju
> :)
>
>
>
> On Fri, Aug 19, 2011 at 11:05 AM, sagar pareek wrote:
>
>> hmmm ok
>> i found a solution in which index searching is done by 2^i
>> w
but the logic is same na ?
Sanju
:)
On Fri, Aug 19, 2011 at 11:05 AM, sagar pareek wrote:
> hmmm ok
> i found a solution in which index searching is done by 2^i
> which is more optimal
> multiplication by 10 or 2 power i ??i=0,1,2,3.
>
> On Fri, Aug 19, 2011 at 11:30 PM, Sanjay Rajpal
hmmm ok
i found a solution in which index searching is done by 2^i
which is more optimal
multiplication by 10 or 2 power i ??i=0,1,2,3.
On Fri, Aug 19, 2011 at 11:30 PM, Sanjay Rajpal wrote:
> See at each step you are multiplying the index to be compared by 10(say),
> this increase is ex
See at each step you are multiplying the index to be compared by 10(say),
this increase is exponential.
Therefore the search is exponential and complexity is log n. Base depends on
the factor by which you are multiplying for the next index to be compared.
Sanju
:)
On Fri, Aug 19, 2011 at 10:57
@Sanjay
yeah its the very basic idea that comes in mind
but is your index searching log n ?
i think no !!
if yes then tell me how?
On Fri, Aug 19, 2011 at 11:24 PM, Sanjay Rajpal wrote:
> I forgot to mention one thing, at each comparison, store the index at which
> we searched previously.
>
> Sa
I don't know the answer since my friend who had given the interview was not
able to answer the questions . But remember its a SPHERE so think in 3-D
rather then 2-D and also please give the logic behind your answer .
--
You received this message because you are subscribed to the Google Groups
(c)
On 19 August 2011 23:18, sukran dhawan wrote:
> yes c is the answer.for ex for stack the valid operations are
> push,pop,isempty,peep
>
>
> On Fri, Aug 19, 2011 at 10:57 PM, ghsjgl k wrote:
>
>> An abstract data type is
>> (a) same as abstract class
>> (b) a datatype that cannot be instanti
I forgot to mention one thing, at each comparison, store the index at which
we searched previously.
Sanju
:)
On Fri, Aug 19, 2011 at 10:53 AM, Sanjay Rajpal wrote:
> You can do it very easily.
>
> I assume array is sorted and contains integers.
>
> Say start at position 1, if value at that in
You can do it very easily.
I assume array is sorted and contains integers.
Say start at position 1, if value at that index is equal to the value to be
found, return index.
else if value at that index is greater than the value to be found, we got an
interval to search in.
else(value at that index
yes c is the answer.for ex for stack the valid operations are
push,pop,isempty,peep
On Fri, Aug 19, 2011 at 10:57 PM, ghsjgl k wrote:
> An abstract data type is
> (a) same as abstract class
> (b) a datatype that cannot be instantiated
> (c) a datatype for which only the operations defined on it
HI,
I have encountered a problem :-
You have an array of *UNKNOWN *length . And you have to find an element
in O(log(n)) time without using any extra space.
--
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD
--
You received this message because you are subscribed to t
yes!! c is the correct answer.
On Fri, Aug 19, 2011 at 11:10 PM, Sanjay Rajpal wrote:
> I think c is the answer.
>
> Sanju
> :)
>
>
>
> On Fri, Aug 19, 2011 at 10:27 AM, ghsjgl k wrote:
>
>> An abstract data type is
>> (a) same as abstract class
>> (b) a datatype that cannot be instantiated
>>
I think c is the answer.
Sanju
:)
On Fri, Aug 19, 2011 at 10:27 AM, ghsjgl k wrote:
> An abstract data type is
> (a) same as abstract class
> (b) a datatype that cannot be instantiated
> (c) a datatype for which only the operations defined on it can be used but
> none else
> (d) all of the ab
got it.
Sanju
:)
On Fri, Aug 19, 2011 at 10:25 AM, Romil ... wrote:
> Because this is the answer. Rest of the times it will not touch any of the
> grid lines.
>
>
> On Fri, Aug 19, 2011 at 10:50 PM, priya ramesh <
> love.for.programm...@gmail.com> wrote:
>
>> why this sentence??
>>
>> "3/4
An abstract data type is
(a) same as abstract class
(b) a datatype that cannot be instantiated
(c) a datatype for which only the operations defined on it can be used but
none else
(d) all of the above
what is the answer
--
You received this message because you are subscribed to the Google
Because this is the answer. Rest of the times it will not touch any of the
grid lines.
On Fri, Aug 19, 2011 at 10:50 PM, priya ramesh <
love.for.programm...@gmail.com> wrote:
> why this sentence??
>
> "3/4 of
> the time the coin will touch a grid line"??
>
> --
> You received this message becaus
why this sentence??
"3/4 of
the time the coin will touch a grid line"??
--
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
The requirements will be satisfied if the centre of the coin is such that
the coin just touches the square. This is possible only when the centre of
coin is in a smaller square of 1 inch side.
Hence the result.
On Fri, Aug 19, 2011 at 10:41 PM, Sanjay Rajpal wrote:
> @Dave : me too didnt get t
[root(2)-1]/2*r ?
On Fri, Aug 19, 2011 at 9:23 PM, Greeshma wrote:
> ya tats d ans i got..
>
> --
> 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/-/VRqg
@Dave : me too didnt get the meaning you want to convey, plz throw some
light.
Sanjay Kumar
B.Tech Final Year
Department of Computer Engineering
National Institute of Technology Kurukshetra
Kurukshetra - 136119
Haryana, India
On Fri, Aug 19, 2011 at 10:09 AM, priya ramesh <
love.for.programm..
@dave: You are great!! The ans is indeed 1/4.
I dint understand this sentence...
"The area of the region
within 1/2 inch of the boundary is 3 square inches."
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email t
@Priya: Consider one of the squares in the grid. It has an area of 4
square inches. If the coin lands so that its center is within 1/2 inch
of any grid line, the coin will touch the line. The area of the region
within 1/2 inch of the boundary is 3 square inches. Therefore, 3/4 of
the time the coin
@saurabh: thanks a lot! isn't DBMS important??
--
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.
area of coin = pie * 1^2 = n(e)
area of square= 2^2 * 4(as there are four such squares)= n(S)
probablility = n(E)/n(S) = pie/16 . the ans ;)
On Fri, Aug 19, 2011 at 10:20 PM, priya ramesh <
love.for.programm...@gmail.com> wrote:
> A 1 inch diameter coin is thrown on a table covered with a g
Os and n/w ,ds ,c and c++, apti were 4 sections each had individual
cut off
On Aug 19, 5:25 pm, sukran dhawan wrote:
> which college ?
>
> On Fri, Aug 19, 2011 at 5:54 PM, priya ramesh <
>
> love.for.programm...@gmail.com> wrote:
> > on what subjects are questions asked in netapp?? (Both written a
A 1 inch diameter coin is thrown on a table covered with a grid of lines two
inches apart. What is the probability the coin lands in a square without
touching any of the lines of the grid?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To po
+1 sagar! i too have the same answer :)
--
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.
Fo
what do you mean by
"return the value at each node in order of the corresponding keys"??
Plz give an example
--
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 qn is copy pastewd as it is...no further instructions etc provided
On Fri, Aug 19, 2011 at 6:06 PM, priya ramesh <
love.for.programm...@gmail.com> wrote:
> i think the question should be elaborated a li'l more. Plz give the
> sentences given in the puzzle. May be we cud solve then
>
> --
>
iitiam systems is coming to our college.what kind of questions is
asked in the first round?please reply if anyone knows
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroup
@Sanjay: Just think about doing long division with paper and pencil.
Then implement it in binary.
If you look at my code, which was posted and corrected earlier in this
thread, you will see that both the while loop and the for loop iterate
approximately log_2(quotient) times, log_2(quotient) being
thanks
On Fri, Aug 19, 2011 at 9:50 PM, sagar pareek wrote:
> well we can take anything as he stated in any order
>
>
> On Fri, Aug 19, 2011 at 9:49 PM, Abhishek Yadav <
> algowithabhis...@gmail.com> wrote:
>
>> Hey try queue instead of stack
>>
>>
>> On Fri, Aug 19, 2011 at 9:47 PM, sagar pareek
well we can take anything as he stated in any order
On Fri, Aug 19, 2011 at 9:49 PM, Abhishek Yadav
wrote:
> Hey try queue instead of stack
>
>
> On Fri, Aug 19, 2011 at 9:47 PM, sagar pareek wrote:
>
>> traverse the list and print only odd numbers and if even number encounter
>> store it in a st
we have to store even no.s in a Queue instead of stack .
*Regards
Sanju
Happy to Help :)*
On Fri, Aug 19, 2011 at 9:17 AM, sagar pareek wrote:
> traverse the list and print only odd numbers and if even number encounter
> store it in a stack and later on print it
>
>
> On Fri, Aug 19, 2011 a
Hey try queue instead of stack
On Fri, Aug 19, 2011 at 9:47 PM, sagar pareek wrote:
> traverse the list and print only odd numbers and if even number encounter
> store it in a stack and later on print it
>
> On Fri, Aug 19, 2011 at 9:29 PM, sukran dhawan wrote:
>
>> There is a Circular Singly Li
traverse the list and print only odd numbers and if even number encounter
store it in a stack and later on print it
On Fri, Aug 19, 2011 at 9:29 PM, sukran dhawan wrote:
> There is a Circular Singly Linked List with n nodes having sorted values
> from 1 to n. Need to print the odd and even number
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 wrote:
> ok nair so tell me from where u found these questions?
>
>
> On Fri, Aug 19, 2011 at 9:19 PM, jestincobol nair
> wrote:
>
>> A binary
@Dave : How did you approach this solution to this problem ?
and how you saw that th complexity is O(log_2(Quotient)) ?
*Regards
Sanju
Happy to Help :)*
On Fri, Aug 19, 2011 at 8:44 AM, Dave wrote:
> @Sanjay: Shashank was just reiterating what I said in
> http://groups.google.c
ok nair so tell me from where u found these questions?
On Fri, Aug 19, 2011 at 9:19 PM, jestincobol nair wrote:
> 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 th
search the archives ...
direct i's questions already discussed many times
On Fri, Aug 19, 2011 at 9:33 PM, Agyat wrote:
> Hi, friends
> tom i m having directi written test followed by coding(ol) and written
> test is eliminative and i need ur help.What does directi ask in
> written and what type
Hi, friends
tom i m having directi written test followed by coding(ol) and written
test is eliminative and i need ur help.What does directi ask in
written and what type ques from which subject and what level of quest
both in written and ol coding round
--
You received this message because you are
There is a Circular Singly Linked List with n nodes having sorted values
from 1 to n. Need to print the odd and even numbers in groups in a single
traversal.
Eg. Input: 1->2->3->4->5->6->1 Output: {Any combination of Odd Nos} {Any
combination of Even Nos} Eg. 1 3 5 6 4 2. write a program for sa
1 - 100 of 183 matches
Mail list logo
