Ritu Kundu

अनुसन्धान | अभिज्ञान || अभिवृद्धि |||

Menu
  • Home
  • Publications
  • CV
    • Activities
    • Awards & Grants
    • Education
    • Work Experience
  • Blog
  • Seminars
  • Software
  • Gallery
  • Contact
Menu

Category: Algorithm Design and Analysis

FSA Part IV: Concoction of design-strategies

Posted on December 28, 2017 by Ritu Kundu

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 four parts: the first part covers an elementary introduction to FSA and DFA (Deterministic Finite Automaton), the second part encompasses some common examples illustrating…

Read more

FSA Part III: Concoction of design-strategies

Posted on December 12, 2017 by Ritu Kundu

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 of four parts: the first part covers an elementary introduction to FSA and DFA (Deterministic Finite Automaton), the second part encompasses some common examples…

Read more

FSA Part II: Concoction of design-strategies

Posted on October 16, 2017 by Ritu Kundu

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 the second of the four parts: the first part covers an elementary introduction to FSA and DFA (Deterministic Finite Automaton), this part encompasses some…

Read more

FSA Part I: An elementary introduction

Posted on December 12, 2016 by Ritu Kundu

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 in four parts: this part covers an elementary introductions to FSA and DFA (Deterministic Finite Automaton), Part II encompasses some common examples illustrating…

Read more

Algorithmic Time-Complexity Analysis: Asymptotic Notation

Posted on October 18, 2016 by Ritu Kundu

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 how an algorithm will behave (as in how much time or space will be consumed) for voluminous input size. A solution to predict the behaviour (say…

Read more

Algorithm to find the Least Lexicographic Rotation of a circular string

Posted on October 7, 2016 by Ritu Kundu

Background: A string is a sequence of symbols from a set called an alphabet. If the string is circular, one can start reading it from any position/index. For example, consider the following circular string of length 8:   If we read this circular string starting at 12 o’clock position and moving in clockwise direction, we obtain”abaabbab“….

Read more
© 2024 Ritu Kundu | Powered by Minimalist Blog WordPress Theme