|
Hi, My name is Om Vir Singh and I am presently working as a software
consultant. I am an expert in Algorithm Design and Implementation besides
being a professional Unix/Linux hacker (which by the way, is not
synonymous with fledgling programming enthusiasts fiddling with
incomprehensible code.)
The most important part of any application design and implementation is
the development of underlying software algorithms. The programming
languages, operating systems, network architecture etc do contribute to
the overall design, but it is essentially the algorithm design that
governs the speed, accuracy and reliability of the software application,
hence the space-time complexity of algorithms is an important design and
analysis consideration.
My engineering Major was Chemical Engineering and hence the computational
algorithms were my major area of interest. I also did minor area courses
in Computer Science especially in areas of Algorithm Design and Software
Engineering. My areas of interest in algorithm design are:
·
Pattern Matching
·
NP Completeness
·
Flow Networks/Graph
Algorithms
·
Non Linear Optimization
Some of my favourite algorithms are listed below. My favourite part of the
above algorithms is the simplicity and elegance of the proofs.
·
Disjoint Sets Union/Find
operations in linear Time.
·
Verification of Minimum
Spanning Tree in Linear Time.
·
Fast Fourier Transform.
·
Boyer Moore String Matching
Algorithm.
|