*Mar 26, 2012*

This is based on my dissatisfaction with the messed up way time and work problems are handled in quantitative aptitude examination guides. They take a simple idea, threaten you with time constraints and leave you feeling broken and guilty because you couldn't solve them quickly enough.

Tags: math

*Mar 26, 2012*

At school, we are taught that parallel rays incident on the mirror, after reflection, pass through the focus of the mirror, and that irrespective of the position of these parallel rays, the position of the focus does not change. But that is not quite true. It is just an approximation.

*Mar 26, 2012*

The process of convolution works on the twin concepts of linearity and shift invariance. Here is an animated explanation of the concept.

*Mar 26, 2012*

"Convolution in the time domain is multiplication in the frequency domain" is an oft-quoted statement. But the exact relation between the two is seldom stressed adequately. Mathematically, convolution and polynomial multiplication are one and the same process, as I shall explain shortly.

*Mar 26, 2012*

Modular exponentiation is essentially a technique used to calculate c=b^e mod m mostly used in computer programming. Let's say you want to calculate 97^59 mod 8. 97^59 is far too big a value to be calculated and housed in the typical variable. And that's why we need this "special technique".

Tags: math

*Mar 24, 2012*

This is a newsletter we designed for a newsletter design contest conducted in our college on March 2010. The contest was called N'Vogue and it was conducted as part of Verve '10 by the ELS (English Literary Society) of our college.

Tags: project

*Mar 18, 2012*

…a truly awesome implementation of gray to binary conversion in 8085 assembly language

*Mar 18, 2012*

This code snippet continuously reads a square wave from Port A of the 8255 (programmable peripheral interface) and thus measures its time period.

*Mar 18, 2012*

This piece of code is a Matlab/GNU Octave function to perform Lagrange interpolation.

*Mar 18, 2012*

An 8085 microprocessor implementation of Euclid's algorithm, an efficient method for computing the Greatest Common Divisor (GCD) of two integers.

*Mar 18, 2012*

An 8085 assembly program to compute the square root of an integer. The algorithm is based on the fact that the sum of the first n odd natural numbers is equal to the square of n