Umang Bhatt's Blog

2030-05-01T12:39:00.000-07:00

This a place to write down my thoughts, ideas, things that interest me and my progress so far.

- Umang Bhatt

Disclaimer: The ideas/views/thoughts presented here are completely my own and have nothing to do with my current/previous/next employer.

few words ....

2022-12-28T12:01:00.000-08:00

I just wanted to say a few words....

I know that these programs are childish. However, when I solved these programs a few years ago, they were quite challenging and time-consuming for me.

//Sofar .......

- Umang B Bhatt

(Here my purpose of posting these programs is to help juniors build logic and assist them in understanding language)

And yes, if you like this blog, then do write comments and start following

Book recommendation - Clean Code

2018-06-22T10:20:00.001-07:00

I have heard a lot of people talk about Agile development methodology. The read agile manifesto and then they continue to do "waterfally" things. While this is a fairly interesting topic to discuss, I want to draw your attention towards people who created and signed this manifesto. I consider them the most influential people in the industry. It will be a very good idea to look at what they have to say about software. Let's pick one name "Robert C. Martin", popularly known as Uncle Bob.

Uncle Bob has authored and co-authored several books. He also has got an entire series of books under "Robert C Martin Series". I want to talk about a book that he has authored with title "Clean Code".

If there is just one book that you need to read then I would say that this is the book you need to read. At times people read books and then continue to produce shit, this is not such book. This will completely change the way you write your code. Although the examples are in Java, everything Uncle Bob says is mostly applicable to C#, Python, PHP etc. So, regardless of the technology you write your code in, do read this book. Don't be fooled by name of chapters in this book might sound simplistic to you (because there are entire chapters just of naming things, creating functions etc). This book has got potential to change the way you write your code forever. There is a lot of code in this book you have to take out time to read thru all of those and once you are done with the book; you will be a better developer.

What I just said might sound like a too big of promise to you. Just believe me, and buy this book.

Happy reading!

Flowers and dagger

2018-03-02T15:38:00.000-08:00

Flowers and dagger. They don'td belong together. They are not related. Thinking of flowers; beauty, gentleness, peace and good appearance comes into mind. Opposite of flowers is dagger.

Now you must be thinking why am I describing dagger and flowers to you. The reason is to set background for question that rose in my mind during one of my closest family member's wedding; and my answer to it. As per the tradition, groom had to carry a dagger and a bunch of flowers in his hands all the time before wedding ceremony. Considering the fact that this custom was created by very thoughtful ancestors, I began to think of the reason behind coming up with this.

While looking at both together I was looking at the things around and realised that this was in indicator telling groom to prepare himself with a mindset that is both like flower and dagger. In the next phase of life he will have to use both flowers and dagger. At times he will have to be as gentle as flower and at times he will have to be as hard and threatening as dagger. Using flowers where dagger is needed would yeild wrong results and using dagger when flowers are needed would yeild wrong result.

Be mindful and always carry a dagger and a bunch of flowers.

problem 6

2017-12-19T00:54:00.001-08:00

The sum of the squares of the first ten natural numbers is,

385

The square of the sum of the first ten natural numbers is,

3025

Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.

Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.

class Program

{

static void Main(string[] args)

{

System.Numerics.BigInteger sumOfSquares = 0;

for (System.Numerics.BigInteger i = 1; i <= 100; i++)

{

sumOfSquares += (i * i);

}

System.Numerics.BigInteger sums = 0;

for (int i = 1; i <= 100; i++)

{

sums = sums + i;

}

System.Numerics.BigInteger squareOfSums = sums * sums;

Console.WriteLine(squareOfSums - sumOfSquares );

}

Problem 5

2017-12-19T00:30:00.000-08:00

    /*
    2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
    What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
     */
    class Program
    {
        static void Main(string[] args)
        {
            bool divisible = false;
            int number = 1;
            while(divisible == false)
            {
                divisible = true;
                for(int i = 1; i<=20; i++)
                {
                    if((number%i) !=0  )
                    {
                        divisible = false;
                        break;
                    }
                }
                if(divisible==true)
                {
                    Console.WriteLine(number);
                    break;
                }
                else
                {
                    number++;
                }
            }
        }
    }

Is variable named "i" fine ?

2013-11-03T05:23:00.003-08:00

At many places we see variable named "i","j","c" etc scattered every where around the code; in all the methods. The obvious question that rises is "is such short variable name (e.g., i,j,k,c,k etc) fine?". Many people says that the variable name should ALWAYS be long and descriptive but you sense of "code smell" says that it is fine. But some people says that it is fine. This might actually confuse you.

Here is the rule to answer answer the above question:

Uncle Bob's Rule:
For variable:
Longer the scope, the longer the name should be.
For function/methods and classes:
Longer the scope, shorter the name should be.

Lets understand it with an example of variable name:

The code below with variable named "i" is fine because the scope of "i" is very short :

    private static int getSumOfCharsInString(String name)
    {
        int sum = 0;
        for (int i = 0; i < name.length(); i++)
        {
            sum += getIntValueForChar(name.charAt(i));
        }
        return sum;
    }

But here the following code with variable named "c" is NOT FINE because the scope of the variable named "c" is very long(Its up to you to decide how much length to be considered as "long"). The variable named "c" should be refactored to something meaningful and long.

int main()
{
    char c;
    void getfile();
    void getfname(char []);
    char temp[MAX];  
    getfile();
    getfname(temp);
    if ( source != '\0' && html != '\0' )
    {
        fprintf( html, "%s", "" );
        fclose( html );
        fclose( source );
        printf("\nThe file is now created");
    }
.
.
.
    do
    {
       c = getc( source );
       if ( c == EOF )
       {
          break;
       }
       else if ( c == '<' )
       {
          fprintf( html, "%s", "<" );
       }
       else if ( c == '>' )
      {
          fprintf( html, "%s", ">" );
      }
      else if ( c == '&' )
      {
         fprintf( html, "%s", "&" );
      }
      else
      {
         fprintf( html, "%c", c );
      }
  }
  while ( c != EOF );
.
. 
}

Learn Your IDE

2013-09-12T10:54:00.000-07:00

Folks, Learn your IDE.

You just can't start using the IDE thinking that "yahh... !! I know how to type", "I know how to run"; but that is not enough. You need to consciously learn your IDE.

The modern IDE is very powerful. They charge you such high amount of money because of the facility they provide. It has a lot of power which can save you a lot of time.

It's worth spending some days learning the shortcuts of your favorite IDE. Whether it is ItelliJ Idea or Visual Studio; do spend time learning it.

They have features like "Incoming tab", "Refatoring" etc which will make you confident.

Clojure Learning

2013-08-15T06:58:00.001-07:00

If you are learning Clojure from books and if you feel that they are not a good place to start with then here is a resource that might help you in getting started and give you over all idea.

http://blackstag.com/blog.posting?id=5

Although will not teach every detail but should be a good place to start with rather than the books that are available.

Problem 42

2013-07-13T09:18:00.001-07:00

The n^th term of the sequence of triangle numbers is given by, t_n = ½n(n+1); so the first ten triangle numbers are:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...

By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = t₁₀. If the word value is a triangle number then we shall call the word a triangle word.

Using words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?




/**

 *

 * @author Umang 

 * started at : 13/07/2013 09:01 PM 

 * completed at : 9:26 PM

 */

import java.io.File;

import java.io.FileNotFoundException;

import java.util.HashMap;

import java.util.LinkedList;

import java.util.Scanner;

import java.util.StringTokenizer;



public class Problem42

{



