Re: [algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr
HI, thanks for letting me know ... *Shashi Kant * *"Think positive and find fuel in failure"* *Senior Member technical Staff* *Oracle India Pvt Ltd* http://thinkndoawesome.blogspot.com/ On Mon, Nov 16, 2015 at 4:31 AM, Shachindra A C wrote: > You're not supposed to post job ads over here. Please help keeping the > group clean. > > On Wed, Nov 11, 2015 at 7:55 PM, shashi kant > wrote: > >> hi, >> >> *Note:* if an inappropriate mail ..please do ignore >> >> Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail your >> resume to me >> >> >> >> Regards, >> *Shashi Kant * >> *"Think positive and find fuel in failure"* >> >> *Senior Member technical Staff* >> *Oracle India Pvt Ltd* >> http://thinkndoawesome.blogspot.com/ >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to algogeeks+unsubscr...@googlegroups.com. >> > > > > -- > Regards, > Shachindra A C > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr
hi, *Note:* if an inappropriate mail ..please do ignore Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail your resume to me Regards, *Shashi Kant * *"Think positive and find fuel in failure"* *Senior Member technical Staff* *Oracle India Pvt Ltd* http://thinkndoawesome.blogspot.com/ -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Principle Engineer Openings [7-10 yrs exp] [Oracle] [Bangalore]
Openings for PMTS [Principle Member Technical staff] for Process cloud team Oracle India Pvt Ltd. *Experience:* 7 to 10 Years in core development and currently working in a Product development company *Education: *college in top 100 [India] *Job Location:* Bangalore *Interested people can contact me. * Regards, *Shashi Kant * *"Think positive and find fuel in failure"* *Senior Member technical Staff* *Oracle India Pvt Ltd* http://thinkndoawesome.blogspot.com/ -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] Remove minimum set of vertices to make the grap divided into more than one component
@shaswat : dude it's obvious that graph will be divided into more than 1
components as mentioned in 3rd line. [mistakenly wrote only 2 but 3rd gives
all hints]
and yes that question asked to get at max set of 3 elements size solution.
but i wanted to generalize that fact.
@atul articulation point is a way to just get problem solved ...
step 1: find articulation points
step2 : if(at least 1 articulation point){
add this vertex to RESULT_SET and return RESULT_SET
}
else if(no such articulation point){
then remove any vertex --do dfs to find if graph gets
disconnected
if(graph disconnected) {
add vertex to set RESULT_SET and return
RESULT_SET.
}
else {
add vertex to set RESULT_SET
remove this vertex from graph and repeat
step1->step2
}
}
Not an efficient way but i did solved it this way . ...
what i'm looking for is a better way .
*Shashi Kant *
*"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*Senior Software Engineer*
*Samsung Research India Bangalore .*
On Tue, Apr 29, 2014 at 10:57 PM, Shashwat Anand wrote:
>
>
>
> On Tue, Apr 29, 2014 at 4:56 PM, shashi kant wrote:
>
>> Problem is as follows:
>>
>
> You have given a terrible description of problem.
>
>
>>
>> 1. Given a connected graph.
>>
>
> Connected, how ? Is the graph directed or undirected ?
>
>
>> 2. Remove a vertex out of it and if graph is divided into two components
>> return that vertex.
>>
>
> Are you sure about two component part ?
> What if graph is a star graph, you can take out the nucleus and it will be
> divided into N - 1 connected component. Will that not be ok ? Does it
> have to be *only* two components.
>
>
>> 3. else find a set of vertices to be removed that will divide graph into
>> more than 1 component.
>>
>
> Does that set has to be minimum ? If not why not simply remove N - 2
> vertices and make is into two connected components.
> What if graph only have one node ? The question loses its meaning here.
>
>
>>
>>
>>
>> Please Help me out here .. probably min-cut problem
>> http://www.geeksforgeeks.org/minimum-cut-in-a-directed-graph/ is
>> suitable here.
>>
>
> Can you please explain, how is flow suitable here ?
>
> FWIW, I see this question as broken and unclear.
>
>
>>
>> *Thanks & Regards,*
>> *Shashi Kant *
>> *"Think positive and find fuel in failure"*
>> http://thinkndoawesome.blogspot.com/
>> *Senior Software Engineer*
>> *Samsung Research India Bangalore .*
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To unsubscribe from this group and stop receiving emails from it, send an
>> email to algogeeks+unsubscr...@googlegroups.com.
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to algogeeks+unsubscr...@googlegroups.com.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Remove minimum set of vertices to make the grap divided into more than one component
Problem is as follows: 1. Given a connected graph. 2. Remove a vertex out of it and if graph is divided into two components return that vertex. 3. else find a set of vertices to be removed that will divide graph into more than 1 component. Please Help me out here .. probably min-cut problem http://www.geeksforgeeks.org/minimum-cut-in-a-directed-graph/ is suitable here. *Thanks & Regards,* *Shashi Kant * *"Think positive and find fuel in failure"* http://thinkndoawesome.blogspot.com/ *Senior Software Engineer* *Samsung Research India Bangalore .* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] Re: Area of Intersection of two rectangles which can be intersecting at any angle
@don thanks for the link *Shashi Kant * ***"Think positive and find fuel in failure"* http://thinkndoawesome.blogspot.com/ On Tue, Nov 20, 2012 at 10:18 PM, Don wrote: > This might be helpful too: > http://www.mathopenref.com/coordpolygonarea2.html > > > On Nov 20, 11:09 am, shashi kant wrote: > > Area of Intersection of two rectangles which can be intersecting at any > > angle ...can result into a polygon. > > > > My solution was to find the point of intersections and then triangulate > the > > polygon ...and then find area of each triangle thus formed. > > > > Summation of the areas would be the answer in that case. > > > > Can anybody suggest a better way to solve > > In case already discussed ...if somebody can provide that link(s)... > > > > *Shashi Kant * > > ***"Think positive and find fuel in failure"* > http://thinkndoawesome.blogspot.com/ > > *System/Software Engineer* > > *Hewlett-Packard India Software Operations. > > * > > -- > > > --
Re: [algogeeks] Balanced Partitioning of Subsets
checkout these links http://people.csail.mit.edu/bdean/6.046/dp/ =>#7 https://www.youtube.com/watch?feature=player_embedded&v=GdnpQY2j064 *Shashi Kant * ***"Think positive and find fuel in failure"* http://thinkndoawesome.blogspot.com/ *System/Software Engineer* *Hewlett-Packard India Software Operations. * On Tue, Nov 20, 2012 at 9:49 PM, shady wrote: > Hi, > We have to divide a set of numbers into two subsets such that their > difference is minimum (Balanced Partitioning Problem). Can anyone explain > the suggested solution ? > http://ace.delos.com/TESTDATA/JAN11.divgold.htm > > -- > > > --
Re: [algogeeks] Repeating element with constraints
@RushirajPatel if you happen to have looked at the page ..3rd solution is the XOR one which is may be a solution for 2 missing numbers but the trick can well be used here.. have a close look there --
Re: [algogeeks] Repeating element with constraints
check this linkit has many different solutions to this problem http://www.geeksforgeeks.org/archives/7953 *Shashi Kant * ***"Think positive and find fuel in failure"* *+917259733668 * http://thinkndoawesome.blogspot.com/ *System/Software Engineer* *Hewlett-Packard India Software Operations. * On Sun, Nov 18, 2012 at 8:16 PM, Rushiraj Patel wrote: > its bit complicated but I think it will workcorrect me if I am > wrong.. > > In further explanation R stands for repeating number and M stands for > missing number. > > step 1 : calculate RESULT = n(n+1)/2 - sum of all set element . which > is equal to | M - R | . > if RESULT < 0 then R > M. > if RESULT > 0 then R < M. > > step 2 : Now XOR of all the set elements with XOR of 1 to n will give - R > XOR M. > > step 3 : for each i in 1 to n > do > k = i XOR R XOR M// R xor M is > calcualted in step 2. > if k - i == RESULT// RESULT is > calculated in step 1. > then K and i are R and M . // We can easily figure > out whether k == R or K==M by looking at the sign of K-i. > > Here all the steps take O(n) time complexity and O(1) space complexity. > > > > > On Sun, Nov 18, 2012 at 7:31 PM, shady wrote: > >> Given an array of size n, which has all distinct elements between 1 to n >> with one element repeating, which also implies that one element is missing. >> How to find the repeating element without using extra space and linear >> time complexity ? >> >> Any way to do it with exor ? :P >> >> -- >> >> >> > > -- > > > --
Re: [algogeeks] Re: Given a two dimensional graph with points on it, find a line which passes the most number of points.
thanks @dave *Shashi Kant * ***"Think positive and find fuel in failure"* *System/Software Engineer* *Hewlett-Packard India Software Operations. * On Mon, Oct 1, 2012 at 10:42 PM, Dave wrote: > @Shashi: It has been discussed before, and an O(n^2 log n) solution is > outlined at > https://groups.google.com/d/msg/algogeeks/fBhXY9aUNJ0/CTB_p7uO8YYJ and is > given in more detail at > https://groups.google.com/d/msg/algogeeks/fBhXY9aUNJ0/0S0zK6HdKdMJ. > > Dave > > On Monday, October 1, 2012 12:00:19 PM UTC-5, Shashi Kant wrote: > >> Given a two dimensional graph with points on it, find a line which passes >> the most number of points. >> Can somebody suggest possible ways to do it. >> >> *(or point me to the post if this problem is already discussed)* >> >> >> >> *Thanks & Regards,* >> *Shashi Kant * >> ***"Think positive and find fuel in failure"* >> http://thinkndoawesome.**blogspot.com/<http://thinkndoawesome.blogspot.com/> >> *System/Software Engineer* >> *Hewlett-Packard India Software Operations. >> * >> >> >> -- > 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/-/TW09gurbAN0J. > 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, 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Given a two dimensional graph with points on it, find a line which passes the most number of points.
Given a two dimensional graph with points on it, find a line which passes the most number of points. Can somebody suggest possible ways to do it. *(or point me to the post if this problem is already discussed)* *Thanks & Regards,* *Shashi Kant * ***"Think positive and find fuel in failure"* http://thinkndoawesome.blogspot.com/ *System/Software Engineer* *Hewlett-Packard India Software Operations. * -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Google Q : all anagrams next to each other
A solution given below taken from "cracking the Coding interview " book...
Solution is create a Comparator and a small change in "compare" method is
that u sort the characters of that string and then compare.
and just sort the arrays, using this compareTo method instead of the usual
one.
Arrays.sort(array, new AnagramComparator());
public class AnagramComparator implements Comparator {
public String sortChars(String s) {
char[] content = s.toCharArray();
Arrays.sort(content);
return new String(content);
}
public int compare(String s1, String s2) {
return sortChars(s1).compareTo(sortChars(s2));
}
}
*Shashi Kant *
***"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Sun, May 27, 2012 at 2:56 AM, Navin Gupta wrote:
> @jalaj :- we will be sorting a copy of the word and then matching the
> sorted_sequence with the sorted_sequence of the copy of other words.
> It will still be in-place, because we are using a space of Word size where
> the input is a dictionary.
> This is an amortized in-place.
>
> --
> Navin Kumar Gupta
> Computer Science & Engg.
> National Institute of Technology,Jamshedpur
>
> --
> 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/-/n2tGzVxSLIYJ.
>
> 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, 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 algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Microsoft written test question
that what i mentioned finding original BST or a correcting the BST property ... my method will only maintains the BST property... -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Microsoft written test question
well in that case there can be simpler ways to do it do an inorder traversal while checking prevhttp://thinkndoawesome.blogspot.com/ *System/Software Engineer* *Hewlett-Packard India Software Operations. * On Wed, Sep 5, 2012 at 12:43 PM, atul anand wrote: > @Shashi : i dont see any differencebcoz only 2 nodes are swapped > ..after correcting it...it shud maintain BST property wich automatically > retain original tree > > -- > 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, 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Microsoft written test question
Is it required only to retain the BST property ?? or to retain the
original BST (tree)
*Shashi Kant *
***"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Tue, Sep 4, 2012 at 1:56 PM, Rahul Kumar Patle wrote:
> @atul: correctly caught...
> here you have to notice that if u get only one violation not second
> violation ill the last... then sure the violation is created because of
> swapping of previous and current of first violation...
> so when you got first violation and put first marker on previous time put
> second marker on current...
> suppose and the last if you don't get the second violation then 2nd marker
> will the current node of first violation...
> as in your case when we got first violation at node prev = 20 and current
> = 10.. mark first point at 20 and second pointer at 10.. at the last the
> 2nd pointer does not get change...
> i have checked this with other test cases.. this case is coming only when
> previous and current are the consecutive nodes(parent and its direct child)
> and one of the node is leaf node...
>
> On Tue, Sep 4, 2012 at 1:22 AM, atul anand wrote:
>
>> i guess i missed this part of bharat post :-
>> /*
>> If we don't get the violation for the second time .. means both are
>> side-by-side elements .. swap them ..
>> */
>> i was saying the same.so it will work.
>>
>>
>> On 9/4/12, atul anand wrote:
>> > @rahul : Here are the boundary cases need to be taken care of :-
>> > suppose given BST is the following :-
>> >
>> > root=allocate(70);
>> > root->right=allocate(75);
>> > root->left=allocate(50);
>> > root->left->left=allocate(20);
>> > root->left->left->right=allocate(25);
>> > root->left->left->left=allocate(10);
>> > root->left->right=allocate(60);
>> > root->left->right->right=allocate(65);
>> > root->left->right->left=allocate(55);
>> >
>> > now suppose node(20) and node(10) get swapped
>> >
>> > inorder of given tree is :-
>> > 20 10 25 50 55 60 65 70 75
>> >
>> > now first violation is at node(20)
>> > but you wont get second voilation...because rest is in inc order.
>> >
>> > yes , it can be done by taking care of root of that first violation.
>> >
>> >
>> > On 9/3/12, Rahul Kumar Patle wrote:
>> >> @bharat: +1
>> >> i have tried some test cases.. working finely.. @anyone pls verify??
>> >>
>> >> On Mon, Sep 3, 2012 at 11:58 AM, bharat b
>> >> wrote:
>> >>
>> >>> while doing in-order traversal, we have to check if(prev > current)
>> -->
>> >>> then mark prev element for swapping in the first time violation..
>> >>> if it happens for the second time..then mark current element for
>> >>> swapping.
>> >>> swap both ..
>> >>>
>> >>> If we don't get the violation for the second time .. means both are
>> >>> side-by-side elements .. swap them ..
>> >>>
>> >>> Hope works .. If I miss any case .. correct me
>> >>> thanks,
>> >>>
>> >>>
>> >>> On Sun, Sep 2, 2012 at 7:45 PM, Rahul Kumar Patle <
>> >>> patlerahulku...@gmail.com> wrote:
>> >>>
>> >>>> @navin: can u explain ur algorithms in words pls..
>> >>>>
>> >>>> On Sun, Sep 2, 2012 at 5:53 PM, Navin Kumar
>> >>>> wrote:
>> >>>>
>> >>>>> void correctBST(struct node *root)
>> >>>>> {
>> >>>>> int flag =0;
>> >>>>> static struct node *temp1, *temp2, *temp3, *prev;
>> >>>>> static int found;
>> >>>>>
>> >>>>> if(found) return;
>> >>>>>
>> >>>>> if(root) {
>> >>>>> correctBST(root->left);
>> >>>>> if(!temp1 && prev && root->data < prev->data) {
>> >>>>> temp1 = prev;
>> >>>>> temp2 = root;
>> >>>>> swap(&(temp1->data), &(temp2->data));
>> >>>>> flag = 1;
>> >>>>> prev = temp1;
>> >>>>> }
Re: [algogeeks] Re: give the algo or program to find second largest element in a list using tournament method
Heap's good but the i think problem clearly mentions "Tournament sort"
use this
https://blogs.oracle.com/malkit/entry/finding_kth_minimum_partial_ordering
although you can do a Inplace tournament sort ...swapping the corresponding
elements
level 1. adjacent pairs
level 2: between pairs apart by 1 place n so on (2,4,8..)
until there is only one element left in there without a pair.this
gives u least element
Now instead of using a "Multimap" , use a simple array with size equal to
original array and store the element that defeated each corresponding
element.
Get all those elements defeated by the least element ... that number should
be of order O(n)
get the second least element out of it in O(n) time.
*Shashi Kant *
*"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Wed, Sep 5, 2012 at 4:11 AM, Dave wrote:
> @Don: Nope. Constructing a heap can be done in O(n). See, e.g.,
> http://www.diku.dk/forskning/performance-engineering/Jesper/heaplab/heapsurvey_html/node9.html
> .
>
> Dave
>
> On Tuesday, September 4, 2012 10:24:25 AM UTC-5, Don wrote:
>
>> Constructing a max-heap is O(n*log n)
>>
>> However, the problem asked for a solution using tournament method.
>> If you ignore that requirement, an O(n) solution is trivial, and
>> doesn't require the additional storage of a heap:
>>
>> int first = max(A[0], A[1]);
>> int second = min(A[0], A[1]);
>> for(i = 2; i < N; ++i)
>> {
>> if (A[i] >= first)
>> {
>> second = first;
>> first = A[i];
>> }
>> else if (A[i] > second)
>> second = A[i];
>> }
>>
>> // First and second now contain 1st and 2nd largest values in A
>>
>> Don
>>
>> On Sep 3, 5:04 am, bharat b wrote:
>> > Construct a max-heap --> O(n)..
>> > call delete() 2 times .. --> O(logn)..
>> > ===> O(n) time..
>> >
>> >
>>
> --
> 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/-/bKzs-wHLSoIJ.
>
> 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, 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 algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] String
hey Karthik phodd diya yaar tune .tejas waale cha gaye
On Tue, Sep 13, 2011 at 3:02 PM, kARTHIK R wrote:
> Something like this.
>
>
> stack S;
> void function(char *s) {
>char *ptr=s;
>while(*ptr++ !=' ') {}
>*ptr = '\0';
> S.push(s); // Will push the string till NULL into
> the stack
> function(ptr+1);
> }
>
>
> // Pop from stack to get words
>
> Karthik R
>
>
>
> On Tue, Sep 13, 2011 at 2:50 PM, guna sekaran wrote:
>
>> please write a code any one
>>
>> On Tue, Sep 13, 2011 at 2:06 PM, shady wrote:
>> > search archives, already done
>> >
>> > On Tue, Sep 13, 2011 at 1:39 PM, Anshul Khandelwal
>> > wrote:
>> >>
>> >> U can take command line argument in main
>> >> main(int argc,char * argv[ ])
>> >> { for(i=argc-1,i>=0;i--) printf("%s ",argv[i]);
>> >> }
>> >>
>> >>
>> >> On Tue, Sep 13, 2011 at 12:05 AM, hary rathor
>> >> wrote:
>> >>>
>> >>> kapil : in your solution you are required extra O(n+n*sizeOf(int *))
>> both
>> >>> memory to create a link list that really costly
>> >>>
>> >>>
>> >>> --
>> >>> 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, visit this group at
>> >>> http://groups.google.com/group/algogeeks?hl=en.
>> >>
>> >>
>> >>
>> >> --
>> >> Regards
>> >> ANSHUL KHANDELWAL
>> >> Final year
>> >> Computer Engineering
>> >> NIT Jaipur
>> >>
>> >>
>> >> --
>> >> 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, 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 algogeeks@googlegroups.com.
>> > To unsubscribe from this group, send email to
>> > algogeeks+unsubscr...@googlegroups.com.
>> > 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 algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> 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 algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+917259733668
*
*R&D engineer ,
Tejas Networks Ltd Banglore.
*
--
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Citrix C Question
int main(){
printf("%t",&main);
//sleep(1000);
return 0;
}
this works for you
On Thu, Aug 25, 2011 at 12:12 PM, shashi kant wrote:
> @ankur it's showing lvalue error.u should check it in some compiler
> first
>
>
>
> On Thu, Aug 25, 2011 at 2:05 AM, Ankur Garg wrote:
>
>> I dont think it will be error, U r passing main function as reference so
>> it will print some address ..
>>
>> The only concern is when u execute this 100 or more times will there be
>> some pattern in the answer ?
>>
>> Regards
>> Ankur
>>
>>
>> On Thu, Aug 25, 2011 at 1:41 AM, prasanth n wrote:
>>
>>> @ankur:
>>>
>>> i think its error..l value required
>>>
>>> On Wed, Aug 24, 2011 at 11:18 PM, Ankur Garg wrote:
>>>
>>>> Hi
>>>>
>>>> Suppose there is a program
>>>>
>>>> int main(){
>>>> printf("%t",&main());
>>>>sleep(1000);
>>>> return 0;
>>>> }
>>>>
>>>> The above program is run from 100 different windows
>>>>
>>>> What will be the output
>>>>
>>>> Will there be any pattern
>>>>
>>>> Regards
>>>> Ankur
>>>>
>>>> --
>>>> 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, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>
>>>
>>>
>>>
>>> --
>>> *prasanth*
>>>
>>> --
>>> 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, 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 algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> *Shashi Kant *
> ***"Think positive and find fuel in failure"*
> *+919002943948
> *
> *R&D engineer ,
> Tejas Networks Ltd Banglore.
> *
>
>
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+919002943948
*
*R&D engineer ,
Tejas Networks Ltd Banglore.
*
--
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Citrix C Question
@ankur it's showing lvalue error.u should check it in some compiler
first
On Thu, Aug 25, 2011 at 2:05 AM, Ankur Garg wrote:
> I dont think it will be error, U r passing main function as reference so it
> will print some address ..
>
> The only concern is when u execute this 100 or more times will there be
> some pattern in the answer ?
>
> Regards
> Ankur
>
>
> On Thu, Aug 25, 2011 at 1:41 AM, prasanth n wrote:
>
>> @ankur:
>>
>> i think its error..l value required
>>
>> On Wed, Aug 24, 2011 at 11:18 PM, Ankur Garg wrote:
>>
>>> Hi
>>>
>>> Suppose there is a program
>>>
>>> int main(){
>>> printf("%t",&main());
>>>sleep(1000);
>>> return 0;
>>> }
>>>
>>> The above program is run from 100 different windows
>>>
>>> What will be the output
>>>
>>> Will there be any pattern
>>>
>>> Regards
>>> Ankur
>>>
>>> --
>>> 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, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>> *prasanth*
>>
>> --
>> 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, 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 algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+919002943948
*
*R&D engineer ,
Tejas Networks Ltd Banglore.
*
--
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] spoj coin tossing
http://www.se.cuhk.edu.hk/~seem3570/12-pattern.pdf here is the solution to this On Wed, Aug 24, 2011 at 7:25 AM, keyankarthi wrote: > http://www.spoj.pl/problems/MAIN8_D/ > > i tried solving this problem > any ideas...?? > for second test case 'htht' > the states i considered are > 1 T - (1/2) * x+1 > 2 HH - (1/4) * x+2 > 3 HTT - (1/8) * x+3 > 4 HTHH - (1/16) * x+4 > 5 HTHT - (1/16)(final state) > > x is the expected no of coins. > x= 1 + 2+3+4+5 > gives 16x=15x+26 > x=26. > > answer given is 20... > can any one explain this, > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- *Shashi Kant * ***"Think positive and find fuel in failure"* *+919002943948 * *R&D engineer , Tejas Networks Ltd Banglore. * -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: question on fork()
6 red 10 greens On Wed, Aug 24, 2011 at 9:25 AM, Ankuj Gupta wrote: > how can be there 20 greens ? > > On Aug 24, 12:12 am, DK wrote: > > The standard library is neither multithread safe nor multiprocess safe. > > If you want the correct answer, use shared memory and maintain a shared > > counter. Alternatively, as a quick hack, insert a fflush(stdout) after > the > > printf statements. > > > > Answer: > > red() - 6 > > green() - 20 > > > > -- > > DK > > > > http://twitter.com/divyekapoorhttp://gplus.to/divyekapoor > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- *Shashi Kant * ***"Think positive and find fuel in failure"* *+919002943948 * *R&D engineer , Tejas Networks Ltd Banglore. * -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Linklist question
well there is no other way.but to keep some storage On Wed, Aug 24, 2011 at 9:44 AM, Ankur Goel wrote: > Hmmm this is one way any other ? > > > On Wed, Aug 24, 2011 at 9:42 AM, Dheeraj Sharma < > dheerajsharma1...@gmail.com> wrote: > >> u can keep a count..which is incremented when the nodes are inserted and >> decremented when the nodes are deleted >> >> >> On Wed, Aug 24, 2011 at 9:31 AM, Ankur Goel wrote: >> >>> How to Count the number of nodes in a linked list without traversing >>> the list?. >>> >>> -- >>> 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, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> >> >> -- >> *Dheeraj Sharma* >> Comp Engg. >> NIT Kurukshetra >> +91 8950264227 >> >> >> -- >> 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, 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- *Shashi Kant * ***"Think positive and find fuel in failure"* *+919002943948 * *R&D engineer , Tejas Networks Ltd Banglore. * -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks]
*http://ostermiller.org/find_loop_singly_linked_list.html *refer for the solution to loop detection* * On Wed, Aug 24, 2011 at 1:04 PM, binayakranjan das wrote: > > hey guys > i donno whther it will work or not..bt hw about taking the address of > header and store in a variable .traverse through the linklist and check > whether the pointer is pointing to a address which is less than the > variable.when u r finding such a situation it will detect a loop. > > assumption:addresses of the nodes though not contiguous bt still in > ascending mode. > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- *Shashi Kant * ***"Think positive and find fuel in failure"* *+919002943948 * *R&D engineer , Tejas Networks Ltd Banglore. * -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: binary tree ques
an improvement to above solution
take a dynamic linear array structure storing ( and y-index) and
whose index tells x value of
Algo:> do inorder traversal and when reach the leftmost end of the tree
start updating the structure.
On Wed, Aug 24, 2011 at 1:53 AM, DK wrote:
> Let Left = -1, Right = +1
>
> For each node Set:
> X = Sigma{Left or Right for each node on the path from root to node}
> Y = -Depth of the node in the tree
>
> Go through the tree once and set X and Y values using any traversal (say
> postorder) in an array.
> Also, during that traversal, find max_height and the number of nodes in the
> left subtree of root.
>
> Go through the array and output: (,
> )
>
> --
> DK
>
> http://gplus.to/divyekapoor
> http://twitter.com/divyekapoor
>
> --
> 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/-/qp4FZ3vE5WcJ.
>
> 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, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+919002943948*
Final Yr. Cse ,Undergraduate Student,
*National Institute Of Technology Durgapur.*
--
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Problem regarding MySql server Installation
http://forums.mysql.com/read.php?11,278745,278745 this works for me will work for you too <http://forums.mysql.com/read.php?11,278745,278745> On Fri, Apr 29, 2011 at 8:34 AM, shashi kant wrote: > try this http://www.fixya.com/support/t840251-mysql_error_messeage > > > > On Fri, Apr 29, 2011 at 12:34 AM, Aniket wrote: > >> I was trying to install mysql 5.5. in Windows XP.After installation >> during configuration phase when there was to apply security settings I >> m always getting an error >> >> Error No 1045 >> Access Denied for user 'root'@localhost(using password: NO). >> >> I have tried all possibilities in Firewall but it dint work.Hope >> anybody here will help me out of this problem.I am totally screwed >> up!!! >> >> -- >> 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, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > *Shashi Kant * > ***"Think positive and find fuel in failure"* > *+919002943948* > Final Yr. Cse ,Undergraduate Student, > *National Institute Of Technology Durgapur.* > > > -- *Shashi Kant * ***"Think positive and find fuel in failure"* *+919002943948* Final Yr. Cse ,Undergraduate Student, *National Institute Of Technology Durgapur.* -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Problem regarding MySql server Installation
try this http://www.fixya.com/support/t840251-mysql_error_messeage On Fri, Apr 29, 2011 at 12:34 AM, Aniket wrote: > I was trying to install mysql 5.5. in Windows XP.After installation > during configuration phase when there was to apply security settings I > m always getting an error > > Error No 1045 > Access Denied for user 'root'@localhost(using password: NO). > > I have tried all possibilities in Firewall but it dint work.Hope > anybody here will help me out of this problem.I am totally screwed > up!!! > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- *Shashi Kant * ***"Think positive and find fuel in failure"* *+919002943948* Final Yr. Cse ,Undergraduate Student, *National Institute Of Technology Durgapur.* -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] MNNIT Programming Contest.
Hi MNNIT Allahabad is organizing IOPC 2K7 as a part of its annual technical festival Avishkar. The online programming contest will start on Saturday at 1800 hours and will be of 12 hour duration. For further information and contest details, please follow the link given below . Please forward it to other people as well . http://avishkar.mnnit.ac.in/iopc/iopc.php Do Join us. -- Shashi Kant Sharma Final Yr CSE NIT, Allahabad -- Shashi Kant Sharma Final Yr CSE NIT, Allahabad --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] Re: Hacking Tools and Security Systems
Oh Come on moderators Ban this guy. I have had enough of his crap ! On 4/25/07, candra <[EMAIL PROTECTED]> wrote: > > > This course on certified ethical hacker will explore the existence and > the use of hacking tools and security systems in any network > environment. Within each domain, you will be presented with several > tools that a hacker can use, and which countermeasures are most > effective against their use. > > Some of these include: > > 1. Ethics and legal issues > 2. Footprinting techniques > 3. Scanning > 4. Enumeration > 5. System hacking > 6. Trojans and backdoors > 7. Sniffers > 8. Denial of service > 9. Social engineering > 10. Session hijacking > 11. CEH hacking web servers > 12. Web application vulnerabilities > 13. Web based password cracking > 14. SQL injection > 15. Hacking wireless networks > 16. Virus and worms > 17. Hacking novell > 18. Hacking linux > 19. IDS, Firewalls and honeypots > 20. Buffer overflows > 21. Cryptography > 22. Penetration testing methodologies > > You will begin to understand how perimeter defenses work, and then you > will move on to scanning and attacking your own networks. You will > also learn about escalated privileges, intrusion detection, DDOS > attacks, buffer overflows, and virus creation. > > For more information, you can visit our website at : > http://www.ilmuhacker.com > > Best regards, > > ilmuhacker.com > > > > > -- Shashi Kant Sharma III Yr CSE NIT, Allahabad --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] Re: RR*=R* ?
which book ?? On 3/27/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote: > > But it is used in books about automata...I am not agreeing to it being a > valid assumption anyways. > > > > --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] Re: RR*=R* ?
Yes, RR* = R+ is fine. On 3/27/07, Karthik Singaram L <[EMAIL PROTECTED]> wrote: > > > sorry > RR* = R+ is the valid assumption > > > > --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] Re: RR*=R* ?
Don't think such an assumption can be used. Its not possible for RR* == R*. On 3/27/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote: > > RR*=R* is an assumption that is often made for conveniences in some books. > I don't quite beleive it to be correct either. > > > > --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
