could anyone explain the question 4?
On Fri, Aug 12, 2011 at 3:23 AM, Prakash D wrote:
> for 3 i think only b is the true statement
>
>
> On Fri, Aug 12, 2011 at 3:20 AM, Prakash D wrote:
>
>> whats the solution for 3?
>>
>>
>> On Tue, Aug 9, 2011 at 6:13 PM, Akash Mukherjee wrote:
>>
>>> @srin
for 3 i think only b is the true statement
On Fri, Aug 12, 2011 at 3:20 AM, Prakash D wrote:
> whats the solution for 3?
>
>
> On Tue, Aug 9, 2011 at 6:13 PM, Akash Mukherjee wrote:
>
>> @srinivas if any of the characters (i,n,d,a) appear den it is no longer
>> readso gujr
>>
>>
>> On Tue, A
whats the solution for 3?
On Tue, Aug 9, 2011 at 6:13 PM, Akash Mukherjee wrote:
> @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
> wrote:
>
>> Can any one explain question number 8?
>>
>>
>> On T
@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 wrote:
> Can any one explain question number 8?
>
>
> On Tue, Aug 9, 2011 at 12:19 PM, Akash Mukherjee wrote:
>
>> @prashant
>>
>> devcpp gives an error cannot
Can any one explain question number 8?
On Tue, Aug 9, 2011 at 12:19 PM, Akash Mukherjee wrote:
> @prashant
>
> devcpp gives an error cannot convert `char (*)[5]' to `char*' in
> initialization
>
> ne ideas??
>
> On Mon, Aug 8, 2011 at 12:58 PM, Prashant Kulkarni <
> prashant.r.k...@gmail.com> wr
@prashant
devcpp gives an error cannot convert `char (*)[5]' to `char*' in
initialization
ne ideas??
On Mon, Aug 8, 2011 at 12:58 PM, Prashant Kulkarni <
prashant.r.k...@gmail.com> wrote:
> @Mohit
>
> Output Will be:
>
> 55"some chunk value"
>
> Reason: When 'p' is assigning, we are ass
Finding closest parent in a binary tree.??
Is it LCA for two node. or Inoder pred..
thanks
On Mon, Aug 8, 2011 at 10:18 PM, pankaj kumar wrote:
> 5)program will compile and ans is
>
> 2 3 5 6
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algo
5)program will compile and ans is
2 3 5 6
--
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.
@suresh, me too , did you got any calls from MS regd the test result?
On Mon, Aug 8, 2011 at 10:14 AM, siddharam suresh
wrote:
> y'day i have attended the MS test. Following are the questions.
> 1)there are two arrays a={1,2,3} b={4,5,6,7,0,0,0}, b has enough space
> to accommodate the elements
@Mohit
Output Will be:
55"some chunk value"
Reason: When 'p' is assigning, we are assigning next memory location of
'ch'. similar we are assigning same memory location to 'q' as well but while
printing, we are printing the last memory location content of 'ch' (i.e
"p-1") and for 'q' we a
can anyone one explain output of question 1.
--
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...@googlegroup
Thank you,
Siddharam
On Mon, Aug 8, 2011 at 10:14 AM, siddharam suresh
wrote:
> y'day i have attended the MS test. Following are the questions.
> 1)there are two arrays a={1,2,3} b={4,5,6,7,0,0,0}, b has enough space
> to accommodate the elements of a[] that is trailing 0's in b. o/p should be
y'day i have attended the MS test. Following are the questions.
1)there are two arrays a={1,2,3} b={4,5,6,7,0,0,0}, b has enough space
to accommodate the elements of a[] that is trailing 0's in b. o/p should be
sorted array containing both the elements of a[] n b[] in above example
b={1,2,3,4,5
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.
>> see the option
>>a.1 6
@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.
> 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 sma
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
@coder : Cud u plz explain the approach for question 9 ??
--
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...@go
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,%
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,%d)",(*ptr)[1],(*ptr)[2]);
Will this program compile properly or will end in segmentation
fault ??
(9) Given a ino
MICROSOFT INTERVIEW QUESTIONS 2011
ROUND 1 :
Written Test Questions :
(1) Give the output of the following program
int main
{
char ch[]={‘1’,’2’,’3’,’4’,’5’};
char *p = (char *)(&ch+1);
char *q = &ch+1;
printf(“%d %c%c”,sizeo
20 matches
Mail list logo