    private static HashMap<Integer, Long> triangleValues;

    private static int countedTill = 0;



    static

    {

        triangleValues = new HashMap<>();

    }



    private static long calcuateTriangleNumber(int no)

    {

        return no * (no + 1) / 2;

    }



    public static long getTriangleNumber(int no)

    {

        long triangleNumber = 0;

        if (no >= countedTill)

        {

            

            int i = 0;

            for (i = countedTill; i <= no; i++)

            {

                triangleNumber = calcuateTriangleNumber(no);

                triangleValues.put(no, triangleNumber);

            }

            countedTill = i;

        }

        else

        {

            triangleNumber = triangleValues.get(no);

        }

        return triangleNumber;

    }



    private static boolean isTriangleNumber(long no)

    {

        boolean isTriangleNumber = false;

        long triangleNumber = 0;

        int i = 0;

        do

        {

            triangleNumber = getTriangleNumber(i);

            if (triangleNumber == no)

            {

                isTriangleNumber = true;

                break;

            }

            i++;

        }

        while (no >= triangleNumber);

        return isTriangleNumber;

    }



    private static String getFileContent()

    {

        StringBuilder content = new StringBuilder("");



        File aFile = new File("D:/words.txt");

        Scanner aScanner = null;

        try

        {

            aScanner = new Scanner(aFile);

        }

        catch (FileNotFoundException ex)

        {

            System.out.println("File could not be readed");

            ex.printStackTrace();

            System.exit(0);

        }

        while (aScanner.hasNextLine())

        {

            content = content.append(aScanner.nextLine());

        }

        return content.toString();

    }



    private static LinkedList<String> getWordList()

    {

        LinkedList<String> result = new LinkedList<>();



        String content = getFileContent();

        StringTokenizer lineTokenizer = new StringTokenizer(content, ",\"");

        while (lineTokenizer.hasMoreTokens())

        {

            result.add(lineTokenizer.nextToken());

        }

        return result;

    }



    private static int getCharNo(char character)

    {

        int charNo = 0;

        char capitalized = Character.toUpperCase(character);

        charNo = ((int) capitalized) - 64;

        return charNo;

    }



    private static long getValueFromString(String str)

    {

        long count = 0;

        for (int i = 0; i < str.length(); i++)

        {

            count += getCharNo(str.charAt(i));

        }



        return count;

    }



    public static void main(String args[])

    {

        int triangleNumberCount = 0;

        LinkedList<String> wordList = getWordList();

        for (String word : wordList)

        {

            if (isTriangleNumber(getValueFromString(word)))

            {

                triangleNumberCount++;

            }

        }

        System.out.println("There are " + triangleNumberCount + " triangle numbers");

    }

}

making life easier for PHP developers - auto uploading files

2013-04-05T06:18:00.003-07:00

Here is a post that explain the solution to the problem I had faced a little while ago.

I was working on a PHP project. Git was my version control system. And FTP was the primary protocol for uploading the PHP files from development server(on local machine) to the deployment server(remote machine).

I felt that uploading the files manually to the server was tedious task (although I could find out what files have changed between given commits etc). This uploading was taking quite a lot of time of ours so I thought of getting some automated solution to this problem. I "googled" a little about it and here is the solution:

We were already using the Git. We used a ready made - open source solution developed by other developer.

The tool that made our life easier was git-ftp. It is hosted on https://github.com/ezyang/git-ftp. You can freely obtain it and use it for your purpose. In our case we used it for uploading PHP files but it might work for other suitable tasks also.

Here is are the steps to install "git-ftp" on windows machine:
Step 1: Install Python
Obtain Python 2.7.3 from the official Python website. Start the installer. It should have screens as shown below.

Step 2: Put python executable in path

After the last screen appears click on finish button. No you will have Python installed on your machine.
But executing it from the console would give you an error because it is not in path. In order to put python executable in your path you need to do it as shown in the images below:

Copy the path where python is installed.

Right click on My Computer and then click on properties.

Then click on Advanced System Settings.

Then click on "environment variables" button.

Then search for "Path" in "System Variables" and append the ";" and the path in which Python is installed.

Then click on ok ok ok ...

By now you will have python set and you will be able to execute it from command line.

Step 3 : Install Setup Tools
Installation of setup tools is required. Set up tool's windows installer can be obtained from https://pypi.python.org/pypi/setuptools .
Install it as shown in the screenshots.

By now you will have set up tools installed.

Step 4: Install GitPython
You need to install GitPython then. It is required because the Python script will be accessing the git repository. GitPython can be obtained from http://gitorious.org/git-python.
you need to install it from command line by invoking the setup.py with install parameter.
eg:

Now we have got GitPython installed we can move on to our project directory.

Step 1 to step 4 will be one time only. Step 5 to will be repetitive for project.

Step 5: obtain and put the python script in your project directory.
We can obtain the python script from https://github.com/ezyang/git-ftp.
Put the git-ftp.py script in the project directory.

Step 6: Create a file containing FTP credentials.
We need to create a file containing the credentials in the .git directory. If you don't create the file then it will ask you for details every time the script runs. If we put the file with credentials in .git directory then the python script will automatically read the details and upload that to the server.

The name of file must be "ftpdata" (without quotes). File name should be "ftpdata" without any extensions like txt etc.
If you are having multiple branches and each branch is deployed to different server the file might look like(name in square bracket is name of branch):

Put this file in ".git" directory.

Step 7: After doing this upload the "git-rev.txt" file to the root directory of the server. Put the sha1 of the last commit in the file.
The upload script knows which files needs to uploaded from this file. This file is changed by the upload script each time it executes.

Now you can execute the git-ftp.py scrip. It will upload all the files that are committed in git to appropriate server (depending on your branch).

Some users might also want to create a ".bat" file that looks like:

Some users might also want to create a ".bat" file with "git gc" command (make sure that git is in your path to do this).

Now you have everything set up. Just run the script and everything works !! :D
Every time you make the commit, you can just run the script and all the files committed will be uploaded to the server. No overwrites by mistake!

Suggestions:
1. If upload does not work then execute "git gc" command on your project repository.
2. If upload fails then make sure that you and all others are in sync with each other through git.
3. Read the error message from script if something goes wrong.
4. The installation is easier on linux machines.
5. See the read-me of project at https://github.com/ezyang/git-ftp.

Limitation:
Some other protocols are not supported by the tool which we are using.

Debugging !

2013-03-01T11:35:00.000-08:00

Lets not talk about debugging first and talk about 2 other things:

1:

Have you imagined what might be happening when an engineer decides to create a new plane with a new design ? (We assume that one can do so ;) ) He thinks about the purpose, safety, design etc. He might think about aerodynamics, propulsion, fuselage, mass, structure etc. The design process would also include the use of Computational Fluid Dynamics (CFD). In short the process before building some physical component takes a long time. Even after they have built some physical model, they need to test it in wind tunnel to be sure about it. Similar amount of effort is given the construction/engineering of other components.

