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,6,7}
2) write the test case for above algo
3) read a file, tell how many time the words in the file repeated(count) and
line number
o/p
<word>\t<count of the word in the file>\t<line number>
4)another questions on design of system. i didn't that question at all.
Thank you,
Siddharam
On Mon, Aug 8, 2011 at 12:38 AM, coder dumca <[email protected]> wrote:
> oh soory
>
> On Sun, Aug 7, 2011 at 12:02 PM, Neha Sharan <[email protected]>wrote:
>
>> @coder: it is not bst.
>>
>>
>> On Mon, Aug 8, 2011 at 12:15 AM, coder dumca <[email protected]>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 smaller than root
>>>
>>> in this way none of options are satisfying this
>>> b. 6 7 3 8 1 9 2 7 6 is roor but 7 is greater
>>> c, 2 4 6 8 1 3 5 7
>>> d. 1 3 5 7 2 4 6 8
>>>
>>> i think the is some fault in the question it should post order to find
>>> On Sun, Aug 7, 2011 at 11:38 AM, ankit sambyal <[email protected]
>>> > wrote:
>>>
>>>> @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 [email protected].
>>>> To unsubscribe from this group, send email to
>>>> [email protected].
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to [email protected].
>>> To unsubscribe from this group, send email to
>>> [email protected].
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to [email protected].
>> To unsubscribe from this group, send email to
>> [email protected].
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
