Skip to main content

How to do Effective Programming?

There is no secret to doing effective programming but following a sequence of steps and procedures can help in building great programs. Today I will take you on a tour to some of the best practices that are integrants of perfect programs.

Algorithms are important: - You can’t deny the fact that algorithms are important and before start to write any program, Algorithms are must to write. For example, if there is a program about finding the sum of two numbers? What will you write ?The steps can be :-

1)  Get the first number.
2)  Get the second number.
3)  Add both numbers.

This is what algorithm is writing about ,a list of statements .From the above three statements you can conclude boundary cases (at least two number should be there in input), mathematical function(Sum is needed here) , storage capacity(amount of memory to be assign to the variables), number of methods by analyzing repeat steps (reduce replete codes) and many other things. During algorithm only you can build a solid idea about how your code will work and where it will fail. You can handle exceptions and many other things. Writing in simple language will help in starting up. Even for small programs please write an algo.

Pseudo Codes are the base of a program: - This is different from algorithms. Once you define everything on paper, you are ready to write pseudo code. Do not think about syntax in this step, just start writing your code for example:-

Input:-( You can define boundaries like A & B >0 or A & B is must and present , A & B can’t be decimals or any other thing)


This will be enough , it is important to note down what is coming and what is going? In middle everything is programming.

Input -> do some stuffs -> Output

Programming language is a material for the program:- Once you have written a code you can go for choosing a programming language that suits your problem statement. It can be based on memory , based on syntax , based on technical skill or based on anything. For example, if you choose java.You should know how java works and what is correct syntax.

Test Cases is like painting a program so that it looks better:-
Once Program is written in any of the language , next step is to check for the right results. If there is a bug for half of the test cases and for half it is working there is no use. If a program is working independently but not as a combined again there is no use.

The best technique to finish up your program is running through it with several test cases. Think about all the scenarios... where the program is in use  and run every corner of it. Whether it is about checking with some odd values or checking it with an infinite list of values.

See where it is breaking ? how much time it is taking to solve the problem? Where it is fast ? where it is slow? Which kind of situation is it favoring? where it is not? For me, this is the most sensitive steps that need to take care of with focus.

If you find any improvement go back to the first step and repeat until you get the best solution.

Hope you find a good answer from above notes, in the case of any doubt please drop me a comment .You can also follow to this website for other tutorials and future tips.



Popular posts from this blog

5 books that your college doesn’t tell to read seriously for PLACEMENTS

1.               Let us C - It can be the best book to pick in your first semester itself. The book is written in a very simple style so you can easily grasp most of the concepts of programming by just working hard on it. It will help you in building basics of programming around c language. 2.               HEAD FIRST JAVA- This book you should buy in third semester and invest your whole second year into it by working on all the codes. This book will help you teaching the concepts in a very attractive way. You will never bore while working  through this book. 3.               Data Structure Made Easy In Java - As soon you finished studying core java in the 4 th semester just pick this book to understand the logic’s of data structure and algorithms. It will help you to go deep inside this subject from which questions are frequently asked in all the interviews. This book carries a great set of problems that will help in developing intellectual knowledge around

Shortest Path from source to Vertex :- Dijkstra Algorithm

Shortest Path from source to Vertex :- Dijkstra Algorithm:- Dijkstra  Algorithms is an algorithm use to find the shortest path from source vertex to a given vertex. package Graph ; import java.util.HashMap ; abstract public class DirectedGraph { Vertex [] vertexlist = new Vertex [ 10 ]; HashMap < Character , HashMap < Character , Integer >> edgelist = new HashMap <>(); Vertex vertex ; //count of vertex and edge static int vertexcount = 0 ; int edgecount = 0 ; /* * This function takes a label and insert in the vertex list as well as edge list since it is new vertex it will add * null to its adjoining vertices */ int addVertex ( char label ) { vertex = new Vertex ( label ); vertexlist [ vertexcount ]= vertex ; System . out . println ( vertexlist [ vertexcount ]. label ); edgelist . put ( vertex . label , null ); vertexcount ++; return vertexcount ; } int addEdge ( char label , char []