If you want to test your physical component in real, then you might have to rent/buy a wind tunnel at relatively higher price then of an average computer. Also if some other electronic/mechanical component fails at run-time, finding the actual problem and fixing it is a difficult task.

Imagine you have a Mercedes-Benz W116. The car was excellent product when it was built and you are not maintaining it properly. It continues to cause problem frequently because you are not maintaining it properly. You have also learned to fix the problems with car as and when they arise.It might take some time some day, but you some how fix it.
On one fine day your mom asks you to drop her to a church and in-between on the road the car causes problem. But, as you have become familiar with problem solving you would be able to solve it and car start again and you would be able to successfully drop your mom to church. In this situation your mom should not be happy thinking that "owww, my son could correct that!"; instead she should think like "oh! how could this happen ? car stopped ?!! ".

Now that we have laid out enough foundations that needs clear out the point that i want to show; we can discuss the main topic of this post. That is "Debugging".

We, the software craftsman/developers write software/applications that people use in day to day life. But we are not able to develop them on the first run. Sometimes things would go wrong with the software that we are developing. And when things go wrong; the bug comes out, we must find the cause and fix it.

To fix the problem we must look "into" the software while it is running. Now compare it with the aircraft system. Imagine what hey might be doing when an issue rises with the engine of aircraft ?

Surely the software craftsmen/developers have more power when compared with aeronautics people. They can not see what is happening in the engine while it is running at 10,000 RPMs while the software developers can pause the execution of software on their machines without any significant amount of investment. Developers do not have to got to wind tunnels in order to see something in action.

A software developer/craftsman can put a break-point and then do the magical things like step in, step out, runt to cursor etc. Recently I have met some some people for whom the debugger does not exists. They do not know about the remote debugger available. They do not know how to configure xDebug with PHP. They do not know that GDB exists. Some people think that they are using exotic languages like Ruby and Python and debugger is not there for their language. But; by thinking wrong directions they are missing something really important.

Sometimes people forget that debuggers exists and we can see what is happening in your code in real time line by line, variable by variable. We can see all the variables, objects etc by putting a watch on them !! If we are doing web development then we can see all the parameters in the variables in the real-time inside our IDE(although non visual-command based debuggers exists, but i prefer debugging visually)(eg we can see $_GET, $_POST etc in php while debugging in Netbeans).

We can see what is happening in our software step by step, line by line; Now imagine what people in aeronautics and other industries would had done if they had such power at their fingertips at such low cost ? We are underestimating the power that we have with debugger and in-turn underestimating ourselves.

But make sure that it does not become a daily and routine activity. Debugging is not central activity of development process. It should not be daily activity as it was with our virtual/imaginary car.

Your boss should also think same as your mom. Debugging should not become routine as it was with car. Neither some one should be proud of it!

Also the boss should not be proud of a person with good debugging skills!

We should work in such way that odd situations like these do not rise!

Write such code that no problems get raised and in-turn you do not have to debug. But when the problem gets raised be equipped with debugger of your language and solve the bug well. Do not forget to take advantage of good debugging tool, but make sure that you are not making it continuous activity.

Difference between layered architecture and tiered architechture

2013-02-10T12:10:00.000-08:00

When discussing layering, there's often some confusion over the terms layer and tier. Often the two are used as synonyms, but most people see tier as implementing a physical layer.

- "Patterns of enterprise application architecture" By Martin Fowler. Page No: 19. ISBN: 978-81-317-9402-9

While discussing with a collage mate I found out that the confusion about the "tiered" architecture of the application and the "layered" architecture of the application really needs to be cleared up. So this post is here to make the things clearer. Those already know what the difference is can ignore this post; this post is intended for those who do not understand it well. (However this will not teach you how you should design your layers/tiers; instead it shows the difference)

But before going into the question of layer and tier we need to ask a fundamental question: why tier and layer are required ?
And the answer could be to reduce complexity, increase re-usability, or for standardization etc.

In both the terminologies, they divide the code in different parts like "presentation","domain logic","data source logic"(or even more parts sometimes).

In really simple application one might have one method(i use the term method to indicate a group of callable statement, it might be a function, subroutine etc in context of any other c like language). One might be to get data, second could be for domain logic and third could be for view. But as the application becomes more and more complex you will be required to separate them through some mechanism. In the next iteration of development you might move those methods to different classes. And if the application is even more complex, you might put those classes in different package,or namespace or any other mechanism to separate them.

