Uncategorized

Recapitulation: What I learned from “A Priesthood Of Programmers”

Kindly note that I have moved my website and blog and I will no longer be active here. Please visit my new website. This is my first non-technical blog. The intent of this post is to put down a digest, for myself, of the meticulous piece — A PRIESTHOOD OF PROGRAMMERS — written by Alice… Continue reading Recapitulation: What I learned from “A Priesthood Of Programmers”

Algorithm Design and Analysis

FSA Part IV: Concoction of design-strategies

Kindly note that I have moved my website and blog and I will no longer be active here. Please visit my new website. Again, this post is meant specifically for undergraduate students (first timers into automata theory) – a very brief introduction of FSA: Finite State Automaton (Automata when plural). This post is the third of… Continue reading FSA Part IV: Concoction of design-strategies

Algorithm Design and Analysis

FSA Part III: Concoction of design-strategies

Kindly note that I have moved my website and blog and I will no longer be active here. Please visit my new website. Again, this post is meant specifically for undergraduate students (first timers into the automata theory) – a very brief introduction of FSA: Finite State Automaton (Automata when plural). This post is the third… Continue reading FSA Part III: Concoction of design-strategies

Algorithm Design and Analysis

FSA Part II: Concoction of design-strategies

Kindly note that I have moved my website and blog and I will no longer be active here. Please visit my new website. Again, this post is meant specifically for the undergraduate students (the first timers into the automata theory) – a very brief introduction of FSA: Finite State Automaton (Automata when plural). This post is… Continue reading FSA Part II: Concoction of design-strategies

Algorithm Design and Analysis

FSA Part I: An elementary introduction

Kindly note that I have moved my website and blog and I will no longer be active here. Please visit my new website. Again, this post is meant specifically for the undergraduate students (the first timers into the automata theory) – a very brief introduction of FSA: Finite State Automaton (Automata when plural). This post is… Continue reading FSA Part I: An elementary introduction

Algorithm Design and Analysis

Algorithmic Time-Complexity Analysis: Asymptotic Notation

Kindly note that I have moved my website and blog and I will no longer be active here. Please visit my new website. Motivation: When we talk about efficiency of an algorithm, we generally refer to the resources (time, space etc.) that the algorithm will consume for a given input. Especially, we usually are interested in… Continue reading Algorithmic Time-Complexity Analysis: Asymptotic Notation