@manoj:
clear your concepts about DS, Algo's and C/C++ because questions are on
basics of these.
their are 25 ques and you get 45 min to solve them. their are some question
on preorder , inorder, etc. some on fork() command.
#one ques was to find the complexity of this code
for(i=0;i<n;i++)
for(j=0;j<i*i;j++)
for(k=0;k<j;k++)
sum++;
some ques on comparing BST, hash tables, arrays, sorted arrays and u have to
tell which is better of them
one ques was to show the list after first pass of quick sort if pivot
element is given..
another one was to tell the benefit of using last element as pivot. (its ans
was in the case when list is sorted in reverse order).
some question on graphs like 3 stmts given, u need to tell which is correct,
etc.
all question were juding ur basics.
Do practice well and best of luck.
On Tue, Sep 13, 2011 at 10:25 PM, Manoj Bagari <[email protected]>wrote:
> ravi can u please tell usa bout the written test what type of question
> asked etc?
>
> --
>
>
>
>
>
> 'Life can be filled with disappointment but being happy is a choice'
>
> Manoj Bagari
> National Institute Technology Kernataka
>
>
> --
> 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.
>
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
"*Failure is the opportunity to begin again more intelligently"*
--
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.