If it is a java application you might create separate classes, put them in one jar and use them in the upper level abstractions. If you are working on a .Net project you might create a dll in same way. If you are working in some other language there would be some mechanism to achieve the same thing.

Typically one would create a package(or dll or jar) for data source logic (that is for accessing data from the data source - typically it would abstract the data access to higher level layers. the higher level layers should not know from where the data is coming from. you might be able to change the data source from file to relational database and from that to non-relational database without higher level knowing about the change. You get such advantages when designing an application with layering in mind.). You would use the data source logic in the domain logic. And then further use the domain logic in the presentation. What you would be doing is much like shown in the Fig-1 below:

Fig-1

What we are doing here in Fig-1 is logical separation of code. Although you would have programmed the code in different method, different class, different package, different project; at its heart all the code would be running on the same machine. When the code is running on the same machine as shown in the above fig it is known as "layering".

But sometimes because of some issues the layering of the application does not help, you need to make pieces of you application and put them on different machines to solve those issues. When you put those pieces (e.g., presentation, data source logic and domain logic etc or even more pieces) on different machines, they would communicate with each other over the network in order to complete some activity.

The communication could happen by simply accessing a restful URL, or calling a web-service or calling a WCF service of RMI or any other technology. Typically when you say the architecture is "tiered", the 'pieces' would typically be on different physical(or logical) machine.

Fig - 2

Whenever we use the term tiered the communication between pieces happens through network. While development you might put all the pieces on a single machine, but typically the term tiered means that they can be deployed ever the machine anywhere.

When ever you apply tired architecture, it greatly affects the over all performance when compared with the layered architecture because the communication between two physical machines is always slower than the communication between two pieces on the same machine.

Although one tier itself can have many layers in it.

To conclude we can say that even if you have used methods to separate view, domain model etc; you can call it a layered architecture. Layered architecture is on same machine. Tiered architecture is always on different machine (although you can put them on same machine if you wish).

There are many points that affect the decision abut layered architecture and tiered architecture so a trainee or journey man should never take decision directly. He/She should always consult the "master craftsman" before taking any decision.

Problem 28

2013-01-18T01:00:00.000-08:00




//package javaapplication1;



/**

Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:



21 22 23 24 25

20  7  8  9 10

19  6  1  2 11

18  5  4  3 12

17 16 15 14 13



It can be verified that the sum of the numbers on the diagonals is 101.



What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?

*/



/**

 * this is what one can write with poor tools

 */



/**

 * Timing: 1:01 am to 1:54 am

 * @author umang

 */

public class Problem28 {



    /**

     * @param args the command line arguments

     */

    public static void main(String[] args) {

        int max = 1001;

        int arr[][] = new int[max][max];

        int x = max / 2;

        int y = max / 2;

        int count = 0;

        int increment = 2;



        // initialize first square

        arr[x][y] = count++;

        arr[x][y++] = count++;

        arr[x++][y] = count++;

        arr[x][y--] = count++;

        arr[x][y--] = count++;

        arr[x--][y] = count++;

        arr[x--][y] = count++;

        arr[x][y++] = count++;

        //arr[x][y++] = count++;

        //arr[x][y++] = count++;

        //   y++;

        //System.out.println(x + " " + y + " " + count + " " + increment);

        while (x != 0 && y != 1) {

            increment++;

            //  System.out.println("start " + x + " " + y + " " + count + " " + increment);

            for (int i = 0; i < increment; i++) {

                arr[x][y++] = count++;

                //y++;

            }

            y--;

            x++;



            //System.out.println(x + " " + y + " " + count + " " + increment);

            for (int i = 0; i < increment; i++) {



                arr[x++][y] = count++;

                //    System.out.println(x + " " + y + " " + count + " " + increment);

            }

            x--;

            y--;

            increment++;

            //System.out.println(x + " " + y + " " + count + " " + increment);

            for (int i = 0; i < increment; i++) {

                arr[x][y--] = count++;

            }

            x--;

            y++;

            ///System.out.println(x + " " + y + " " + count + " " + increment);

            for (int i = 0; i < increment; i++) {

                arr[x--][y] = count++;

            }



            x++;

            y++;

            //System.out.println("end" + x + " " + y + " " + count + " " + increment);

        }

        for (int i = 0; i < increment; i++) {

            arr[x][y++] = count++;

        }

     /*   for (int i = 0; i < arr.length; i++) {

            for (int j = 0; j < arr[i].length; j++) {

                System.out.printf("%2d ", arr[i][j]);

            }

            System.out.println("");

        }*/

        int sum = 0;

        for (int i = 0; i < arr.length; i++) {

            //   System.out.println(arr[i][i] + " ");

            sum += arr[i][i];

        }



        int row = 0;

        for (int i = arr.length - 1; i >= 0 && row < arr.length; i--, row++) {

            if (row != i) {

                sum += arr[row][i];

            }

        }

        System.out.println("sum is " + sum);

    }

}

Refactoring code-1 - breaking complex if...else to simple structure

2013-01-13T03:40:00.001-08:00

In order to show how I broke down nested if...else structure into smaller, more manageable pieces, I have to show it with an example. The example might be technology specific but person with a little experience will be able to figure out what I did-and how the very same thing could be done with his/her programming language.

I was working on a web based application on PHP and CodeIgniter framework. Application was simple in the beginning. Admin could do certain things. Obviously the user should be allowed only after logging in through the admin login. If the login was successful the we set certain things in the session. All the admin pages should be accessible only after logging in to the system. I thought of some solution that was like "Aspect Oriented Programming" (or AOP) that i was used to do with Java(Spring AOP / AspjecctJ). The very same thing could be achieved in the CodeIgniter framework through what they call hooks.

We would be seeing the same hook that my team mate wrote and later I refactored for better maintainability (we will take it as an example in order to understand the technique).

We created a controller "login_check" and a method named "checkLogin". The checkLogin function from "login_check" class was invoked before any controller(the entry needed to be made in the hooks.php in application/config in php-CodeIgniter project). By doing this we saved ourselves from writing if/else on all the pages in the admin part.

(This method is executed before any controller - controller method execution)

