Aditya Chatterjee's Blog, page 113

Pumping Lemma For Context Free Languages

The pumping lemma is used as a way to prove if a language is context-free or not. In this article we have discussed this lemma for CFLs.

Table of contents.Introduction.Pumping lemma for context free languages.Summary.References.Prerequisites.chomsky normal form.Introduction.

The pumping lemma is used as a way to prove if a language is context free or not.
There are two pumping lemmas one for regular languages and another for context free languages.

Here we discuss the latter, it state...

Basics of YACC and Bison

In this article we discuss YACC and Bison, both tools used to generate parsers for context free languages that are LALR(1).

Table of contents.Introduction.YACC.Bison.Summary.References.

Introduction.

YACC and Bison are tools used to generate parsers. For a language to parsed by YACC or Bison, it has to be described by a context-free grammar and only those languages that are LALR(1) can be parsed by YACC or Bison.

In this article we discuss the two tools and show an example of generating ...

Eager Loading and Over-Eager Loading

Eager Loading and Over-eager loading are methods of loading resources to web pages during creation of DOM Nodes.

ContentsThree Types of LoadingEager LoadingOver-Eager Loading (Preloading)MIME TypesCORS-enabled fetchesResponsive PreloadingScripting PreloadsUsageThree Types of Loading

Webpages consist of HTML pages along with several other resources like stylesheets, scripts, images, and video.

Loading these resources can be done synchronously when a page is loaded, asynchronously befor...

A/B Testing

In this article, we will learn more about the famous A/B testing which is an important topic in Data Science to find best performing experiments.

Table of contentsWhat is A/B Teating?Designing an experimentChoosing the metricsDeveloping the experimentAnalyzing results

What is A/B testing?

A/B testing is a famous testing technique used to compare two variants to determine the best of the two based on user experience. It is a randomized experimentation process. The two variants are gene...

Your Career as a Computer Research Scientist

[image error]

In a world that is rapidly adopting new technologies, it’s no surprise that computer and information scientists are in high demand, with their employment rates projected to grow by 22% from 2020 to 2030. The US Bureau of Labor Statistics notes that some 3,200 yearly openings on average are expected to result from the need to replace workers who transfer to different occupations or exit the labor force. Although computing researchers share a similar education and career path with information sys...

Search for a file in Linux (Find command)

In this article, we have explored the approach to Search for a file in Linux (Find command).

Table of contents:

IntroductionLinux OSThe Find CommandVarious options used with the find commandConclusionIntroduction

The unix Operating system is a multi-user, multi-tasking operating system. It consists of a set of programs that act as a link between the computer and the user. It is sometimes referred to as the kernel. On UNIX operating systems users interact with the system through a shell or...

Master-slave & Master-master replication in Databases

In this article, we will explore the basics of data replication techniques such as Master-slave and Master-master in databases.

Table of Contents

Data ReplicationWays of Updating DataSynchronous updateAsynchronous updateMaster-slave modelMaster-master modelData Replication

Data replication is the process of creating multiple copies of the same data at different places. But why? Why do we need to replicate our data? Well, there can be several reasons why data needs to be replicated.

Im...

Chomsky Normal Form in Theory of Computation

It is much easier to work with context-free grammars if the given CFG is its normal form. In this article we discuss the Chomsky Normal Form.

Table of contents.Introduction.Chomsky Normal Form.Summary.References.Introduction.

Normally it is much easier to work with a context-free grammar if the given context-free grammar is in a normal form.

Normal forms include:

Chomsky Normal Form, whereby productions are in the form of A → BC or A → a, where A, B and C are variables and a is a termina...

Regular Expression in Theory of Computation

Regular expressions are used to describe languages, in this article we discuss regular expressions and show that every language can be described by a regular expression.

Table of contents.Introduction.Regular Expressions.Equivalence of regular expressions and regular languages.Summary.References.Prerequisites.regular operations.Introduction.

Regular expressions are a means to describe languages, they define a finite pattern of strings or symbols.
Each pattern will match a set of stri...

Section formula

In this article, we have explored the Section formula in Computational Geometry which deals with straight lines getting divided in a given ratio. This is an important concept.

Table of contentsIntroductionInternal DivisionExternal DivisionSpecial Case - MidpointOverviewIntroduction

In this article we shall cover the section formula, its uses and problems to solve using it. We will first introduce it in simple cases where a point divides a line in a given ratio and then delve into more co...