Tuesday, 3 March 2015

Java Fail-Fast Vs Fail Safe

Here is a very good explanation on Fail-Fast Vs Fail Safe:  Click Here
By -
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

AWS Data Pipeline Services

https://www.youtube.com/watch?v=tykcCf-Zz1M

  • How to read/write using Pipe's in C
    #include <stdio.h> #include <string.h> #include <unistd.h> #include <sys/types.h> #include <stdlib.h> i...
  • Max Contigous subsequence sum
    Given n numbers, find out i and j where 1<=i<=j<=n, where the sumof elements from i to j is maximum. All positive : Sum of all ele...
  • Maximum of a Tree
    Here is the simple code for finding the maximum of a BST: /* Tree Maximum */ Tree* maxTree(struct Tree *node) { while(node->right) nod...