The class looked something like shown in the snippet-1:
It is a normal CodeIgniter controller with a constructor. The line 11 (in code snippet-1) checks if the class(controller in this case) is 'authenticate' (the method check_login is executed before doing anything in the actual controller.) If the class is the authenticate (the one that renders the form) then we should not be redirecting him/her to the login (through appropriate route) (otherwise it would send us in a redirection loop that does not end). If the user has requested login page or anything that has anything to do with authenticate then we are not redirecting the user(eg if the button click on login page invokes a method from authenticate controller indirectly).

On the line 12 in the snippet-1 we get the CodeIgniter instance that is required in order to access the session.

And on the line 13 we check if the session is set and if not set then we redirect the visitor the the login page.

All the pages for admin were with URI "admin/".

Things we good enough so far. Then we started implementing the Student part. Now we were required to write the pages for Student as well. Student also could see pages only after he/she is authenticated. The student can not see pages for admin that is the student can not see the pages for which he/she is not authorized.

Now we had to write the code that would check if the user is logged in or not also we also had to make sure that the user is accessing the intended pages only(that is admin is accessing pages of admin and the student is accessing the pages of student only). If the student tried to see the pages of admin then he was to be redirected to his home page (that is URI "/student").

Also if the user had requested any URI starting with student/* as was not authenticated then we had redirect the user to user's login page of student. Same way if the user tries to access anything with URI matching :admin/*" then we had to redirect the user to admin's login page.

The code looked as shown in Snippet-2.

To understand what is happening here we need to first know the method _get_root_directory_requested() (that I have written in snippet-2). This method returns the top level directory name from the requested URI (if if user has requested '/admin/students/edit/1' then the method would return 'admin'). That method helped in keeping the "checkLogin" function smaller.

The line 24 in snippet-2 does the same thing discussed earlier.
Then on the line 26 we get the requested directory(eg admin,student).
On line 27 we check if the user is logged in as admin and he has requested for /. In this case we redirect him to admin/dashboard.
On line 42 we redirect the user to student/dashboard if the student has logged in and trying to access / URI.

On line 38 we redirect the user to appropriate login page depending on the top level directory he has requested. And on the 45 onward we redirect the student to student/dashboard and admin to admin/dashboard if he/she is trying to access un-authorized pages.

This also worked fine so far. After this we were asked to write the Super-Admin feature. In super admin we had to create a user who could manage the administrators. This introduced the third User-Type. We had to check the very same things discussed above(that is user should be given access to pages for which he/she is authenticated and authorized).

Because of the third user being added I though of adding some more if...else to make the things work. But if I had done it, it would make the function even bigger^[1] and difficult to read and in-turn difficult to maintain. Also the function will not be visible on the screen once on normal displays.

So i applied some refactoring to it. After doing it the code looked as it is shown in scnippet-3.

The method '_get_root_directory_requested' stays as it was in the previous snippet and does the same thing.
checkLogin is the method which would be invoked and it would invoke other methods in order to perform its task.

We would now see what changes I did in order to make things easier to read and maintain.

The line 36 checks if the controller before which the method is invoked is not one of authentication controller. We have replaced a complex condition with a method call. We placed the complex condition inside a method call that is easier to read as well as easier to maintain^[1]. The complex condition with two 'and' was encapsulated inside a method named '_is_authentication_controller'. This can also be seen as an abstraction we built. It prevents us from getting to the actual detail of names of the controllers. We can just use the method. We are not required to go into the details. In future if new controller for authentication is added (in case of new user being added) then we would be easily able to make the changes.

At line 39 we call a method that checks for login in the session. It returns true if user is logged in and false if the user is not logged in. On the line 40 we get the user type that is logged in. On the line 41 we call method "_authorize_for_url_with" with argument of user type that we have got from previous line.

The method "_authorize_for_url_with" redirects the user to appropriate path if the user is not authorized for the URI and the method does nothing if user is trying to access intended pages.

In the Else part at line 45 we call the method "_redirect_to_appropriate_login" which redirects the user to the login page. The user is redirected to the URI "student/" if the user has requested for "/" URI. This method uses the "Direct Access Tables^[2]"(the array- or the data-structure that holds the details is constructed in the constructor at line 20)(although the data-structure would vary according to the language but the concept would remain the same. You could also put that in a method if you wish.). This method relies on the values in the associative array. The key is top directory requested or user-type(ed admin,student,etc) and the value is the page to which the user needs to be redirected in order to login.

Here in this case the length of method was reduced be introducing some methods. In this structure if a new user type is added then we just need to add its entry in the constructor and add its controller class name to method "_is_authentication_controller". No other changes needs to be done on other part. This makes the class more flexible and ready to adopt new user types.

Although I have made some assumption while writing which you can read in the comments written at the top of the class in snippet-3.

This is the first time i have tried writing something. I have started noticing some problems already; but however I am publishing this post. ;) I hope it is entertaining.

References:
[1] Clean Code: A Handbook of Agile Software Craftsmanship by Robert C. Martin (ISBN: 0132350882 )
[2] Code Complete: A Practical Handbook of Software Construction, Second Edition By Steve McConnell (ISBN: 0735619670 )

Amicable Number

2013-01-10T21:30:00.000-08:00


import java.util.ArrayList;



/**

 * @author Umang

 */

/**

 * Let d(n) be defined as the sum of proper divisors of n 

 * (numbers less than n which divide evenly into n).

 * 

 * If d(a) = b and d(b) = a, where a  b, then a and b are an amicable pair 

 * and each of a and b are called amicable numbers.

 * 

 * For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 

 * 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 

 * 71 and 142; so d(284) = 220.

 * 

 * Evaluate the sum of all the amicable numbers under 10000.

 */

public class Problem21

{



    private static boolean isAmicable(int no)

    {

        long sum = sum(getEvenDivisors(no));

        long no2 = sum(getEvenDivisors(sum));

        return no == no2 && sum != no;

    }



    private static long sum(ArrayList<Long> numbers)

    {

        long ans = 0;

        for (Long number : numbers)

        {

            ans += number;

        }

        return ans;

    }



    private static ArrayList<Long> getEvenDivisors(long n)

    {

        long root = Math.round(Math.sqrt(n)) + 1;



        ArrayList<Long> test = new ArrayList<Long>();

        test.add(1L);

        for (long i = 2; i <= root; i++)

        {

            if (n % i == 0)

            {

                test.add(i);

                test.add(n / i);

            }

        }

        return test;

    }



    public static void main(String[] args)

    {

        long sum = 0;

        for (int i = 0; i < 10000; i++)

        {

            if (isAmicable(i))

            {

                sum = sum + i;

            }

        }

        System.out.println("Sum = " + sum);

    }

}

Circular Primes

2013-01-10T21:00:00.000-08:00


package javaapplication3;



import java.util.ArrayList;



/**

 * The number, 197, is called a circular prime because all rotations of the

 * digits: 197, 971, and 719, are themselves prime.

 *

 * There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71,

 * 73, 79, and 97.

 *

 * How many circular primes are there below one million?

 */

/**

 * @author Umang

 */

public class Problem35

{



    public static ArrayList<Long> getDigits(long no)

    {

        ArrayList<Long> numbers = new ArrayList<Long>();

        long temp = no;

        while (temp > 0)

        {

            numbers.add(temp % 10);

            temp /= 10;

        }

        return numbers;

    }



    private static int getCount(long no)

    {

        ArrayList<Long> numbers = getDigits(no);

        return numbers.size();

    }



    public static long sumOfFactorialOfEach(ArrayList<Integer> numbers)

    {

        long sum = 0;



        for (int no : numbers)

        {

            sum += factorial(no);

        }

        return sum;

    }



    static boolean isPrime(long n)

    {

        //check if n is a multiple of 2

        if (n % 2 == 0)

        {

            return false;

        }

        //check the odds

        for (long i = 3; i * i <= n; i += 2)

        {

            if (n % i == 0)

            {

                return false;

            }

        }

        return true;

    }



    static String rotate(String number)

    {

        return number.subSequence(1, number.length()) + "" + number.charAt(0);

    }



    private static long factorial(long no)

    {

        return no == 1 ? 1 : no * factorial(no - 1);

    }



    static boolean checkRotationsAndPrime(long no)

    {

        boolean allPrimes = true;

        String strNo = new Long(no).toString();

        int rotations = getCount(no);

        for (int i = 0; i < rotations; i++)

        {

            if (!isPrime(new Long(strNo)))

            {

                allPrimes = false;

            }

            strNo = rotate(strNo);

        }

        return allPrimes;

    }



    public static void main(String[] args)

    {

        long count = 0;

        for (int i = 1; i <= 1000000; i++)

        {

            if (checkRotationsAndPrime(i))

            {

                count++;

            }

        }

        System.out.println("\nCount is " + count);

    }

}

Problem 18

2013-01-10T05:22:00.000-08:00


package javaapplication3;



import java.io.File;

import java.io.FileNotFoundException;

import java.util.LinkedList;

import java.util.Scanner;

import java.util.StringTokenizer;



/**

 * By starting at the top of the triangle below and moving to adjacent numbers

 * on the row below, the maximum total from top to bottom is 23.

 *

 *    3

 *   7 4

 *  2 4 6

 * 8 5 9 3

 *

 * That is, 3 + 7 + 4 + 9 = 23.

 *

 * Find the maximum total from top to bottom of the triangle below:

 *

 *                        75

 *                      95 64

 *                     17 47 82

 *                   18 35 87 10

 *                 20 04 82 47 65

 *               19 01 23 75 03 34

 *              88 02 77 73 07 63 67

 *             99 65 04 28 06 16 70 92

 *           41 41 26 56 83 40 80 70 33

 *         41 48 72 33 47 32 37 16 94 29

 *        53 71 44 65 25 43 91 52 97 51 14

 *      70 11 33 28 77 73 17 78 39 68 17 57

 *    91 71 52 38 17 14 91 43 58 50 27 29 48

 *  63 66 04 68 89 53 67 30 73 16 69 87 40 31

 * 04 62 98 27 23 09 70 98 73 93 38 53 60 04 23

 *

 * NOTE: As there are only 16384 routes, it is possible to solve this problem by

 * trying every route. However, Problem 67, is the same challenge with a

 * triangle containing one-hundred rows; it cannot be solved by brute force, and

 * requires a clever method! ;o)

 */

/**

 *

 * @author Umang

 */

public class Problem18

{



    /**

     * get the file content from given location

     * @return file content in string format

     */

    private static String getFileContent()

    {

        StringBuilder content = new StringBuilder("");



        File aFile = new File("D:/input.txt");

        Scanner aScanner = null;

        try

        {

            aScanner = new Scanner(aFile);

        } 

        catch (FileNotFoundException ex)

        {

            System.out.println("File could not be readed");

            ex.printStackTrace();;

            System.exit(0);

        }

        while (aScanner.hasNextLine())

        {

            content = content.append(aScanner.nextLine() + "\n");

        }

        return content.toString();

    }



    /**

     * gets the numbers in format of  LinkedList<LinkedList<Integer>>

     * @return  LinkedList<LinkedList<Integer>> from the ifile

     */

    private static LinkedList<LinkedList<Integer>> getList()

    {

        LinkedList<LinkedList<Integer>> result = new LinkedList< LinkedList< Integer>>();



        String content = getFileContent();

        StringTokenizer lineTokenizer = new StringTokenizer(content, "\n\r");

        while (lineTokenizer.hasMoreTokens())

        {

            LinkedList<Integer> row = new LinkedList<Integer>();



            StringTokenizer numberTokenizer = new StringTokenizer(lineTokenizer.nextToken(), " ");

            while (numberTokenizer.hasMoreTokens())

            {

                Integer no = new Integer(numberTokenizer.nextToken());

                row.add(no);

            }



            result.add(row);



        }

        return result;

    }



    /**

     * 

     * @param rows is the LinkedList<LinkedList<Integer>> where everything is stored

     * @param row_no is the row number

     * @param col_no is the column number

     * @return the actual number at given row and column from LinkedList<LinkedList<Integer>>

     * @throws Exception if no number is found in the list (assuming that the 

     * number is never 0 in the list)

     */

    public static int get_item_at(LinkedList<LinkedList<Integer>> rows, int row_no, int col_no) throws Exception

    {

        int no = 0;



        int row_count = 0;

        int col_count = 0;



        for (LinkedList<Integer> row : rows)

        {

            col_count = 0;

            for (Integer number : row)

            {

                if (row_no == row_count && col_count == col_no)

                {

                    no = number;

                    break;

                }

                col_count++;

            }

            row_count++;

        }

        if (no == 0)

        {

            throw new Exception("No such item");

        }

        return no;

    }



    public static void main(String[] args) throws Exception

    {

        LinkedList<LinkedList<Integer>> numbers = getList();

        System.out.println("Ans is " + getHighestSumFromList(numbers, 0, 0));

    }



    private static int getHighestSumFromList(LinkedList<LinkedList<Integer>> rows, int row, int col) throws Exception

    {

        int currunt_no = get_item_at(rows, row, col);

        int mul_left = 0;

        int mul_right = 0;

        try

        {

            mul_left = getHighestSumFromList(rows, row + 1, col)  + currunt_no;

            mul_right = getHighestSumFromList(rows, row + 1, col + 1)  + currunt_no;

        } 

        catch (Exception e)

        {

            // if at the end of the list then return the currunt value 

            return get_item_at(rows, row, col);

        }

        int bigger_number =  mul_left > mul_right ? mul_left : mul_right;

        return bigger_number;



    }

}

Problem 92

2013-01-09T09:30:00.000-08:00


package javaapplication3;



import java.util.ArrayList;



/**

 * A number chain is created by continuously adding the square of the digits 

 * in a number to form a new number until it has been seen before.

 *  

 * For example,

 * 44 -> 32 ->  13 ->  10 ->  1 ->  1

 * 85 -> 89 -> 145 -> 42 -> 20 -> 4 -> 16 -> 37 -> 58 -> 89

 * 

 * Therefore any chain that arrives at 1 or 89 will become stuck in an 

 * endless loop. What is most amazing is that EVERY starting number will 

 * eventually arrive at 1 or 89.

 * 

 * How many starting numbers below ten million will arrive at 89?

 */

/**

 * @author Umang

 */

public class Problem92

{



    public static ArrayList<Long> getDigits(long no)

    {

        ArrayList<Long> numbers = new ArrayList<Long>();

        long temp = no;

        while (temp > 0)

        {

            numbers.add(temp % 10);

            temp /= 10;

        }

        return numbers;

    }



    public static long sumSquaresOfNo(long no)

    {

        ArrayList<Long> numbers = getDigits(no);

        long sum = 0;



        for (long curunt_no : numbers)

        {

            sum += (curunt_no * curunt_no);

        }

        return sum;

    }



    static boolean doesArrivesAt89(long no)

    {

        boolean return_val = false;

        long squares = sumSquaresOfNo(no);

        if (squares == 1 || squares == 89)

        {

            if (squares == 1)

            {

                return_val = false;

            } 

            else if (squares == 89)

            {

                return_val = true;



            }

        } else

        {

            return_val = doesArrivesAt89(squares);

        }

        return return_val;

    }



    public static void main(String[] args)

    {

        int count = 0;

        for (long l = 1; l <= 10000000; l++)

        {

            if (doesArrivesAt89(l))

            {

                count++;

            }

        }

        System.out.println("count is " + count);

    }

}

Sieve of Eratosthenes - primes

2013-01-08T20:05:00.000-08:00




import java.util.LinkedList;

import java.util.Scanner;



/**

 * 2:42 - 3:30

 */



/**

 * http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes To find all the prime

 * numbers less than or equal to a given integer n by Eratosthenes' method: 

 * 1. Create a list of consecutive integers from 2 to n: (2, 3, 4, ..., n). 

 * 2. Initially, let p equal 2, the first prime number. 

 * 3. Starting from p, count

 *    up in increments of p and mark each of these numbers greater than p itself 

 *    in the list. These will be multiples of p: 2p, 3p, 4p, etc.; note that 

 *    some of them may have already been marked. 

 * 4. Find the first number greater than p in

 *    the list that is not marked. If there was no such number, stop. Otherwise,

 *    let p now equal this number (which is the next prime), and 

 *    repeat from step 3.

 */

/**

 * @author Umang Bhatt

 */

class Node

{



    private int no;

    private boolean marked;



    public Node(int no)

    {

        this.no = no;

        marked = false;

    }



    public int getNo()

    {

        return no;

    }



    public void setNo(int no)

    {

        this.no = no;

    }



    public boolean isMarked()

    {

        return marked;

    }



    public void setMarked(boolean marked)

    {

        this.marked = marked;

    }

}



public class SieveOfEratosthenes

{

    

    public static void main(String[] args)

    {

        Scanner aScanner = new Scanner(System.in);

        System.out.println("Enter an integer: ");

        int no = 0;

        try

        {

            no = aScanner.nextInt();

        } 

        catch (java.util.InputMismatchException e)

        {

            System.out.println("You entered invalid number. Can not eontinue");

            System.exit(0);

        }



        LinkedList<Integer> primeNumberList = getAllPrimesLessThan(no);



        System.out.println("");

        for (Integer primeNo : primeNumberList)

        {

            System.out.print(primeNo + " ");

        }

    }

    

    /**

     * takes a number and returns all the primes.

     * @param no is the maximum no. the primes will be below this number.

     * @return  linked list of integers having only prime numbers

     */

    public static LinkedList<Integer> getAllPrimesLessThan(int no)

    {

        LinkedList<Integer> primeNumberList = new LinkedList<Integer>();

        LinkedList<Node> allNUmberList = getNodeListWithItemsLessThan(no);



        primeNumberList.addAll(getThefirstUnmarkedAndMarkOtherMultiplesIn(allNUmberList));

        primeNumberList.addAll(getUnMarkedIntegers(allNUmberList));



        return primeNumberList;

    }

    

    /**

     * This method created a list of nodes with values between 2 and given number no

     * @param no is the limit

     * @return the list of nodes 

     */

    private static LinkedList<Node> getNodeListWithItemsLessThan(int no)

    {

        LinkedList<Node> nodeList = new LinkedList<Node>();

        for (int i = 2; i <= no; i++)

        {

            Node aNode = new Node(i);

            nodeList.add(aNode);

        }

        return nodeList;

    }

    

    /**

     * This method adds the first node. Adds it to the primeNumber list and then

     * marks all multiples of that number as marked true

     *

     * @param allNUmberList is the list of nodes created initially

     * @return the list of integers.

     */

    private static LinkedList<Integer> getThefirstUnmarkedAndMarkOtherMultiplesIn(LinkedList<Node> allNUmberList)

    {

        LinkedList<Integer> primeNumberList = new LinkedList<>();

        for (Node aNode : allNUmberList)

        {

            if (aNode.isMarked() == false && hasUnmarkedNodes(allNUmberList))

            {

                    Node curruntNode = getFirstUnmarked(allNUmberList);

                    curruntNode.setMarked(true);

                    primeNumberList.add(curruntNode.getNo());

                    markMultiples(allNUmberList, curruntNode.getNo());

            }

        }

        return primeNumberList;

    }

    

    /**

     * returns the first un-marked node in the list.

     * @param aNodeList is the list of nodes.

     * @return the first un-marked node.

     */

    private static Node getFirstUnmarked(LinkedList<Node> aNodeList)

    {

        Node returnNode = null;

        for (Node aNode : aNodeList)

        {

            if (!aNode.isMarked())

            {

                returnNode = aNode;

                break;

            }

        }

        return returnNode;

    }

    

    /**

     * checks whether the list has unmarked nodes

     * @param aNodeList

     * @return boolean stating whether the list has unmarked nodes or not.

     */

    private static boolean hasUnmarkedNodes(LinkedList<Node> aNodeList)

    {

        boolean hasUnmarkedEntries = false;

        for (Node aNode : aNodeList)

        {

            if (!aNode.isMarked())

            {

                hasUnmarkedEntries = true;

                break;

            }

        }

        return hasUnmarkedEntries;

    }



    /**

     * this method marks all the numbers that are multiples of given number in 

     * the passed list of nodes.

     * @param nodeList is the list of nodes constructed originally

     * @param number is the number of which's multiples will be marked.

     */

    private static void markMultiples(LinkedList<Node> nodeList, int number)

    {

        for (Node aNode : nodeList)

        {

            if (aNode.getNo() % number == 0)

            {

                aNode.setMarked(true);

            }

        }

    }



    /**

     * returns all the nodes that are un-marked.

     * @param allNUmberList

     * @return list of un-marked nodes

     */

    private static LinkedList<Integer> getUnMarkedIntegers(LinkedList<Node> allNUmberList)

    {

        LinkedList<Integer> primeNumberList = new LinkedList<>();

        for (Node aNode : allNUmberList)

        {

            if (!aNode.isMarked())

            {

                primeNumberList.add(aNode.getNo());

            }

        }

        return primeNumberList;

    }



}

PHP quiz

2012-11-16T01:40:00.001-08:00

PHP quiz » quiz builder

leap year

2012-10-21T12:17:00.002-07:00


/**
 * A program to tell whether an year is leap year or not.
 * @author Umang Bhatt
 */
public class LeapYearTester
{

        public static boolean isLeapYear(int year)
        {
                boolean isLeapYear ;
                if (year % 4 == 0)
                {
                        if (year % 100 == 0)
                        {
                                if (year % 400 == 0)
                                {
                                        isLeapYear = true;
                                }
                                else
                                {
                                        isLeapYear = false;
                                }
                        }
                        else
                        {
                                isLeapYear = true;
                        }
                }
                else
                {
                        isLeapYear = false;
                }
                return isLeapYear;
        }

        public static void main(String args[])
        {
                System.out.println(isLeapYear(2003));
        }
}

clear screen in java

2012-09-06T10:24:00.000-07:00

Clearing the screen with Java in platform independent way (on both Windows and Linux platform).
Here are the videos that show how to clear the console:

Part 1

Part 2

You can download JANSI from http://jansi.fusesource.org/
You can refer to the API docs from http://jansi.fusesource.org/documentation/api/index.html

one program many ways

2012-09-03T11:50:00.000-07:00

Program to check whether a number is positive, negative or is zero: (I did this while one of the teaching sessions in a few minutes to encourage student for coming out with new solutions )many programs same thing:

1:

#include<stdio.h>

int main()
{
 int a,b;
 
 printf("enter the number");
 scanf("%d",&a);
 if(a==0)
 {
  printf(" %d number is 0",a);
 }
 else 
 {
  if(a>0)
  {
   printf(" %d number is possitive",a); 
  }
  else
  {
   printf("%d number is nagitive",a);
  }
 }
 
 return 0;
}

#include<stdio.h>

int main()
{
 int a,b;
 
 printf("enter the number");
 scanf("%d",&a);
 if(a>0)
 {
  printf(" %d number is possitive",a); 
 }
 else if(a<0)
 {
  printf("%d number is nagitive",a);
 } 
 else if(a==0)
 {
  printf(" %d number is 0",a);
 }
 
 
 return 0;
}

#include<stdio.h>

int main()
{
 int a,b;
 
 printf("enter the number");
 scanf("%d",&a);
 if(a>0)
 {
  printf(" %d number is possitive",a); 
 }
 else if(a<0)
 {
  printf("%d number is nagitive",a);
 } 
 else
 {
  printf(" %d number is 0",a);
 }
 
 
 return 0;
}

#include<stdio.h>

int main()
{
 int a,b;
 
 printf("enter the number");
 scanf("%d",&a);
 if(a>0 || a<0 )
 {
  if(a>0)
  {
   printf(" %d number is possitive",a);   
  }
  else if(a<0)
  {
   printf("%d number is nagitive",a);
  }
 } 
 else
 {
  printf(" %d number is 0",a);
 }
 
 
 return 0;
}

#include<stdio.h>

int main()
{
 int a,b;
 
 printf("enter the number");
 scanf("%d",&a);
 if(a>0 | a<0 )
 {
  if(a>0)
  {
   printf(" %d number is possitive",a);   
  }
  else if(a<0)
  {
   printf("%d number is nagitive",a);
  }
 } 
 else
 {
  printf(" %d number is 0",a);
 }
 
 
 return 0;
}

#include<stdio.h>

int main()
{
 int a,b;
 
 printf("enter the number");
 scanf("%d",&a);
 if(a!=0)
 {
  if(a>0)
  {
   printf(" %d number is possitive",a); 
  }
  else
  {
   printf("%d number is nagitive",a);
  }
  
 }
 else 
 {
  printf(" %d number is 0",a); 
 }
 
 return 0;
}

presentation on version control

2012-07-26T06:43:00.002-07:00

dear readers
here is a link to one of my presentation that i gave at collage (actually its a recording of the presentation done at home, and is of not great quality)