Code Nirvana

Introduction to Date, Time and Calendar in Java

2015-02-05T14:44:00.000+05:30

By far managing time is the largest art humanity has wanted to achieve. Let’s at least learn to manage them in the virtual world. If you know the basics of Java, it’s high Time you learn it!

Introduction to Date

Ok, so let’s start with the Date class, The Date class encapsulates the current system time and date.
To, get an instance of Date we have to use wither of its constructors mentioned below:

Date();
Date(long milliseconds)

The first one initializes the Date object with current date and time, whereas the second one initializes the date object with the number of millisecond specified which has elapsed after 1st January, 1970.

Let’s understand more by using below code:

import java.util.Date;
class DateExample{
 public static void main(String h[]){
  Date dt=new Date();//get instance
  System.out.println(dt);
  long msec=dt.getTime();
  System.out.println(msec);
 }
}

Output on the date of writing will be:
Thu Oct 23 16:31:25 IST 2014
1414062085858

First of all, as you can see I have imported java.util.Date class, that means that Date class resides in java.util package, the other classes we are going to work with will also be a part of this package. I have used a method in the code called getTime() which returns a long type value holding the number of millisecond expired after January 1, 1970.

Let’s try some other functions of Date class, with this code:

import java.util.Date;
class DateExample{
 public static void main(String h[]){
  Date dt=new Date();
  long m=299999999;
  Date dt1=new Date(m);
  Date dt2=new Date(40);
  System.out.println("current time:"+dt.getTime());
  if(dt.before(dt1))
   System.out.println("BEFORE");
  else
   System.out.println("AFTER");
  if(dt.after(dt2))
   System.out.println("AFTER");
  else
   System.out.println("BEFORE"); 
  
 }
}

Output:
current time:1414064118988
AFTER
AFTER

So what does this methods after(Date date) and before(Date date) with return type Boolean does?As the name suggests after returns true if the invoking date objects holds a greater value than the value supplied. The other unction before(Date date) does just the opposite. For dummies to understand clearly, it returns true if the invoking date object holds a date value earlier than the supplied one.

Some other Date functions are given below:

int compareTo(Date date)
Returns 0 if the value of supplied object and the invoking object is equal, negative if the value of invoking object is lesser than the supplied object, returns positive if the invoking object is earlier than the supplied one.

int hashCode()
Will return a hash code for the invoking Date object.

void setTime(long time)
Sets time according to milliseconds elapsed after January 1,1970.

String toString()
Returns a String for the invoking object.

Introduction to Calendar

As you see it’s a lot problematic to get desired components of time from Date, like if you just wanna work with the hour, or just with the month etc. Date will upset you. But don’t worry its Calendar on rescue.

Calendar is an abstract class which provides lots of method and constants to easily work with components of date and time.

So, how can we get components, look at the code below:

import java.util.Calendar;
class Experiments{
  public static void main(String args[]){
      Calendar cal=Calendar.getInstance();//to get an instance of Calendar
      String months[]={ "January","February","March","April",
           "May", "June", "July","August",
           "September", "October","November", "December" };
      //months array declared to get the required string for month
      //For date
      System.out.println("Date:");
      System.out.println( cal.get(Calendar.DATE) + "/"
           + months[cal.get(Calendar.MONTH)] + "/"
           + cal.get(Calendar.YEAR)
           );
      //for time
      System.out.println("TIME:");
      System.out.println(cal.get( Calendar.HOUR) + ":"
             + cal.get(Calendar.MINUTE) + ":"
             + cal.get(Calendar.SECOND)+":"
             + cal.get(Calendar.MILLISECOND)
             );
  }
}

Output:

So how does it works, the get(int value), function fetches the correct component of time, as according to the constant integer value supplied. Calendar defines a lot of constant values, in the code I have used the important ones, DATE, MONTH, YEAR, HOUR, MINUT, SECOND, MILLISECOND. I think they are self explanatory. One more thing, why did I initialized an array and used it to get the month, because when returning month, Calendar returns an integer value ranging from 0 to 11. 0 for January and 11 for December. So, anyone can customize the values in the array and get represent a month in a different way [like ‘Jan’ instead of ‘January’].

Conclusion

Well, now you know about handling dates and time in Java. Practice it, play with the functions, also for more reference read the official documentation. If you like this content please share on Facebook, and follow us on Twitter. Also don’t forget to subscribe for regular updates. Keep Coding!

AWESOME v3 Responsive Blogger Template

2014-12-31T20:37:00.000+05:30

Awesome Blogger Template series is back with its third and probably the last version. This time we are publishing this premium template for free without any encrypted or hidden scripts!

DEMO Download

Features

- Responsive Design
- No Encrypted Script
- SEO Ready
- Fast Loading
- Unlimited Color Options
- Responsive Social Sharing Widget
Other: Author bio, Emoticon in comments, No Rich Snippets error, YouTube inspired Loading bar, Bouncing Back To Top, Custom 404, Improved Admin Layout, Footer widgets, Admin comment highlighted with 'MOD' and much more.

Installation and Customizations

Installing: Copy all the code in downloaded .xml file and directly paste into your blog HTML (Template->Edit HTML).
Note: Make sure to take backup of your previous template.

Change Template Color

Open Template section from the left side menu and click Customise button(Template->Customise).
In your Blogger Template Designer Panel switch to Advanced Tab change the Main Color.

Chose your color and click Apply to Blog.

Edit All Social Links

Open template HTML(Template->Edit HTML) click anywhere inside code and search(ctrl+F) for "awesomev3" and update all the links found. A comment is present at the top, for your convenience.

Edit Menu Bar Elements

Search for "Edit Menu" in your HTML and edit/modify template menu.

Edit Author Bio and Meta Tags

Again in your template HTML search for "Edit This" and add your data.

Edit Featured Items

In your blog Layout edit Featured Post widget and add your featured items like: (img)

Note: Just add <li> at front and </li> at the end of your featured line.

Liked AWESOME v3 Blogger Template?

If you liked this template please follow us at Facebook, Twitter and Google+.

Also share this with your friends if they are looking for a cool, seo friendly and responsive template without paying for premium version.

Why Use Should Use Awesome v3

As we said this template don't have any hidden script which most of the free blogger templates have which ultimately affects your SEO. So use this template without worrying about SEO related issues.

Also check Awesome v2 if you want post thumbnails and advance search widget.

For Awesome v3 support contact us at: admin(at)codenirvana.in

JustMe Personal Blogger Template

2014-10-29T16:07:00.000+05:30

JustMe is a personal blogger template which can be used as a landing page for your personal domain like yourname.me etc. Its clean and easy to install blogger template.

DEMO

Features

Background Color Effect
Typewriter Effect
Fast Loading
Easy To Install
20 Social Icons
Compressed JS & CSS
No Hidden Script/Link

Screenshot

Download Template

Template Customizations

All the customizations for JustMe blogger template are done at the Layout Page.

Changing Your Name

Edit the Header widget and in the Blog Title block enter name you want to be displayed.

Changing Your Info | Typewriter Text

Edit the Header widget and in the Blog Description block add your skills/interest/info separated by a comma ',' .

Note: Don't add image in Header widget.

Adding Social Icons

Edit the Social Icons widget and visit HERE http://cnir.xyz/slIwcr to generate all the required HTML for your Social Icons widget.
Using The Tool:
- Choose the social site you want from the dropdown menu and add your respective URL.
- Click on 'Add More' to add more social icons.
- Click on 'Get Code!' to generate the HTML code.
- Copy paste the code into your Social Icons widget.

Note: Don't forget to add http:// in URL

Conclusion

JustMe blogger template is just a landing page for your personal blog or upcoming project. If you liked this free template then please like,share and comment on this post. Also check our Awesome Blogger Template available in 10 cool colors.

Java Program to Count Number of Words in a String

2014-09-28T18:26:00.000+05:30

Counting the number of words, lines etc are the most asked question in schools and collages and most of the students memorises the same concept which is written in the book or class notes but the real fun is in doing the same thing with many different ways, building our own logic and learning the new short-cuts, So In this post we will tell some different ways by which you can count the number of words present in a string and some cool short-cuts to make your code simple and clean!

Logic

When we are asked to count the number of words in an sentence then what we do is search the white spaces and do our counting because the white space tells us where the previous words ended and the next word will start after it. So our most basic approach for counting the the words while programming is search the white spaces and increment the counter.

Working With Logic
According to the above logic we created a function which will return the number of words present in the string argument passed to it, have a look.

static int countWords(String s){
        int c=0;
        s=s+" ";
        for(int i=0; i<s.length(); i++){
            if( (""+s.charAt(i)).equals(" ") ){
                c++; 
            }
        }
        return c;
    }

Above function is working great and follows our logic as well (really?).
What it does is count the number of spaces in a string and return the count. but

If our string is like this " This is a String ". Having extra space at the beginning and ending then?
To correct this bug we have to use trim() function at line 3 and make it like this:
s = s.trim() + " ";

So problem solved? Lets see

If the entered string is written by a genius like you than the above logic will work for you because we know every word is separated by a single space but lets say you are reading the string from an text file and that file have strings like this " Hello Java Programmer !" means a lots of spacing between words than this logic will completely fails!

Fixing The Bug
So, the above code can be fixed if we look for the words not just counting the occurrence of spaces.
And what we have to do is also read the next character to the space for checking whether the next word actually started or not!
Look at the final source code given below.

Source Code

class wordsCount {
    static int countWords(String s){
        int c=0;    //counting variable
        s=s.trim(); //removing extra spaces from begining and ending
        if(s.equals("")){
            return 0; //String is emply
        } else{
            s+=" "; //adding extra space for counting the last word
        }
        for(int i=0; i<s.length(); i++){
            if( (""+s.charAt(i)).equals(" ") ){ //if char is space
                
                if( i<s.length()-1 && (""+s.charAt(i+1)).equals(" ") ){ //also checking the next index
                    continue;
                }
                
            } else{ //not space
                continue;
            }
            /* program will reach here only if the next
             * character to the space is not a space
             */
            c++; 
        }
        return c;
    }
    public static void main(String args[]){
        
        String s = "  We Love  Jave Programming! ";
        
        int count = countWords(s);

        System.out.println("Words Count: " + count);
        
    }
}

Output

Words Count: 4

Short-cut Method For Counting Words in a String

class Main1 {
    public static void main(String args[]){
        
        String s = "Code Nirvana Rocks";
        
        int count = s.trim().split(" ").length; //that's it!

        System.out.println("Words Count: " + count);
        
    }
}

Conclusion

So the long discussion on counting the number of words finally comes to an end :)
The short-cut method is great but will not work if your words are spaced my more than one white spaces.
So its your choice which code is suitable for your program and if you know any other method for counting the words of a string then do share with us, we really want to hear from you.

If you like this post than please like and share this with your friends and you can subscribe to our newsletter to get updated with our latest post on programming.

Java Program to Find Frequency of Characters in a String

2014-09-27T16:21:00.000+05:30

Finding characters frequency of a String means calculating the occurrence of each alphabet present in the string. Since there's no pre-build function present in Java for calculating the occurrence of the characters or alphabets so, we have to write a program which will give the frequency of characters present in the string. Let's get started.

Logic: Characters Frequency in a String

First we have take an integer array of size 26 having all its elements equal to zero.
Than we have to traverse the string 26 times in search of all the 26 alphabets one by one.
If the string character matches to the searching alphabet than we have to increment the value stored at that particular index of int array by 1.

confused? have a look at the source code given below.

Source Code

class CharFrequency {
    static int[] charFreq(String s){
        s=s.toLowerCase();  //convert to lowercase alphabets
        int freq[]=new int[26]; //array for counting freq of all alphabets
        
        for(int i=0,c=97; i<26; i++,c++){
            for(int j=0; j<s.length(); j++){
                char ch=s.charAt(j); //traversing the string
                if(ch==c) //checking string for 'a' i.e 97 then 'b' i.e 98 and so on
                    freq[i]++; //increasing count of those aplhabets which are present in the string
            }
        }
        return freq;    //returning array having freq of alphabests present in String s
    }
    public static void main(String args[]){

        String s = "Java Programming";
        
        //Getting the frequency
        int freq[]=charFreq(s);
        
        //printing the output
        System.out.println("Alphabet\tFrequency");
        for(int i=0,c=97; i<26; i++,c++){
            if(freq[i]!=0){ //alphabet having freq > 0
                char ch = (char) c;
                System.out.println(ch+"\t\t"+freq[i]);
            }
        }
    }
}

Output

Explanation

This is the most basic approach for finding the characters frequency.
Here we made a function named charFreq which takes the string as an argument and returns an array of integers which have the calculated frequency of all the alphabets present in the input string.
Firstly we converted the entire string to lower-case characters for the further operations and defined an integer array freq[] of size 26 (default value of all the elements in an integer array is zero).
Then as mentioned in the Logic above we have to traverse the string 26 times for each and every character on by one. Here we are taking alphabets as 97, 98, 99 and so on which is the ascii value of lower-case alphabets. when the string character matches with our searching alphabet then we increase the value at that index in an array freq[i]++. Finally at the end the function returns an array of integers having the frequency of characters.

Using the Function: int array[] = charFreq( "you string here" );

Extracting value from array: array[ index_between_1_to_26 ]
e.g array[2] will give the occurrence of 'c'

Conclusion

There are many other logics by which we can perform the same task, above logic is the most simple approach for finding the character frequency of a string. You may try your own logic and do share with us!
If you like this post please like and share with your friends and feel free to coment if you have any queries related to this program.

Finding Length of the String without using inbuilt Java methods

2014-09-26T11:30:00.000+05:30

Java is always preferred due to its inbuilt methods and packages which makes our task easier, but what if we are asked to do some task without using any particular inbuilt functions or methods.... So today on the demand of our visitors I am sharing my code to find the length of the String without using the length() method.

Introduction

The length of the String is the number of characters including white spaces in the string.
Java provides length() method which is used all the time to calculate the string length.
e.g:
String S= " Java Length Method "
int length= S.length();

Calculating String Length Without Using Inbuilt Methods

So now we are going to perform same task without using the length built-in method.

Logic and Explanation

We will create an static int function named strlen having one parameter which stores our source string and returns the calculated length of the string.
In the function body we used one integer variable len having its initial value 0. later we are using the try-catch block to perform the further operation ( you will get why its needed very soon)
Inside try block we have a while loop which will run infinitely (seriously?).
While loop body have charAt( len ) method which is used to traverse the string as an Array for the index len, and we are incrementing integer variable len after that.
When the string completes, then <string>.charAt() will throw an exception as array index out of range exception, Which is caught by the catch block which will do nothing (catch don't return anything) and the program will get-out from the try-catch block and returns the length of the string stored in the len.
e.g s="Hello"
the charAt(len) will work till the len<=4 but when the len is 5 the charAt() will throws an exception.

Source Code

class StringLength {
    static  int strlen( String s ){
       int len=0;
       try{
           while(true){
               //traversing and counting
               s.charAt( len );
               len++;
           }
       } catch(Exception e){
           //Out of bounds
       }
        return len;
    }
    public static void main(String Args[]) {
        String text="Java String Length Function";
        System.out.println( "Length of String is " + strlen(text) );
    }
}

Conclusion

Finally we have the total length of the String return from the strlen function. Hope you got what's our approach on calculating the string length. If you have any problem in understanding the code or the logic, feel free to ask your problem the comment section below!
Please like and share this post and also subscribe to our newsletter to get our latest post directly into your mailbox.

TCS CodeVita 2014 Problems - Round 2

2014-09-05T12:00:00.000+05:30

In our previous post we shared TCS coding contest CodeVita's Round-1 Problems. If you didn't check that, than first go thorough CodeVita 2014 Round-1.

CodeVita Round-2 Problems

A : Valid Segments 2

Consider text comprised of sentences and sentences comprised of words. Words in a sentence will be space delimited. Text will comprise of two types of words, viz. alpha words and beta words. Alpha words are denoted in the input. All words in the text which are non-alpha words are beta words. Task is to find out the number of valid segment with number of beta words in the given range [lb, ub].

A segment is said to be valid if
- It contains all the K-strings
- It should start and end with any one of the K-strings

Input Format:
First line contains the text. Next line contains K, lb, ub. Next K lines consist of alpha words in the text.

Note:
1. String comparison should be case insensitive.
2. String comparison should be based only on words comprised of alphabets. Non-alphabet characters such as Full Stop ("."), Exclamation Marks ("!") etc. are called as Stop words. Stop words must be removed from sentences before comparison.
3. If more than one segment starts with the same index (i.e. position of the word in the text), then consider the shortest segment. In other words, segments should begin from unique indexes.

Output Format:
Print the number of valid segments with number of beta words in the given range [lb, ub].

Constraints:
1<= total number of words in the text <= 30,000
1<= length of alpha and beta words <= 500
1<=K<=total number of alpha words
1<=lb<=ub<=total number of beta words

Sample Input and Output

SNo.	Input	Output
1	The European market crashes on Mondays. Crashes in the European market are quite common. 2 3 4 European Crashes	1

Explanation:
Valid segments are:
European market crashes
crashes on Mondays. Crashes in the European
Crashes in the European

There is only one valid segment with number of beta words in the range [3, 4], which is segment 2.

B : Close Strings

A is the square matrix of size N. Every entry in the matrix will contain a lower case alphabet. Given Z strings, for each string your task is to find out the closest square-matrix starting from (1, 1). Closeness between the sub-matrix and the string is defined as, number of similar characters between the two. The input is guaranteed to have at least one character that is same in string Zi and matrix A, where Zi is the ith string. The same cell in the sub-matrix of A cannot be counted more than once to match with the character in the S.

Input Format:
First line of input will consist of T Test cases. Each test case will consist of four parts, viz.
1. Size of the matrix (N)
2. The matrix itself (A = N * N) where elements are delimited by space.
3. Number of Strings (Z)
4. Z lines each comprising of string S

Output Format:
For every string print the bottom right co-ordinates of the square-matrix closest from (1, 1).

Constraints:
1<=T<=5
1<=N<=500
'a'<=Aij<='z', where Aij is the entry of the matrix at ith row and jth column(1-index based).
1<=Z<=25000
1<=|S|<=500

Sample Input and Output

SNo.	Input	Output
1	1 4 a e r d p l x l l p x z c q x o 3 apple alex aero	3 3 3 3 4 4

Explanation:
String S: "apple"
Sub matrix: (1, 1) to (3, 3)
a e r
p l x
l p x
Sub matrix contains all characters of string S, hence the output

C : Employee DB Design

Given a list of unique employee ids and their age information, your task is to design a program to support the certain operations. Broadly speaking there are two operations, Insert and Query. You can assume that insert operations are unique on the employee_id column. Query operations are of 3 types. Both insert and query operations are described below.

1. A {employee_id} {age}
Operation will add the employee_id and age.
Syntax: A {employee_id} {age}
Returns: None

2. Q 1 {employee_id}
Query will search for the records whose employee id is {user_employee_id}.
Syntax: Q 1 {employee_id}
Returns: Boolean (True or False)

3. Q 2 {employee_id}
Query will search for the records whose employee id starts with {user_employee_id}.
Syntax: Q 2 {employee_id}
Returns: Total count of the records which matches the search criteria.

4. Q 3 {employee_id} {lb} {ub}
Query will search for the records for which employee id starts with {user_employee_id} and age is in the range (lb, ub).
Syntax: Q 3 {employee_id} {lb} {ub}
Returns: Total count of the records which matches the search criteria.

Input Format:
Every input line consists of either Add (A) or Query (Q) operation. -1 represents the end of input.

Output Format:
Print the total number of resultant records in case of Query operation.

Constraints:
1 <= Total digits in the Employee ID <= 50
20 <= Age <= 100
10 <=lb<= 100, where lb is a multiple of 10.
lb <=ub<= 100, where ub is a multiple of 10.
Total number of add operations <= 40000
Total number of query operations <= 40000

Sample Input and Output

SNo.	Input	Output
1	A 112345 20 A 112346 40 A 212347 40 A 212348 23 A 112449 30 Q 1 112345 Q 2 1123 Q 3 112 10 50 -1	True 2 3

NOTE:
Minimum time required for evaluating this program is 24 seconds. Please be patient. Request you to wait up to a few minutes before resubmitting the same solution.

D : Employee Hierarchy

Adam is working in a large hierarchical organization, where every employee, except the CEO, is either a supervisor or a sub-ordinate or both. Every employee will be identified by Employee ID. CEO of the company has 1 as his employee id. Every employee will get the salary (S) in accordance with their level and their performance. Given the data about the all the above mentioned details, your task is to find out the number of sub-ordinates with salary less than Adam.

Note:
1. If an employee appears at two different levels, then consider the level which is near (best) to the CEO.
2. An employee is considered as sub-ordinate, if Adam is a direct or indirect supervisor to the said employee.

Input Format:
Input consists of three parts, viz.
1. First Line contains, number of employees (N), number of supervisor-subordinate relationships (M) and Adam's employee id (A)
2. Next M lines follow, each line contains two employee Ids I, J which represents that I is a supervisor of J.
3. Salaries of N employees, delimited by space

Output Format:
Print the total number of employees who are sub-ordinates to Adam and have salary less than Adam's.

Constraints:
1<=N<=50
1<=M<=1000
1<=I, J<=N
1<=S<=50000

Sample Input and Output

SNo.	Input	Output
1	5 5 2 1 2 2 3 2 4 4 5 5 3 1500 2000 1500 2500 1800	2

E : Close Friends

K friends came to the city and they are in search of some nice flats to stay. At most they can spend T Rupees for the accommodation. Finally they came to know about Marika Apartments, where there exist N empty flats, and every flat owner is allowing at-most Pj persons to stay in a jth flat. So finally they have decided to stay in the multiple flats, at the same time they would like to stay in such flats in which every person from the K person group should able to reach the other K-1 friends who are actually staying either in the same flat or in the other flat.

Let Rj define the rent of the jth flat. One of the major problem in the apartment is only few flats are reachable from the other and one can take the advantage of one flat to reach the other in an indirect way. Now having all the above information your task is to help K friends to know how many options are available for them to stay.

Input Format:
Input consists of four parts, viz.
First Line contains, number of friends (K), number of flats (N) and total paying capacity (T)
Next N lines contain N spaced integers, which represents the connectivity between the N flats. The connectivity between the flats are directional in nature and if Jth flat is reachable from Ith flat then it will be marked as 1
Next line contains N spaced integers Pj, each represents the maximum allowed persons in the jth flat.
Last line contains N spaced integers Rj, each represents the rent of the jth flat.

Output Format:
Print the number of options i.e. number of different ways in which K friends can have their space and stay connected too.

Constraints:
1<=K<=100
1<=N<=500
1<=T<=10 ^ 6
1<=Rj<=5000
1<=Pj<=100

Sample Input and Output

SNo.	Input	Output
1	5 4 10000 0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 1 5 4 3 2 2000 1500 1500 2500	1
2	13 4 10000 0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 1 5 4 3 2 2000 1500 1500 2500	0

F : Cyclic Palindrome

A string is said to be palindrome, if it reads the same from both the ends. Given a string S, you are allowed to perform cyclic shifts. More formally, you can pick any one character from any end (head or tail) and you can append that character at the other end. For example, if the string is "abc", then if we do a shift using the character at head position then the string becomes "bca". Similarly, if we do the shift using the character at the tail then the input string becomes "cab". Your task is to find out the minimum number of shifts needed to make the given string, a palindrome. In case, we can't convert the string to palindrome then print -1.

Input Format:
First line starts with T i.e. number of test cases, and then T lines will follow each containing a string "S".

Output Format:
Print the minimum number of cyclic shifts for each string if it can be made a palindrome, else -1.

Constraints:
1<=T<=100
1<=|S|<=300, S will contains only lower case alphabets ('a'-'z').

Sample Input and Output

SNo.	Input	Output
1	4 abbb aaabb aabb abc	-1 1 1 -1

Explanation:
For Test Case 2 (aaabb):
Shift the character at the tail to the head and the result will be "baaab", which is a palindrome. This is an operation which requires minimum number of shifts to make the given string a palindrome.

For Test Case 3 (aabb):
One way to convert the given string to palindrome is, shift the character at the head to the tail, and the result will be "abba", which is a palindrome. Another way is to shift the character at the tail to the head, and the result will be "baab", which is also a palindrome. Both require only one shift.

Important Note:
Please do not use package and namespace in your code. For object oriented languages your code should be written in one class.
Participants submitting solutions in C language should not use functions from <conio.h> / <process.h> as these files do not exist in gcc

CodeVita 2014 Problems - Round 1

Happy Coding!

TCS CodeVita 2014 Problems - Round 1

2014-09-04T09:56:00.000+05:30

CodeVita coding contest from Tata Consultancy Services (TCS) lets you pit your skills against contestants around the globe.
Students from India, New Zealand, Australia, South Africa, Peru, Mexico, Colombia, and Uruguay are participating this year in CodeVita 2014.

Round 1 and Round 2 is completed and top 5% coders from Round 2 will participate in Round 3.

CodeVita Round-1 Problems

A : Super ASCII String Checker

In the Byteland country a string "S" is said to super ascii string if and only if count of each character in the string is equal to its ascii value.

In the Byteland country ascii code of 'a' is 1, 'b' is 2 ...'z' is 26.

Your task is to find out whether the given string is a super ascii string or not.

Input Format:
First line contains number of test cases T, followed by T lines, each containing a string "S".

Output Format:
For each test case print "Yes" if the String "S" is super ascii, else print "No"

Constraints:
1<=T<=100
1<=|S|<=400, S will contains only lower case alphabets ('a'-'z').

Sample Input and Output

SNo.	Input	Output
1	2 bba scca	Yes No

Explanation:
In case 1, viz. String "bba" -
The count of character 'b' is 2. Ascii value of 'b' is also 2.
The count of character 'a' is 1. Ascii value of 'a' is also 1.
Hence string "bba" is super ascii.

B : Problem : Zombie World

Zoya has developed a new game called Zombie World. The objective of the game is to kill all zombies in given amount of time. More formally,
- N represents the total number of zombies in the current level
- T represents the maximum time allowed for the current level
- P represents the initial energy level a player starts with
- Ei defines the energy of the i-th zombie
- D defines the minimum energy the player needs, to advance to the next level

When a player energy is greater than or equal to the i-th zombie's energy, the player wins. Upon winning, the player will be awarded with an additional energy equal to the difference between current zombie energy and the player energy.
One unit of time will be taken to complete the fight with a single zombie.

Rules of the game:-
- At any given time, a player can fight with only one zombie
- Player is allowed to choose any one zombie to fight with.

Your task is to determine whether the player will advance to the next level or not, if he plays optimally.

Input Format:
The first line contains the number of test cases (K)

Each test case consists of three parts:
1. The total number of zombies (N) and the maximum time allowed (T)
2. Array of size N, which represents the energy of zombies (E)
3. The initial energy level a player (P) and the minimum energy required to advance (D)

Output Format:
Print "Yes" if a player can advance to the next level else print "No".

Constraints:
1<=K<=10
1<=N<=50
1<=Ei<=500
1<=T<=100
1<=D<=2000
1<=P<=500

Sample Input and Output

SNo.	Input	Output
1	1 2 3 4 5 5 7	Yes

C : Stone Game - One Four

Alice and Bob are playing a game called "Stone Game". Stone game is a two-player game. Let N be the total number of stones. In each turn, a player can remove either one stone or four stones. The player who picks the last stone, wins. They follow the "Ladies First" norm. Hence Alice is always the one to make the first move. Your task is to find out whether Alice can win, if both play the game optimally.

Input Format:
First line starts with T, which is the number of test cases. Each test case will contain N number of stones.

Output Format:
Print "Yes" in the case Alice wins, else print "No".

Constraints:
1<=T<=1000
1<=N<=10000

Sample Input and Output

SNo.	Input	Output
1	3 1 6 7	Yes Yes No

D : Trace the Rats

Given a square maze (A) of dimension N, every entry (Aij) in the maze is either an open cell 'O' or a wall 'X'. A rat can travel to its adjacent locations (left, right, top and bottom), but to reach a cell, it must be open. Given the locations of R rats, can you find out whether all the rats can reach others or not?

Input Format:
Input will consist of three parts, viz.

1. Size of the maze (N)
2. The maze itself (A = N * N)
3. Number of rats (R)
4. Location of R rats (Xi, Yi)

Note:
(Xi,Yi) will represents the location of the i-th rat.
Locations are 1-index based.

Output Format:
Print "Yes" if the rats can reach each other, else print "No"

Constraints:
1<=N<=350
Aij = {'O','X'}
1<=R<=N*N
1<=Xi<=N
1<=Yi<=N

Sample Input and Output

SNo.	Input	Output
1	3 O O X O X O O O X 4 1 1 1 2 2 1 3 2	Yes
2	3 O O X O X O O O X 4 1 1 1 2 2 1 2 3	No

E : Online Communities - Even Groups

In a social network, online communities refer to the group of people with an interest towards the same topic. People connect with each other in a social network. A connection between Person I and Person J is represented as C I J. When two persons belonging to different communities connect, the net effect is merger of both communities which I and J belonged to.

We are only interested in finding out the communities with the member count being an even number. Your task is to find out those communities.

Input Format:
Input will consist of three parts, viz.

1. The total number of people on the social network (N)
2.Queries
C I J, connect I and J
Q 0 0, print the number of communities with even member-count
-1 will represent end of input.

Output Format:
For each query Q, output the number of communities with even member-count

Constraints:
1<=N<=10^6
1<=I, J<=N

Sample Input and Output

SNo.	Input	Output
1	5 Q 0 0 C 1 2 Q 0 0 C 2 3 Q 0 0 C 4 5 Q 0 0 -1	0 1 0 1

Explanation:
For first query there are no members in any of the groups hence answer is 0.
After C 1 2, there is a group (let's take it as G1) with 1 and 2 as members hence total count at this moment is 1.
After C 2 3 total members in G1 will become {1, 2, 3} hence there are no groups with even count.
After C 4 5 there formed a new group G2 with {4, 5} as members, hence the total groups with even count is 1.

F : Matrix Rotations

You are given a square matrix of dimension N. Let this matrix be called A. Your task is to rotate A in clockwise direction by S degrees, where S is angle of rotation. On the matrix, there will be 3 types of operations viz.
1. Rotation
Rotate the matrix A by angle S, presented as input in form of A S
2. Querying
Query the element at row K and column L, presented as input in form of Q K L
3. Updation
Update the element at row X and column Y with value Z, presented as input in form of U X Y Z

Print the output of individual operations as depicted in Output Specification

Input Format:
Input will consist of three parts, viz.
1. Size of the matrix (N)
2. The matrix itself (A = N * N)
3. Various operations on the matrix, one operation on each line. (Beginning either with A, Q or U)

-1 will represent end of input.

Note:
Angle of rotation will always be multiples of 90 degrees only.
All Update operations happen only on the initial matrix. After update all the previous rotations have to be applied on the updated matrix

Output Format:
For each Query operation print the element present at K-L location of the matrix in its current state.

Constraints:
1<=N<=1000
1<=Aij<=1000
0<=S<=160000
1<=K, L<=N
1<=Q<=100000

Sample Input and Output

SNo.	Input	Output
1	2 1 2 3 4 A 90 Q 1 1 Q 1 2 A 90 Q 1 1 U 1 1 6 Q 2 2 -1	3 1 4 6

Explanation:

Initial Matrix

1 2
3 4
After 90 degree rotation, the matrix will become
3 1
4 2
Now the element at A11 is 3 and A12 is 1.
Again the angle of rotation is 90 degree, now after the rotation the matrix will become
4 3
2 1
Now the element at A11 is 4.
As the next operation is Update, update initial matrix i.e.
6 2
3 4
After updating, apply all the previous rotations (i.e. 180 = two 90 degree rotations).
The matrix will now become
4 3
2 6
Now A22 is 6.

G : Compiler Design - Limit the Method Instructions

Raj is a newbie to the programming and while learning the programming language he came to know the following rules:
- Each program must start with '{' and end with '}'.
- Each program must contain only one main function. Main function must start with '<' and end with '>'.
- A program may or may not contain user defined function(s). There is no limitation on the number of user defined functions in the program. User defined function must start with '(' and end with ')'.
- Loops are allowed only inside the functions (this function can be either main function or user defined function(s)). Every loop must start with '{' and end with '}'.
- User defined function(s) are not allowed to be defined inside main function or other user defined function(s).
- Nested loops are allowed.
- Instructions can be anywhere inside the program.
- Number of instructions inside any user defined function must not be more than 100.

If any of the above conditions is not satisfied, then the program will generate compilation errors. Today Raj has written a few programs, but he is not sure about the correctness of the programs. Your task is to help him to find out whether his program will compile without any errors or not.

Input Format:
First line starts with T, number of test cases. Each test case will contain a single line L, where L is a program written by Raj.

Output Format:
Print "No Compilation Errors" if there are no compilation errors, else print "Compilation Errors".

Constraints:
1<=T<=100
L is a text and can be composed of any of the characters {, }, (, ), <, >and P, where P will represents the instruction.
L, comprised of characters mentioned above should be single spaced delimited.
Number of characters in the text, |L| < = 10000

Sample Input and Output

SNo.	Input	Output
1	3 { < > ( P ) } { < { } > ( { } ) ) { ( { } ) }	No Compilation Errors Compilation Errors Compilation Errors

Important Note:
Please do not use package and namespace in your code. For object oriented languages your code should be written in one class.
Participants submitting solutions in C language should not use functions from <conio.h> / <process.h> as these files do not exist in gcc

CodeVita 2014 Problems - Round 2

Happy Coding!

Top 10 Movies for Programmers

2014-08-25T23:51:00.000+05:30

The following movies are stimulating to watch for those with a programming oriented mind. Since its hard to find movies related to programming, computers or coding.... we created a list of top 10 movies which every programmer, developer, geek must watch.

Top 10 Movies for Programmers

1. The Social Network

The story of Harvard student Mark Zuckerberg creates the social networking site that would become known as Facebook.

2. Pirates of Silicon Valley

History of Apple and Microsoft.

3. Jobs

The story of Steve Jobs' ascension from college dropout into one of the most revered creative entrepreneurs of the 20th century.

4. The Internship

Two salesmen whose careers have been torpedoed by the digital age find their way into a coveted internship at Google.

5. Antitrust

A computer programmer's dream job turns nightmarish when he discovers his boss has a secret and ruthless means of dispatching anti-trust problems.

6. TRON: Legacy

The son and his father ends up inside the digital world that his father designed. He meets his father's corrupted creation and a unique ally who was born inside the digital world.

7. A Beautiful Mind

After a brilliant but asocial mathematician accepts secret work in cryptography, his life takes a turn for the nightmarish.

8. Iron Man

When wealthy industrialist Tony Stark is forced to build an armored suit after a life-threatening incident, he ultimately decides to use its technology to fight against evil.

9. Hackers

A young boy is arrested by the U.S. Secret Service for writing a computer virus and is banned from using a computer until his 18th birthday.

10. The Matrix

A computer hacker learns from mysterious rebels about the true nature of his reality and his role in the war against its controllers.

So this is our top 10 recommended movies for programmers. What's your favourite? We really want to hear from you.

If you have more suggestions, please comment below and don't forget to share this list with your programmer friends.

Java Program To Reverse a String

2014-08-20T21:18:00.000+05:30

There are many ways to reverse a string in Java. A string can be reversed using StringBuffer, StringBuilder, recursion and using user defined function. So, today we will discuss various methods to reverse value of String variable in Java. Before starting I recommend you to also check how to reverse a number In Java.

Reverse String Using StringBuffer

public class strRev {
    public static void main(String args[]) {

        String strVar = "Code Nirvana Technology Blog";
        
        /* String Reverse Using StringBuffer */
        String revStr = new StringBuffer( strVar ).reverse().toString();
        
        System.out.println( "Before: " + strVar );
        System.out.println( "After: " + revStr );

    }
}

Reverse String Using StringBuilder

public class strRev {
    public static void main(String args[]) {

        String strVar = "Code Nirvana Technology Blog";
        
        /* String Reverse Using StringBuilder */
        String revStr = new StringBuilder( strVar ).reverse().toString();
        
        System.out.println( "Before: " + strVar );
        System.out.println( "After: " + revStr );

    }
}

Reverse String Using User Defined Function

public class strRev {
    public static void main(String args[]) {

        String strVar = "Code Nirvana Technology Blog";
        
        /* String Reverse Using User Defined Function */
        String revStr = revString( strVar );
        
        System.out.println( "Before: " + strVar );
        System.out.println( "After: " + revStr );

    }
    
    public static String revString(String str){
        String rev = "";
        for( int i = str.length()-1; i>=0; i-- ){
            rev = rev + str.charAt(i);
        }
        return rev;
    }
}

Reverse String Using Recursion

public class strRev {
    public static void main(String args[]) {

        String strVar = "Code Nirvana Technology Blog";
        
        /* String Reverse Using Recursion */
        String revStr = revString( strVar );
        
        System.out.println( "Before: " + strVar );
        System.out.println( "After: " + revStr );

    }
    
    public static String revString(String str) {
        if (str.length()<2) {
            return str; 
        }
        return revString(str.substring(1)) + str.charAt(0);
    }
}

More About Recursion: Programs Using Recursion

Output

All In One Java Program To Reverse a String

//Java Program To Reverse a String
//Author: http://www.codenirvana.in/

public class StringReverse {

    public static void main(String args[]) {
        
        String input = "Java Programming is Awesome";
        System.out.println( "Input: " + input + "\n" );
        
        /* String Reverse Using StringBuffer */
        String rev1 = new StringBuffer( input ).reverse().toString();
        
        /* String Reverse Using StringBuilder */
        String rev2 = new StringBuilder( input ).reverse().toString();
        
        /* String Reverse Using User Defined Function */
        String rev3 = revString( input );
        
        /* String Reverse Using Recursion */
        String rev4 = revString( input );
        
        //Print rev variables
        System.out.println( "StringBuffer: " + rev1 );
        System.out.println( "StringBuilder: " + rev2 );
        System.out.println( "Function: " + rev3 );
        System.out.println( "Recursion: " + rev4 );
        
    }
    //String Reverse Function
    public static String revString(String str){
        String rev = "";
        for( int i = str.length()-1; i>=0; i-- ){
            rev = rev + str.charAt(i);
        }
        return rev;
    }
    //String Reverse Recursion Function
    public static String revStrRecursion(String str) {
        if (str.length()<2) {
            return str; 
        }
        return revString(str.substring(1)) + str.charAt(0);
    }
}

Conclusion
Now you know four methods to reverse a string in Java and its one of the famous interview question on Java Programming i.e, What are the various ways you can apply to reverse a sting in Java...

Having problem? Leave your comment below and we will solve your queries as soon as possible. Don't forget to like and share this program and Subscribe to our newsletter and get free updates of latest programming articles.

Ridiculously Responsive Social Sharing Buttons For Blogger

2014-08-18T17:34:00.000+05:30

Every blogger wants to promote their articles/posts, and the best, effective, popular method for sharing content for free is social media like Facebook, Twitter etc. So today we are here with our next widget for 'Blogger' platform after JSON Search Box.

As we all know, there's very less probability that a visitor will directly copy the post link and share that on his/her social profile. So to increase the sharing rate of your blog content we are here with Ridiculously Responsive Social Sharing Buttons a.k.a RRSSB. RRSSB was developed by Daniel Box and we customize the code to let this awesome thing support Blogger platform as well. We customized this code for all the newbies and bloggers which don't have better understanding of HTML/CSS and Blogger codes.

Features
It is super flexible system that works in any container.
- SASS-powered
- Retina ready
- SVG images
- Auto-magical resizing
- Compressed Code
- Fast loading

Adding Responsive Social Sharing Buttons

Step 1: Open your Blogger dashboard and choose the blog.

Step 2: Navigate to >>Template>>Edit HTML

Step 3: Click anywhere in the code and press Ctrl+F and search for </body>

Step 4: Copy the code given below and place it above/before </body>

<script type='text/javascript'>//<![CDATA[
/* 
 *  Ridiculously Responsive Social Sharing Buttons
 *  Customized for Blogger by: Code Nirvana ( www.codenirvana.in )
 */

(function(e,t,n){"use strict";var r=function(){t(".rrssb-buttons").each(function(e){var n=t(this),r=t("li",n).length,i=100/r;t("li",n).css("width",i+"%").attr("data-initwidth",i)})},i=function(){t(".rrssb-buttons").each(function(e){var n=t(this),r=parseFloat(t(n).width()),i=t("li",n).not(".small").first().width(),s=t("li.small",n).length;i>170&&s<1?t(n).addClass("large-format"):t(n).removeClass("large-format");r<200?t(n).removeClass("small-format").addClass("tiny-format"):t(n).removeClass("tiny-format")})},s=function(){t(".rrssb-buttons").each(function(e){var n=t(this),r=0,i=0,s,o,a=t("li.small",n).length;if(a===t("li",n).length){var f=a*42,l=parseFloat(t(n).width());s=t("li.small",n).first();o=parseFloat(t(s).attr("data-size"))+55;if(f+o<l){t(n).removeClass("small-format");t("li.small",n).first().removeClass("small");u()}}else{t("li",n).not(".small").each(function(e){var n=parseFloat(t(this).attr("data-size"))+55,s=parseFloat(t(this).width());r+=s;i+=n});var c=r-i;s=t("li.small",n).first();o=parseFloat(t(s).attr("data-size"))+55;if(o<c){t(s).removeClass("small");u()}}})},o=function(e){t(".rrssb-buttons").each(function(e){var n=t(this),r=t("li",n).nextAll(),i=r.length;t(t("li",n).get().reverse()).each(function(e,r){if(t(this).hasClass("small")===!1){var i=parseFloat(t(this).attr("data-size"))+55,o=parseFloat(t(this).width());if(i>o){var a=t("li",n).not(".small").last();t(a).addClass("small");u()}}--r||s()})});e===!0&&f(u)},u=function(){t(".rrssb-buttons").each(function(e){var n=t(this),i,s,o,u,a,f=t("li.small",n).length;if(f>0&&f!==t("li",n).length){t(n).removeClass("small-format");t("li.small",n).css("width","42px");o=f*42;i=t("li",n).not(".small").length;s=100/i;a=o/i;navigator.userAgent.indexOf("Chrome")>=0||navigator.userAgent.indexOf("Safari")>=0?u="-webkit-calc("+s+"% - "+a+"px)":navigator.userAgent.indexOf("Firefox")>=0?u="-moz-calc("+s+"% - "+a+"px)":u="calc("+s+"% - "+a+"px)";t("li",n).not(".small").css("width",u)}else if(f===t("li",n).length){t(n).addClass("small-format");r()}else{t(n).removeClass("small-format");r()}});i()},a=function(){t(".rrssb-buttons").each(function(e){t(this).addClass("rrssb-"+(e+1))});r();t(".rrssb-buttons li .text").each(function(e){var n=parseFloat(t(this).width());t(this).closest("li").attr("data-size",n)});o(!0)},f=function(e){t(".rrssb-buttons li.small").removeClass("small");o();e()},l=function(t,r,i,s){var o=e.screenLeft!==n?e.screenLeft:screen.left,u=e.screenTop!==n?e.screenTop:screen.top,a=e.innerWidth?e.innerWidth:document.documentElement.clientWidth?document.documentElement.clientWidth:screen.width,f=e.innerHeight?e.innerHeight:document.documentElement.clientHeight?document.documentElement.clientHeight:screen.height,l=a/2-i/2+o,c=f/3-s/3+u,h=e.open(t,r,"scrollbars=yes, width="+i+", height="+s+", top="+c+", left="+l);e.focus&&h.focus()},c=function(){var e={};return function(t,n,r){r||(r="Don't call this twice without a uniqueId");e[r]&&clearTimeout(e[r]);e[r]=setTimeout(t,n)}}();t(".rrssb-buttons a.popup").on("click",function(e){var n=t(this);l(n.attr("href"),n.find(".text").html(),580,470);e.preventDefault()});t(e).resize(function(){f(u);c(function(){f(u)},200,"finished resizing")});t(document).ready(function(){a()})})(window,jQuery);

/* RRSSB: JavaScript Ends */
//]]></script>

Step 5: Again hit Ctrl+F and this time search for ]]></b:skin>

Step 6: Copy the CSS given below and paste it above/before ]]></b:skin>

/***********RRSS Buttons***********/

.rrssb-buttons.large-format li a,.rrssb-buttons.large-format li a .text{-webkit-backface-visibility:hidden;-moz-backface-visibility:hidden;-ms-backface-visibility:hidden}.rrssb-buttons,.rrssb-buttons li,.rrssb-buttons li a{-moz-box-sizing:border-box;box-sizing:border-box}.clearfix{*zoom:1}.clearfix:after{clear:both}.clearfix:before,.clearfix:after{content:" ";display:table}.rrssb-buttons{font-family:"Helvetica Neue",Helvetica,Arial,sans-serif;height:36px;margin:0;padding:0!important;width:100%}.rrssb-buttons li{float:left;height:100%;list-style:none;margin:0;padding:0 2.5px;line-height:13px}.rrssb-buttons li.email a{background-color:#0a88ff}.rrssb-buttons li.email a:hover{background-color:#006ed6}.rrssb-buttons li.facebook a{background-color:#306199}.rrssb-buttons li.facebook a:hover{background-color:#244872}.rrssb-buttons li.tumblr a{background-color:#32506d}.rrssb-buttons li.tumblr a:hover{background-color:#22364a}.rrssb-buttons li.linkedin a{background-color:#007bb6}.rrssb-buttons li.linkedin a:hover{background-color:#005983}.rrssb-buttons li.twitter a{background-color:#26c4f1}.rrssb-buttons li.twitter a:hover{background-color:#0eaad6}.rrssb-buttons li.googleplus a{background-color:#e93f2e}.rrssb-buttons li.googleplus a:hover{background-color:#ce2616}.rrssb-buttons li.youtube a{background-color:#df1c31}.rrssb-buttons li.youtube a:hover{background-color:#b21627}.rrssb-buttons li.reddit a{background-color:#8bbbe3}.rrssb-buttons li.reddit a:hover{background-color:#62a3d9}.rrssb-buttons li.pinterest a{background-color:#b81621}.rrssb-buttons li.pinterest a:hover{background-color:#8a1119}.rrssb-buttons li.pocket a{background-color:#ed4054}.rrssb-buttons li.pocket a:hover{background-color:#e4162d}.rrssb-buttons li.github a{background-color:#444}.rrssb-buttons li.github a:hover{background-color:#2b2b2b}.rrssb-buttons li a{background-color:#ccc;border-radius:2px;display:block;font-size:11px;font-weight:bold;height:100%;padding:11px 7px 12px 27px;position:relative;text-align:center;text-decoration:none;text-transform:uppercase;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale;width:100%;-webkit-transition:background-color 0.2s ease-in-out;-moz-transition:background-color 0.2s ease-in-out;-o-transition:background-color 0.2s ease-in-out;transition:background-color 0.2s ease-in-out}.rrssb-buttons li a .icon{display:block;height:100%;left:10px;padding-top:9px;position:absolute;top:0;width:10%}.rrssb-buttons li a .icon svg{height:17px;width:17px}.rrssb-buttons li a .icon svg path,.rrssb-buttons li a .icon svg polygon{fill:#fff}.rrssb-buttons li a .text{color:#fff}.rrssb-buttons li a:active{box-shadow:inset 1px 3px 15px 0 rgba(22,0,0,0.25)}.rrssb-buttons li.small a{padding:0}.rrssb-buttons li.small a .icon{height:100%;left:auto;margin:0 auto;overflow:hidden;position:relative;top:auto;width:100%}.rrssb-buttons li.small a .text{visibility:hidden}.rrssb-buttons.large-format{height:auto}.rrssb-buttons.large-format li{height:auto}.rrssb-buttons.large-format li a{font-size:15px;font-size:1vw;padding:7% 0% 7% 12%;border-radius:0.2em;line-height:1vw}.rrssb-buttons.large-format li a .icon{left:7%;padding-top:0;width:12%}.rrssb-buttons.large-format li a .icon svg{height:100%;width:100%}.rrssb-buttons.large-format li a .text{font-size:15px;font-size:1vw}.rrssb-buttons.large-format li a:hover{font-size:15px;font-size:1vw;padding:7% 0% 7% 12%;border-radius:0.2em}.rrssb-buttons.small-format{padding-top:5px}.rrssb-buttons.small-format li{height:80%;padding:0 1.5px}.rrssb-buttons.small-format li a .icon{height:100%;padding-top:0}.rrssb-buttons.small-format li a .icon svg{height:48%;position:relative;top:6px;width:80%}.rrssb-buttons.tiny-format{height:22px;position:relative}.rrssb-buttons.tiny-format li{padding-right:7px}.rrssb-buttons.tiny-format li a{background-color:transparent;padding:0}.rrssb-buttons.tiny-format li a .icon svg{height:70%;width:100%}.rrssb-buttons.tiny-format li a:hover,.rrssb-buttons.tiny-format li a:active{background-color:transparent}.rrssb-buttons.tiny-format li.email a .icon svg path,.rrssb-buttons.tiny-format li.email a .icon svg polygon{fill:#0a88ff}.rrssb-buttons.tiny-format li.email a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.email a .icon:hover .icon svg polygon{fill:#0054a3}.rrssb-buttons.tiny-format li.facebook a .icon svg path,.rrssb-buttons.tiny-format li.facebook a .icon svg polygon{fill:#306199}.rrssb-buttons.tiny-format li.facebook a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.facebook a .icon:hover .icon svg polygon{fill:#18304b}.rrssb-buttons.tiny-format li.tumblr a .icon svg path,.rrssb-buttons.tiny-format li.tumblr a .icon svg polygon{fill:#32506d}.rrssb-buttons.tiny-format li.tumblr a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.tumblr a .icon:hover .icon svg polygon{fill:#121d27}.rrssb-buttons.tiny-format li.linkedin a .icon svg path,.rrssb-buttons.tiny-format li.linkedin a .icon svg polygon{fill:#007bb6}.rrssb-buttons.tiny-format li.linkedin a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.linkedin a .icon:hover .icon svg polygon{fill:#003650}.rrssb-buttons.tiny-format li.twitter a .icon svg path,.rrssb-buttons.tiny-format li.twitter a .icon svg polygon{fill:#26c4f1}.rrssb-buttons.tiny-format li.twitter a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.twitter a .icon:hover .icon svg polygon{fill:#0b84a6}.rrssb-buttons.tiny-format li.googleplus a .icon svg path,.rrssb-buttons.tiny-format li.googleplus a .icon svg polygon{fill:#e93f2e}.rrssb-buttons.tiny-format li.googleplus a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.googleplus a .icon:hover .icon svg polygon{fill:#a01e11}.rrssb-buttons.tiny-format li.youtube a .icon svg path,.rrssb-buttons.tiny-format li.youtube a .icon svg polygon{fill:#df1c31}.rrssb-buttons.tiny-format li.youtube a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.youtube a .icon:hover .icon svg polygon{fill:#84111d}.rrssb-buttons.tiny-format li.reddit a .icon svg path,.rrssb-buttons.tiny-format li.reddit a .icon svg polygon{fill:#8bbbe3}.rrssb-buttons.tiny-format li.reddit a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.reddit a .icon:hover .icon svg polygon{fill:#398bcf}.rrssb-buttons.tiny-format li.pinterest a .icon svg path,.rrssb-buttons.tiny-format li.pinterest a .icon svg polygon{fill:#b81621}.rrssb-buttons.tiny-format li.pinterest a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.pinterest a .icon:hover .icon svg polygon{fill:#5d0b11}.rrssb-buttons.tiny-format li.pocket a .icon svg path,.rrssb-buttons.tiny-format li.pocket a .icon svg polygon{fill:#ed4054}.rrssb-buttons.tiny-format li.pocket a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.pocket a .icon:hover .icon svg polygon{fill:#b61124}.rrssb-buttons.tiny-format li.github a .icon svg path,.rrssb-buttons.tiny-format li.github a .icon svg polygon{fill:#444}.rrssb-buttons.tiny-format li.github a .icon:hover .icon svg path,.rrssb-buttons.tiny-format li.github a .icon:hover .icon svg polygon{fill:#111}

/***********RRSS Buttons Ends***********/

Step 7: Now you just have to add the required HTML for the buttons but be careful now this is the most important and confusing step of this tutorial i.e, to find the proper place of post footer which usually very for every blog with custom template.
So according to most of the templates, search for <data:post.body/> in your code and just below it paste the following HTML.

<ul class='rrssb-buttons'>
 <li class='email'>
  <a expr:href='&quot;mailto:?subject=Check%20out%20&quot; + data:post.title + &quot;&amp;body=Visit:%20&quot; + data:post.canonicalUrl '><span class='icon'><svg enable-background='new 0 0 28 28' height='28px' version='1.1' viewBox='0 0 28 28' width='28px' x='0px' xml:space='preserve' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' y='0px'><g><path d='M20.111 26.147c-2.336 1.051-4.361 1.401-7.125 1.401c-6.462 0-12.146-4.633-12.146-12.265 c0-7.94 5.762-14.833 14.561-14.833c6.853 0 11.8 4.7 11.8 11.252c0 5.684-3.194 9.265-7.399 9.3 c-1.829 0-3.153-0.934-3.347-2.997h-0.077c-1.208 1.986-2.96 2.997-5.023 2.997c-2.532 0-4.361-1.868-4.361-5.062 c0-4.749 3.504-9.071 9.111-9.071c1.713 0 3.7 0.4 4.6 0.973l-1.169 7.203c-0.388 2.298-0.116 3.3 1 3.4 c1.673 0 3.773-2.102 3.773-6.58c0-5.061-3.27-8.994-9.303-8.994c-5.957 0-11.175 4.673-11.175 12.1 c0 6.5 4.2 10.2 10 10.201c1.986 0 4.089-0.43 5.646-1.245L20.111 26.147z M16.646 10.1 c-0.311-0.078-0.701-0.155-1.207-0.155c-2.571 0-4.595 2.53-4.595 5.529c0 1.5 0.7 2.4 1.9 2.4 c1.441 0 2.959-1.828 3.311-4.087L16.646 10.068z'/></g></svg></span><span class='text'>email</span></a>
 </li>
 <li class='facebook'>
  <a class='popup' expr:href='&quot;http://www.facebook.com/sharer.php?u=&quot; + data:post.canonicalUrl + &quot;&amp;t=&quot; + data:post.title ' title='Share on Facebook'><span class='icon'><svg enable-background='new 0 0 28 28' height='28px' id='Layer_1' version='1.1' viewBox='0 0 28 28' width='28px' x='0px' xml:space='preserve' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' y='0px'><path d='M27.825,4.783c0-2.427-2.182-4.608-4.608-4.608H4.783c-2.422,0-4.608,2.182-4.608,4.608v18.434                                         c0,2.427,2.181,4.608,4.608,4.608H14V17.379h-3.379v-4.608H14v-1.795c0-3.089,2.335-5.885,5.192-5.885h3.718v4.608h-3.726                                         c-0.408,0-0.884,0.492-0.884,1.236v1.836h4.609v4.608h-4.609v10.446h4.916c2.422,0,4.608-2.188,4.608-4.608V4.783z'/></svg></span><span class='text'>facebook</span></a>
 </li>
 <li class='linkedin'>
  <a class='popup' expr:href='&quot;http://www.linkedin.com/shareArticle?mini=true&amp;url=&quot; + data:post.canonicalUrl + &quot;&amp;title=&quot; + data:post.title ' title='Share on Linkedin'><span class='icon'><svg enable-background='new 0 0 28 28' height='28px' id='Layer_1' version='1.1' viewBox='0 0 28 28' width='28px' x='0px' xml:space='preserve' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' y='0px'><path d='M25.424,15.887v8.447h-4.896v-7.882c0-1.979-0.709-3.331-2.48-3.331c-1.354,0-2.158,0.911-2.514,1.803                                         c-0.129,0.315-0.162,0.753-0.162,1.194v8.216h-4.899c0,0,0.066-13.349,0-14.731h4.899v2.088c-0.01,0.016-0.023,0.032-0.033,0.048                                         h0.033V11.69c0.65-1.002,1.812-2.435,4.414-2.435C23.008,9.254,25.424,11.361,25.424,15.887z M5.348,2.501                                         c-1.676,0-2.772,1.092-2.772,2.539c0,1.421,1.066,2.538,2.717,2.546h0.032c1.709,0,2.771-1.132,2.771-2.546                                         C8.054,3.593,7.019,2.501,5.343,2.501H5.348z M2.867,24.334h4.897V9.603H2.867V24.334z'/></svg></span><span class='text'>linkedin</span></a>
 </li>
 <li class='twitter'>
  <a class='popup' expr:href='&quot;http://twitter.com/home?status=&quot; + data:post.title + &quot; &quot; + data:post.canonicalUrl ' title='Share on Twitter'><span class='icon'><svg enable-background='new 0 0 28 28' height='28px' id='Layer_1' version='1.1' viewBox='0 0 28 28' width='28px' x='0px' xml:space='preserve' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' y='0px'><path d='M24.253,8.756C24.689,17.08,18.297,24.182,9.97,24.62c-3.122,0.162-6.219-0.646-8.861-2.32                                     c2.703,0.179,5.376-0.648,7.508-2.321c-2.072-0.247-3.818-1.661-4.489-3.638c0.801,0.128,1.62,0.076,2.399-0.155                                     C4.045,15.72,2.215,13.6,2.115,11.077c0.688,0.275,1.426,0.407,2.168,0.386c-2.135-1.65-2.729-4.621-1.394-6.965                                     C5.575,7.816,9.54,9.84,13.803,10.071c-0.842-2.739,0.694-5.64,3.434-6.482c2.018-0.623,4.212,0.044,5.546,1.683                                     c1.186-0.213,2.318-0.662,3.329-1.317c-0.385,1.256-1.247,2.312-2.399,2.942c1.048-0.106,2.069-0.394,3.019-0.851                                     C26.275,7.229,25.39,8.196,24.253,8.756z'/></svg></span><span class='text'>twitter</span></a>
 </li>
 <li class='reddit'>
  <a expr:href='&quot;http://www.reddit.com/submit?url=&quot;+data:post.canonicalUrl' title='Share on reddit'><span class='icon'><svg enable-background='new 0 0 28 28' height='28px' version='1.1' viewBox='0 0 28 28' width='28px' x='0px' xml:space='preserve' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' y='0px'><g><path d='M11.794 15.316c0-1.029-0.835-1.895-1.866-1.895c-1.03 0-1.893 0.865-1.893 1.895s0.863 1.9 1.9 1.9 C10.958 17.2 11.8 16.3 11.8 15.316z'/><path d='M18.1 13.422c-1.029 0-1.895 0.864-1.895 1.895c0 1 0.9 1.9 1.9 1.865c1.031 0 1.869-0.836 1.869-1.865 C19.969 14.3 19.1 13.4 18.1 13.422z'/><path d='M17.527 19.791c-0.678 0.678-1.826 1.006-3.514 1.006c-0.004 0-0.009 0-0.014 0c-0.004 0-0.01 0-0.015 0 c-1.686 0-2.834-0.328-3.51-1.005c-0.264-0.265-0.693-0.265-0.958 0c-0.264 0.265-0.264 0.7 0 1 c0.943 0.9 2.4 1.4 4.5 1.402c0.005 0 0 0 0 0c0.005 0 0 0 0 0c2.066 0 3.527-0.459 4.47-1.402 c0.265-0.264 0.265-0.693 0.002-0.958C18.221 19.5 17.8 19.5 17.5 19.791z'/><path d='M27.707 13.267c0-1.785-1.453-3.237-3.236-3.237c-0.793 0-1.518 0.287-2.082 0.761c-2.039-1.295-4.646-2.069-7.438-2.219 l1.483-4.691l4.062 0.956c0.071 1.4 1.3 2.6 2.7 2.555c1.488 0 2.695-1.208 2.695-2.695C25.881 3.2 24.7 2 23.2 2 c-1.059 0-1.979 0.616-2.42 1.508l-4.633-1.091c-0.344-0.081-0.693 0.118-0.803 0.455l-1.793 5.7 C10.548 8.6 7.7 9.4 5.6 10.75C5.006 10.3 4.3 10 3.5 10.029c-1.785 0-3.237 1.452-3.237 3.2 c0 1.1 0.6 2.1 1.4 2.69c-0.04 0.272-0.061 0.551-0.061 0.831c0 2.3 1.3 4.4 3.7 5.9 c2.299 1.5 5.3 2.3 8.6 2.325c3.228 0 6.271-0.825 8.571-2.325c2.387-1.56 3.7-3.66 3.7-5.917 c0-0.26-0.016-0.514-0.051-0.768C27.088 15.5 27.7 14.4 27.7 13.267z M23.186 3.355c0.74 0 1.3 0.6 1.3 1.3 c0 0.738-0.6 1.34-1.34 1.34s-1.342-0.602-1.342-1.34C21.844 4 22.4 3.4 23.2 3.355z M1.648 13.3 c0-1.038 0.844-1.882 1.882-1.882c0.31 0 0.6 0.1 0.9 0.209c-1.049 0.868-1.813 1.861-2.26 2.9 C1.832 14.2 1.6 13.8 1.6 13.267z M21.773 21.57c-2.082 1.357-4.863 2.105-7.831 2.105c-2.967 0-5.747-0.748-7.828-2.105 c-1.991-1.301-3.088-3-3.088-4.782c0-1.784 1.097-3.484 3.088-4.784c2.081-1.358 4.861-2.106 7.828-2.106 c2.967 0 5.7 0.7 7.8 2.106c1.99 1.3 3.1 3 3.1 4.784C24.859 18.6 23.8 20.3 21.8 21.57z M25.787 14.6 c-0.432-1.084-1.191-2.095-2.244-2.977c0.273-0.156 0.59-0.245 0.928-0.245c1.035 0 1.9 0.8 1.9 1.9 C26.354 13.8 26.1 14.3 25.8 14.605z'/></g></svg>
</span><span class='text'>reddit</span></a>
 </li> 
 <li class='googleplus'>
  <a class='popup' expr:href='&quot;https://plus.google.com/share?url=&quot; + data:post.canonicalUrl ' title='Share on Google Plus'><span class='icon'><svg enable-background='new 0 0 28 28' height='28px' id='Layer_1' version='1.1' viewBox='0 0 28 28' width='28px' x='0px' xml:space='preserve' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' y='0px'>
                                    <g>
                                        <g>
                                            <path d='M14.703,15.854l-1.219-0.948c-0.372-0.308-0.88-0.715-0.88-1.459c0-0.748,0.508-1.223,0.95-1.663                                                 c1.42-1.119,2.839-2.309,2.839-4.817c0-2.58-1.621-3.937-2.399-4.581h2.097l2.202-1.383h-6.67c-1.83,0-4.467,0.433-6.398,2.027                                                 C3.768,4.287,3.059,6.018,3.059,7.576c0,2.634,2.022,5.328,5.604,5.328c0.339,0,0.71-0.033,1.083-0.068                                                 c-0.167,0.408-0.336,0.748-0.336,1.324c0,1.04,0.551,1.685,1.011,2.297c-1.524,0.104-4.37,0.273-6.467,1.562                                                 c-1.998,1.188-2.605,2.916-2.605,4.137c0,2.512,2.358,4.84,7.289,4.84c5.822,0,8.904-3.223,8.904-6.41                                                 c0.008-2.327-1.359-3.489-2.829-4.731H14.703z M10.269,11.951c-2.912,0-4.231-3.765-4.231-6.037c0-0.884,0.168-1.797,0.744-2.511                                                 c0.543-0.679,1.489-1.12,2.372-1.12c2.807,0,4.256,3.798,4.256,6.242c0,0.612-0.067,1.694-0.845,2.478                                                 c-0.537,0.55-1.438,0.948-2.295,0.951V11.951z M10.302,25.609c-3.621,0-5.957-1.732-5.957-4.142c0-2.408,2.165-3.223,2.911-3.492                                                 c1.421-0.479,3.25-0.545,3.555-0.545c0.338,0,0.52,0,0.766,0.034c2.574,1.838,3.706,2.757,3.706,4.479                                                 c-0.002,2.073-1.736,3.665-4.982,3.649L10.302,25.609z'/>
                                            <polygon points='23.254,11.89 23.254,8.521 21.569,8.521 21.569,11.89 18.202,11.89 18.202,13.604 21.569,13.604 21.569,17.004                                                 23.254,17.004 23.254,13.604 26.653,13.604 26.653,11.89      '/>
                                        </g>
                                    </g></svg></span><span class='text'>google+</span></a>
 </li>
 <li class='pinterest'>
  <a href='javascript:void((function(){var%20e=document.createElement(&apos;script&apos;);e.setAttribute(&apos;type&apos;,&apos;text/javascript&apos;);e.setAttribute(&apos;charset&apos;,&apos;UTF-8&apos;);e.setAttribute(&apos;src&apos;,&apos;http://assets.pinterest.com/js/pinmarklet.js?r=&apos;+Math.random()*99999999);document.body.appendChild(e)})());' title='Share on Pinterest'><span class='icon'><svg enable-background='new 0 0 28 28' height='28px' id='Layer_1' version='1.1' viewBox='0 0 28 28' width='28px' x='0px' xml:space='preserve' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' y='0px'><path d='M14.021,1.57C6.96,1.57,1.236,7.293,1.236,14.355c0,7.062,5.724,12.785,12.785,12.785c7.061,0,12.785-5.725,12.785-12.785                                     C26.807,7.294,21.082,1.57,14.021,1.57z M15.261,18.655c-1.161-0.09-1.649-0.666-2.559-1.219c-0.501,2.626-1.113,5.145-2.925,6.458                                     c-0.559-3.971,0.822-6.951,1.462-10.116c-1.093-1.84,0.132-5.545,2.438-4.632c2.837,1.123-2.458,6.842,1.099,7.557                                     c3.711,0.744,5.227-6.439,2.925-8.775c-3.325-3.374-9.678-0.077-8.897,4.754c0.19,1.178,1.408,1.538,0.489,3.168                                     C7.165,15.378,6.53,13.7,6.611,11.462c0.131-3.662,3.291-6.227,6.46-6.582c4.007-0.448,7.771,1.474,8.29,5.239                                     c0.579,4.255-1.816,8.865-6.102,8.533L15.261,18.655z'/></svg></span><span class='text'>pinterest</span></a>
 </li>
</ul><!-- /rrssb -->

Step 8: Finally Save template and refresh any of your blog post and check its working.

DEMO

Conclusion
Start implementing these easy steps and add this awesome sharing widget to your blogger blog.
Having problem at Step 7? feel free to ask for help! comment your queries below.
If you like this widget than don't forget to share, like or +1 this post.
credit: KNI Labs

Generate Random Numbers Within Range in C Without Repetition

2014-08-17T15:53:00.000+05:30

Many times we need to perform tasks randomly to full fill our program(e.g game,quiz etc.) goals but repetition of same number again and again fails our program and feels irritating to our users. So, today we will help you to create a simple C/C++ program which will generate random numbers within given range and we will make sure no number will repeats itself again. Let's get started!

Generating Random Numbers In C or C++

If you checked most basic random number generation program in C, you might have some knowledge about rand() function in C which is used to generate random numbers.

Why I said that most basic?
Because, rand() function works very well but after running that program again and again you can identify that its generating the same series or number all the time.

So how to fix?
To fix this common issue we usually need to seed our rand function using srand() function. And this is how srand function is used to generate different number all the time:

srand(time(NULL));

So now we know how to generate random number and how to fix its common problem. Now we are all set to define our range and actually generate random number in that range which will not repeat itself again.

C Program To Generate Random Number Within Range Without Repetition

#include <stdio.h>
#define N1 2
#define N2 10

void main(){
    int len = N2-N1+1,i , r , temp;
    int num[len];

    //Fill array with desired numbers
    for( temp=0,i=N1; temp<len; i++,temp++ )
        num[temp] = i;

    srand( time(NULL) );  //seed rand()

    //Fisher–Yates shuffle algorithm
    for( i=len-1; i>0; i-- ){
        r = rand()%i;   //pop random number
        //swaping using temp
        temp = num[i];
        num[i] = num[r];
        num[r] = temp;
    }

    /*Random Numbers b/w N1-N2 are stored in Array num*/

    //print the array
    for( i=0; i<len; i++ )
        printf("%d\n",num[i]);
}

Output:

Program Explanation

Firstly we defined our range at the top using #define N1 and N2 where N1 and N2 are our lower and upper bound respectively.

Skipping other variables deceleration directly coming to variable len , this is used to calculate the size of array required to store all the number within range.

After declaring array and other variables we have to fill/assign all the desired numbers into our array num.

Which is easily done using a for loop to generate numbers between N1 to N2 and variable temp is used as index of array num from 0 to len.

srand is used to generate unique solution every time as explained earlier.

Shuffle: Their are various ways to generate unique random numbers between range but above program in inspired by Fisher–Yates shuffle. We will explain more about Fisher–Yates algorithm soon so keep calm and wait for proper explanation.

After shuffle our array num is set to print/use numbers which are between our range and since are shuffled they act as random and finally full fill our objective.

C++ Program To Generate Random Number Within Range Without Repetition

Little changes in above code and same program will work perfectly in C++.

#include <iostream>
#include <stdlib.h>
#include <time.h>
#define N1 5
#define N2 10
using namespace std;

main(){
    int len = N2-N1+1 , i , r , temp;
    int num[len];

    for( temp=0,i=N1; temp<len; i++,temp++ )
        num[temp] = i;

    srand( time(NULL) );  //seed rand()

    //Fisher–Yates shuffle algorithm
    for( i=len-1; i>0; i-- ){
        r = rand()%i;
        temp = num[i];
        num[i] = num[r];
        num[r] = temp;
    }

    for( i=0; i<len; i++ )
        cout << num[i] << endl;
}

Generate Unique Random Numbers in Java

Conclusion:
So, now you know the easiest way to generate random numbers within range and also without repeating. Hope you enjoyed our programming article after a long time. Please share if you liked this or any other post.

30+ Websites to Submit Your Blogger Template

2014-06-13T20:45:00.000+05:30

Following 30+ Blogger templates galleries will help you to promote and publish your template for free. Also helps to increase your blog traffic and back-links.

This is the only secret behind the success of Awesome! Blogger Template.

How To Submit Your Template?

The common submission layout of mostly all the websites is
About Your Blog
Name: Your blog name
eMail: Your email id
About Your Template
Name: Template Name
Instructional URL: URL of your template instruction (your post)
Demo URL: Demo of your template (submit .blogspot link)
Template Files: Upload or Provide the download link

Where To Submit Your Template?

Websites are sorted according to there Alexa Ranking (updated 29 July 2014)

BTemplates
Alexa: 4,749
Submit Here

Gooyaabi Templates
Alexa: 16,784
Submit Here

My Blogger Themes
Alexa: 17,053
Submit Here

Premium Blogger Templates
Alexa: 18,543
Submit Here

All Blog Tools
Alexa: 34,777
Submit Here

ivythemes
Alexa: 47,124
Submit Here

Blogger Themes
Alexa: 49,343
Submit Here

Ketemplate
Alexa: 50,274
Submit Here

Zoom Template
Alexa: 66,016
Submit Here

Best Blogger Templates
Alexa: 77,263
Submit Here

Dhetemplate
Alexa: 85,999
Submit Here

Blogtemplate4u
Alexa: 106,614
Submit Here

Kaizen Template
Alexa: 169,243
Submit Here

Daily Blogger Templates
Alexa: 201,055
Submit Here

Vina Themes
Alexa: 212,895
Submit Here

Responsive Blogger Template
Alexa: 290,749
Submit Here

Amatemplates
Alexa: 376,796
Submit Here

Premium BTemplates
Alexa: 427,990
Submit Here

bietemplates
Alexa: 435,265
Submit Here

New Blogger Templates
Alexa: 461,862
Submit Here

Blogger Templates Blog
Alexa: 469,838
Submit Here

Template-Blogspot
Alexa: 595,263
Submit Here

Templates Shop
Alexa: 684,885
Submit Here

Websites with Alexa Rank more than 1000K, still useful to promote your template.

10 Blogger Templates
Submit Here

The Template Bank
Submit Here

BTheme
Submit Here

Pearl Templates
Submit Here

Themes Cook
Submit Here

Blog Zone
Submit Here

Blogger Templates Hub
Submit Here

Free Blogger Templates
Submit Here

My Blog Themes
Submit Here

If you like our collection than, like, tweet, +1 and share our post!

NOTE: If your blog also accepts template submission, let us know!

Data Types and Variables In Java

2014-05-27T20:52:00.000+05:30

Welcome to the second tutorial by Code Nirvana, here we are going to learn a very important aspect of Java programming, about data types and variables, there is virtually no good program you can write without the knowledge of these. From this tutorial we are going to use JDK 8, to keep ourselves updated. So let’s code on…

In case you missed our previous tutorial on Introduction to Java Programming, Visit Here

Variables in Java

Variables are simply named memory spaces to store some kind of data. Imagine you write up phone numbers of your class friends on separate papers and put it in separate envelopes and then you write the friend’s name on each envelope that you remember in which envelope you can find the required phone number. So, in this each friend’s name would be a variable and the paper and envelope would be the physical memory. A variable name should be meaningful and according to what it holds, this is a good practice but hard for lazy guys.. :)

But there are some restrictions on variable naming in Java, keep these in mind:

1. They must not begin with a digit.

2. Variable names are case sensitive. NIRVANA is not same as nirvana.

3. The name must not be a Java keyword.

4. You may give an underscore but white spaces…...banned!!!

Data Types in Java

Now, we know that variables hold data, but of what type? That information is specified by the variable’s data type. As Java has got distinct data types, it’s called a “Strongly typed language” unlike some other language like JavaScript.

Look at the hierarchy diagram to understand the organization of data types in Java.

In this tutorial we are going to learn about the left part of the diagram, i.e, Primitive data types.

INTEGER TYPES

Integer type of data type can hold whole number values, such as 1234, 656, -108..etc. There are four kinds of integer data types, which we use according to the size of value we need they are byte, short, int and long. They sizes that they can hold are like this:

TYPE	SIZE	VALUE RANGE
byte	1 byte	-128 to -127
short	2 bytes	-32,768 to 32,767
int	4 bytes	-2,147,483,648 to 2,147,483,647
long	8 bytes	-9,223,372,036,854,775,808 to -9,223,372,036,854,775,807

CHOOSING THE CORRECT INTEGER TYPE

Now when we want to take a whole number in a variable which integer type to choose? As I said earlier it depends on the size of the constant/literal (value) it holds. Let’s try some example-

Suppose it’s a class roll no:-

short roll=12; [Don’t know how to declare a variable? Check previous tutorial]

Or, maybe it’s the cost of a laptop:-

int cost=23299; [In rupees]

Or, maybe it’s your friends phone number:-

Long number=1234567890;

Note: In common practice we use the int data type mostly for any size of variable, if it doesn't increase the size limit, then we use long.

FLOATIG POINT TYPES

Floating point types can hold decimal digits, it’s of two kinds float and double. Here also we choose the data type of the variable according to the size of the value. Actually float is ‘single-precision type’ and double is ‘double-precision type’, now in Java all the floating pint values are double-precision by default so when taking a value in float data type we must append a ‘f’ or ‘F’ after it.

Examples:

Suppose it’s a movie rating:

float rate=3.5F;

[If you don’t mention F a syntax error ‘possible loss of precision’ would show up]

Or, maybe it’s a precision length:

double length=19.2453;

Note: In common practice we mostly used double to avoid syntax errors.

The sizes of float and double are

TYPE	SIZE	RANGE
float	4 bytes	3.4e-038 to 1.7+0.38e
double	8 bytes	3.4e-038 to 1.7e+308

CHARACTER TYPE

In here we only have char data type; it’s used to store only one character. Don’t forget to enclose its value with single quotes(‘’)

Example:

char c=’a’;

BOOLEAN TYPES

They represent outcome of a condition, either true or false, these can be the only values of Boolean type. It is declared by boolean keyword.

Example:

boolean result=true;

Or,

boolean result=false;

There is also another String type, but we will discuss it when we will cover up classes, objects and functions. Because unlike the others String is a class, and we work with its objects.

TYPE CASTING IN JAVA

In Java we may sometimes need to change one type to another according our needs, and we may easily do this like this:

type2 variable2=(type2) variable1;

It will convert variable to type2.

Example:

int a=9;

double convert=(double)a;

The type is changed.

But we have to keep one thing in mind, some data types holds data of large sizes and some holds data of small sizes, so when we convert from a data type of large size to a data type of small size, there may be a loss of data. But the problem does not exist if it is vice versa.

Conclusion

So, this was it, we will discuss the String data type and scope of variables in some tutorials later. If you have any questions in this part please feel free to comment, don’t forget to subscribe the Code Nirvana newsletter or to share us on Facebook. To demand more tutorials, Contact Us. Keep Coding…

Introduction To Java Programming

2014-05-07T19:09:00.000+05:30

The first question, what is this Java stuff anyway… well Java is an “Object Oriented Programming”(OOP) language. We will know about OOP in the next part, first of all we must know what is a programming language… It’s actually giving the computer instructions to carry out specific job, or “teaching the computer several ways to solve problems”. If you don’t have any programming experience, then let me tell you to write any program think how do you yourself will solve it in real world, then translate your thoughts in the programming language. So let’s start with Java…

History and Usage

The team which created Java was under James Gosling, and they worked for Sun Microsystems to create a platform-independent programming language. The first implementation was done in the fall of 1992, then it was called ‘Oak’ but the name was later changed to ‘Java’ due to some legal snags. The first public announcement of Java was done in 1995.
Since then Java turned out to be a global hit, it was a revolution in internet for its applets. Major companies like Google and Amazon extensively uses Java. Also java produced maximum number of jobs in 2013.

How Java works

To work with Java you will need Java Development Kit (JDK) installed in your computer. We will work with Java SE(Standard Edition) 1.7 in this tutorial. Download JDK for free from here.
The legend of Java is in “Byte Code”. When we write a Java program we store it in a file with .Java extension, after compiling we get a file with .class extension. This is the portable file which holds the byte code, which can be taken to any computer with any platform and be run. The byte code is interpreted with JVM (Java Virtual Machine), which converts all the Java code to machine. Thus, Java is both compiled and interpreted language.
SOURCE CODE»javac(JAVA COMPILER)»BYTE CODE»JVM»MACHINE CODE.

Concepts Of OOP

If you are already versed with the concepts of OOP or done any other OOP language such as C++, you may skip this part.
The main concept of OOP is PIE, or Polymorphism Inheritance Encapsulation. We will now deal with these heavy looking terms.

Polymorphism

Lets take the word ‘cell’ we use it to define the structural and functional part of living things or a mobile phone or a jail room or intersection of rows and columns in excel. You can see that a same word is used to define many things, this is the concept of polymorphism. We can do the same in java, the practical part of this comes in the later tutorials.

Inheritance

A son has many characteristics of his parents and this is only the general idea of inheritance, the same applies to programming, its carrying common attributes or behaviours from one entity to another.

Encapsulation

Its packing several attributes or entities in an single entity, for example we have several words- Plant, Animal, digestion, stomata, stomach, transpiration, we can see the are jumbled words with plant and animal organs and processes. This is what happens in Procedure Oriented Programming, but in
OOP we don’t let them float around but we pack them. Animal{digestion(stomach)} Plant{transpiration(stomata)}. In programming terms Animal and Plant are classes, digestion and transpiration functions and stomach and stomata data members. We will discuss these terms later on in detail.

Java Classes, Functions and Objects

Before we start coding we must know what these are. Well class is a collection of data, functions, etc. actually it is the encapsulating entity. It is also called the object factory, a collection of classes is known as package.
Objects contains all the characteristics of a class, any function or data member of the class it belongs to can be accessed through it
(Though it depends on the visibility modes, about which we will discuss in later tutorials).
Functions are the code blocks in which the work is done, we write the code to be executed in functions.
We may take Car as a class, BMW and Ferrari can be considered its objects and driving its function.

The First Java Program

Let’s now start up with coding (finally..!!). Here is a very very simple Java program, have a look:

class CodeNirvana {
    public static void main(String h[]){
        System.out.print("Hello world from Code Nirvana");
    }
}

Output:

Now let’s have a post-mortem of the program. We begin with the class keyword, it declares a class called CodeNirvana… Here’s the syntax- class<class name>.
We may give any class name but it is the convention to begin the class name with a capital letter and start every new word with a capital letter.
Next we write a brace to begin defining the class in Java we start a code block with a { and end it with a }. The code block opened at last must be closed at first.
Then we write the word “public static void main(String h[])”, we will discuss these words in detail in our tutorial about functions. For now, you should know that these words are to define a function called “main” from which most of the Java programs starts to execute. Remember, when you code in general, then “main” method is must.
Then comes the important part of the System.out.print(); statement, this is the displaying statement of Java, whatever letters we want to write on the console we will write it in double quotes. System.out.print(); displays the content but dose not takes the cursor to the next line, whereas System.out.println(); displays the content and takes the cursor to the next line.
You may notice the “;” after the statement, the semicolon is used to terminate each statement, behold my friends!! This is the place where most programmers get their bugs.

Using Numbers and Variables

We will discuss about all variable types in the next tutorial, here we will use only the “int” type. First of all, what is a variable? Well, they are named memory spaces to store data while running the program.

Syntax to declare a variable: <data type> <variable name>;

Assign it a value: <variable name>=<value>;

lets join it..
<data type> <variable name>=<value>;
Example: int a=10;

Remember a variables value can be changed any time but the declaration has to be made only once.
We may declare multiple variables with same data type like this…
int a=0,b=1,c=9………z=7;

Every variable in Java has a data type, Here we use “int” it is to store an integer constant.

Few Operators with variables

Let’s use the basic mathematical operators now.
int a=10+5;
now, a=15
int b=a*10;
now b=150;
Simple, isn't it.
System.out.print() with variables.

To display any variable we don’t need to give the double quotes, let’s take an example

int a=25;
System.out.print(a);
Outpur: 25.

We may do a calculation:

int a=5;
int b=10;
System.out.print(a+b);
Output: 15

We may display a variable’s value along with letters using the ‘+’ operator like this:

int a=100;
System.out.print(“Hundred=”+a);
Output: Hundred=100

But to do a calculation along with displaying a string(Group of letters) needs another bracket:

int a=5,b=10;
System.out.println(“Sum=”+a+b);
System.out.print(“Sum=”+(a+b));
Output:
Sum=510
Sum=15

Beware of this mistake:
int a=10;
System.out.println(a);
System.out.print(“a”);
Output:
10
a

Remember whatever we write in double quotes will be displayed as it is(Except the escape sequences…don’t worry, this all ill come in the third tutorial)

Running the Java program

First we have to write the code in any text editor like notepad or notepad++, then save it with the class name as the file name and with .Java extension. Now where to save it? It should be saved in the bin folder of the jdk’s folder in your Java root directory. The path in Windows XP using jdk1.7 update 45 is: C:\Program Files\Java\jdk1.7.0_45\bin
Or, you may change your “path” environment variable to the path of your bin folder like this in command prompt: set path= “C:\Program Files\Java\jdk1.7.0_45\bin”

Best IDE for Java Programming: Visit Here

Next you must compile the program with javac command like this
javac “<file path>”
Example:
javac “C:\Program Files\Java\jdk1.7.0_45\bin\CodeNirvana.java”

If there is any syntax error it will be displayed else a .class file will be created. Now to run it we will use the Java command after navigating to the directory where the .class file is.

java <class name>
Example:
java CodeNirvana

Your program will now run successfully…

Conclusion

You now have the basic idea of Java, more will come in the next tutorials on Code Nirvana, if you have any problem in any part please feel free to comment and don't forget to subscribe to the Code Nirvana newsletter to get notifications about tutorials to your email id for free. Keep coding...

NEXT: Data Types and Variables In Java

Fibonacci and Multibonacci Series Program in Java

2014-04-22T18:57:00.001+05:30

We are accustomed with the “Fibonacci” series, where the previous two members of the series are summed up to get the next one. “Multibonacci” takes the concept of this series to the next level. In here we will give the users the choice that how many previous members should be added up to give the next member of the series. So let’s begin…

Let's Begin With Fibonacci Series In Java

To catch up with the Multibonacci code we must look up at the Fibonacci sequence code once and understand its logic.
Here we will not use the general mathematical formula, though it makes the program shorter, instead we will divide logic in few statements for easy understanding which will help us climb the stairs to Multibonacci.
Here is the code to print first 10 members of Fibonacci sequence.
Source Code:

class fibonacci{
    public static void main(String args[]) {
        int a=1,b=0,c=0;
        for(int i=1;i<=10; i++) {
            System.out.print(c+ ",");
            c=a+b;
            a=b;
            b=c;
        }
    }
}

Output: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34

So, how does it works? First we take three int variables a,b and c, we are using a and b to store the previous two variables and c to take up there sum and print it. Then we change the values, a takes up the value of b, thus it gets the second last term, b gets the value of c thus it gets the last term, and thus it goes on. This is the logic that drives Multibonacci too.

The Multibonacci Series Concept

Once I came through an interesting program called “Tribonacci” series, where the last 3 members/terms had to be summed up to give the next term. So I thought there must be program to accommodate all these “Tribonacci”, “Tetrabonacci”, “Pentabonacci”……..and so on.

Why Should I Learn It?

Multibonacci is not going to come for any exam or viva. But we should take up programming tasks up apart from the ‘syllabus’ to enhance our skills and understand the concepts well, which will make us enable not to just write programs we have learnt but say ‘Bring it on!!’ to programming challenges.

Here Comes MULTIBONACCI Series In Java

As in Fibonacci we took two variables to store the previous two terms, in Multibonacci we are going to take an array whose length will be entered according to the user.

Source Code:

import java.io.*;
class Multibonacci {
    public static void main (String args[])throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        System.out.print("ENTER THE NUMBER OF MEMBERS TO BE ADDED UP: ");
        int x=Integer.parseInt(br.readLine());
        int num[]=new int[x];
        int printvar=0; //to store the sum and display
        int j,k;        //looping variables.
        num[0]=1;
        System.out.print("Series: ");
        for (int m=1;m<x;m++)
            num[m]=0;
        for(int i=1;i<=10;i++) {
            System.out.print(printvar+ ", ");
            printvar=0;
            for(j=0;j<x;j++)
                printvar=printvar+num[j];
            for (k=0;k<x-1;k++)
                num[k]=num[k+1];
            num[x-1]=printvar;
        }
    }
}

Output:

Conclusion: We can say that Multibonacci Series program is an advanced program of Fibonacci Series. We programmed this in Java but the concept is same everywhere, Multibonacci program is just for improvement of your programming skills, there's very less chance of coming this question in an interview, exam etc.

Hope you enjoyed this program... If you have any query or problem related to this program or any program, feel free to leave your comment below.

No Money? No problem. AAP Advertisement Campaign Will Astonish You

2014-04-04T19:24:00.000+05:30

Technology played a huge role in the success of Aam Aadmi Party. The newest party lead by Arvind Kejriwal promises of a corruption free India. It is a platform for the qualified and honest people to change the current political establishment. After the Splendid performance in Delhi State assembly polls it soon became a national movement and bought hope to the common man.
The social media involvement of AAP has played a huge role in their success. Most of the politicians are active on twitter and have large number of followers. Clearly, The tech wing of AAP knows how to work.
Recently AAP's official Facebook page shared a very interesting way to advertise for them. Devoid of crores of rupees and completely relying on donations. They found a way to advertise using Wi-Fi HOTSPOTS... The video explains in plain Hindi how to spread the word.

Promote AAP through Mobile & Wi-Fi

C Program To Turn OFF PC or Shutdown Computer

2014-04-02T22:03:00.000+05:30

It is possible to Shut down PC using a C program. All you have to do is send a command to the operating system using command prompt within the programs domain.

Source Code for Windows 7

#include <stdio.h>
#include<stdlib.h>

main()
{
char ch;
printf("Do you want to shutdown your computer now(y/n)\n");
scanf("%c",&ch);

if(ch=='y' || ch=='Y')
system("C:\\WINDOWS\\System32\\shutdown /s");
return 0;
}

Source Code for Windows XP

#include <stdio.h>
#include<stdlib.h>

main()
{
char ch;
printf("Do you want to shutdown your computer now(y/n)\n");
scanf("%c",&ch);

if(ch=='y' || ch=='Y')
system("C:\\WINDOWS\\System32\\shutdown -s");
return 0;
}

Working:
A prompt for approval of shutting down the computer will pop out, if you press 'y' then your computer will shutdown in 30 seconds, system function of "stdlib.h" is used to run an executable file shutdown.exe which is present in C:\WINDOWS\system32 in Windows XP. You can use various options while executing shutdown.exe for example -s option shutdown the computer after 30 seconds, if you wish to shutdown immediately then you can write "shutdown -s -t 0" as an argument to system function. If you wish to restart your computer then you can write "shutdown -r".

Output:
Windows will turn off.

If you like this Program and find this helpful, don't forget to like and share with your friends!

C Programs Using Recursion

2014-04-01T07:04:00.000+05:30

Recursion basically means a process of repeating items in a self-similar way. And in programming, when a function calls itself it is known as recursive function and the process of calling back the function is known as Recursion.

Recursive Function in Programming

As explained above.. When a function calls itself it is known as recursive function. Now the question arises how a function can call itself? So Here's a little intro about what recursive function is and how interesting this recursion process is!

You will better understand about recursion using following programs:

Sum of Digits Program in C | Using Recursion

Its easy to write a function to find sum of digits of a number. Now lets do some recursion in this function.

Source Code:

#include<stdio.h>
#include<conio.h>

int digitSum(int);

void main(){
 int i;
 printf(" Enter a number: ");
 scanf("%d",&i);
 printf(" Sum of digits : %d",digitSum(i));
 getch();
}

int digitSum(int n){
 if(n<1)
  return 0;
 return(n%10+digitSum(n/10));   //else condition
}

Output:

Enter a number: 127
Sum of digits : 10

Working:
digitSum(127) =
7 + digitSum(12)
7 + 2+ digitSum(1)
7 + 2 + 1
= 10

Reverse Number Program in C | Using Recursion

If you missed our C Program to reverse a Number then you can check that Here

Now lets reverse number using recursion.

Source Code:

#include<stdio.h>
#include<conio.h>

int rev(int,int);

void main(){
 int a;
 printf(" Enter a Number: ");
 scanf("%d",&a);
 printf(" Reverse: %d",rev(a,0));
 getch();
}

int rev(int i,int r){
 if(i > 0)
  return rev(i/10,(r*10)+(i%10));
 return r;
}

Output:

Enter a number: 301
Sum of digits : 103

Working:
rev(301,0) =
rev(30,1)
rev(3,10)
rev(0,103) //i<0
= 103

Factorial Program in C | Using Recursion

We already shared factorial of a number program in C using three different methods and the third method is using recursive function. So click the link given below:

Factorial Program Using Recursion

Important Note:

All the programs using recursive functions must have a condition or way to stop the recursion and return the output otherwise the function will run infinite number of times and hence your program crashes.

Like in above program we are returning new values of variable ' i ' by dividing it by 10 and when ever the function recalls, first it checks for ' i>0 '.

Conclusion:

So now you know about one of the most discussed topic in programming i.e, Recursion. We have seen how our program become easy and short using recursive functions, but recursive functions have some disadvantages too.

Disadvantage:

1. Hard to think the logic for Recursion to replace our complex nesting.

2. Make debugging harder.

3. We might have to use some extra variables to better understand the code.

Apart from their advantages and disadvantages, I personally found recursion very useful and interesting. If you have any problem , you can leave your comment below! Also don't forget to Like and Share this article with your friends...

Fibonacci Series in C

2014-03-29T17:30:00.000+05:30

Fibonacci series a commonly asked question in school or university examinations and interviews! Today we will learn and discuss the logic to generate Fibonacci series in C programming, Let's Start!

What is Fibonacci Series?

Fibonacci Sequence is the series of numbers starting from 0,1 and then rest sequence is generated by adding the previous two numbers and the same process continues for generating the rest series.
Fibonacci Sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, .....
So basically there's just one basic rule to remember is i.e, x_n = x_n-1 + x_n-2

Fibonacci Series in C

Logic for Fibonacci Series

Take two variables n1 and n2 with initial value 0 and 1 respectively and a variable count / num which is used to track the number of terms and a check for our condition for Fibonacci series. After that print n1 and n2 and start a loop (using while in below codes) with the condition accordingly. In loop statement we have to assign new values to n1 and n2 and print the sum of n1 and nu before it. Let's understand this properly from the below source codes!

Fibonacci Series can be generated if we know:

1. Number of terms

2. Last term(number) condition

Note : Here we are taking input from user.

Fibonacci Series in C: given number of terms

If we know the number of terms 'n' till which the Fibonacci series should be generated than, Fibonacci series will be generated using below source code.

/* Fibonacci Series in C | for n terms */

#include<stdio.h>
#include<conio.h>

void main() {
  int count,      //count num. of terms
      n,          //max. num. of term in series
      n1=0, n2=1;
  printf(" Enter Number Of Terms: ");
  scanf("%d",&n);
  printf(" Fibonacci Series: %d %d ", n1, n2); //
  count=2;    //since we printed 2 numbers 0 and 1
  while (count<n) {
      printf("%d ",n1+n2);
      n2 = n1+n2 -n2 + (n1=n2); //assigning new values to n1 and n2
      ++count;
  }
  getch();
}

Output:

Fibonacci Series in C: given last term condition

Similarly if we know the condition for the last term or number, than also Fibonacci series can be generated using below source code. Here we take a number input from user and the condition is, our series terms should less that that number. ex.- If use enter 5 than our series will be: 0 1 1 2 3 . Let's see how to do this!

/* Fibonacci Series in C | for last term condition */

#include<stdio.h>
#include<conio.h>

void main() {
  int num,      //last term <= num
      n1=0, n2=1;
  printf(" Enter a Number: ");
  scanf("%d",&num);
  printf(" Fibonacci Series: %d %d ", n1, n2); //
  while (n1+n2 < num) {
      printf("%d ",n1+n2);
      n2 = n1+n2 -n2 + (n1=n2); //assigning new values to n1 and n2
  }
  getch();
}

Output:

Fibonacci Series in C by Recursion

When a function call itself than the function is known as Recursive Function. Programs using Recursion generally have small code and faster processing. So let's create Fibonacci Series program using recursion.

/* Fibonacci Series in C Using Recursion */

#include<stdio.h>
#include<conio.h>

int fibonacci(int);

void main(){
   int n, i = 0, count;
   printf("Enter Number Of Terms: ");
   scanf("%d",&n);
   printf("Fibonacci series: ");

   for (count=1; count<=n; count++, i++){
      printf("%d ", fibonacci(i));
   }

   getch();
}

int fibonacci(int n) {
   if (n == 0)
      return 0;
   else if (n == 1)
      return 1;
   else
      return (fibonacci(n-1) + fibonacci(n-2));
}

Conclusion:
Fibonacci series as said earlier is most simple and commonly asked question in C Programming. There are various other ways to generate the same Fibonacci sequence by using other logic and loop (for and do-while). In the above program we use a complex one line logic trick to swap two variables value while assigning new values to n1 and n2, a much understanding method can be done using a third variable and apply operations on them! Finally if you have any question regarding this program or any problem in programming... Kindly post your comment below

Factorial Program In C

2014-03-09T15:28:00.002+05:30

What is Factorial of a Number?

A mathematics term for a non-negative integer n, denoted by n!, which is the product of all positive integers less than or equal to n.
e.g- 4! = 4x3x2x1 = 24

So finding factorial of a number is a must have feature if you are willing to build a basic scientific calculator in any programming language. Here we are building factorial program in C but you can also check: Java Program To Find Factorial of Given Number .

Different Methods for finding Factorial of a Number in Programming:

1. Using standard for/while loop
2. Using loop in a user defined function (mostly used)
3. Using recursion (best method)

Factorial Program in C : Using loop

This is the most common and standard method for finding factorial of a number.

Source Code:

#include <stdio.h>
#include <conio.h>

void main(){
    int num ,i,fac=1;;
    printf("Enter a Number: ");
    scanf("%d",&num);
    for(i=num;i>0;i--){
        fac = fac*i;
    }
    printf("Factorial of %d is: %d ",num,fac);
    getch();
}

Factorial Program in C : Using User Defined Function

This method is mostly used because building methods are always best practice to reduce the size and complexity of your code.

Source Code:

#include <stdio.h>
#include <conio.h>

void main(){
    int num;
    printf("Enter a Number: ");
    scanf("%d",&num);
    printf("Factorial of %d is: %d ",num,factorial(num));
    getch();
}

int factorial(int n){
    int i,fac=1;
    for(i=n;i>0;i--){
        fac = fac*i;
    }
}

Factorial Program in C : Using Recursion

The most important method which every student must know to find factorial of a number using any programming language is using a recursive function (Functions are recursive if they call themselves) lets understand this method from the program given below.

#include <stdio.h>
#include <conio.h>

void main(){
    int num;
    printf("Enter a Number: ");
    scanf("%d",&num);
    printf("Factorial of %d is: %d ",num,factorial(num));
    getch();
}

int factorial(int n){
    if (n<1) return 1;
    else return n*factorial(n-1);
}

Output:

So finally you learned all the three methods to build a factorial program in C.

Also Read: C Program for Palindrome

If you enjoyed this article please subscribe for our newsletter and receive our future articles on programming direct into your inbox for free!

C Program To Reverse a Number

2014-03-09T11:51:00.000+05:30

Write a program to reverse a number or digits in C, a very basic and commonly asked question in interviews and exams. Today you will learn the standard method to reverse the number or digits and later we will tell you the error or bug which ever reverse number program have and how to remove that error completely!

Also Read: C Program for Palindrome

Source Code:

#include <stdio.h>
#include <conio.h>

void main(){
    int num , rev=0;
    printf("--- Reverse Number Program In C ---\n\n");
    printf("Enter a Number: ");
    scanf("%d",&num);
    while(num>0){
        rev = rev*10 + num%10;
        num = num / 10;
    }
    printf("Reverse is %d",rev);
    getch();
}

Output:

ERROR / BUG:
The above program work perfectly but when you enter a number having 0 (zero)s at the end than you will find out what's wrong with this program! ( See above output image carefully )
e.g If you enter 540 than the reversed number will be 45 instead of 045.

Correction:
So the only thing we have to do is count the leading number of zeros and print them before the reversed number. Lets see how to do that!

Correct Source Code:

#include <stdio.h>
#include <conio.h>

void main(){
    int num , temp, rev=0, c=0, i=0;
    printf("--- Reverse Number Program In C ---\n\n");
    printf("Enter a Number: ");
    scanf("%d",&num);
    temp = num;
    while(num>0){
        rev = rev*10 + num%10;
        //Check for zeros
        if(num%10==0 && i==0) c++;
        else i=1;
        num = num / 10;
    }
    printf("Reverse is ");
    for(i=0;i<c;i++){
      printf("0");
    }
    printf("%d",rev);
    getch();
}

Output:

C Program for Palindrome

2014-03-08T21:43:00.000+05:30

Palindrome Number?

A palindromic number or palindrome number is a number that remains the same when its digits are reversed. Like 16461.

Logic For Palindrome:

When the reverse of a number is equal to the number itself than its a palindrome. So we just need to reverse the number and than check whether it matches to the entered number or not and print the output saying whether the number is palindrome or not.

Source Code:

#include <stdio.h>
#include <conio.h>

//Reversing the number
int reverse(int num){
    int rev = 0;
    while(num>0){
        rev = rev*10 + num%10;
        num = num/10;
    }
    return rev;
}

void main(){
    int n;
    printf("Enter a number: ");
    scanf("%d",&n);
    if(n == reverse(n)){
        printf("Number is Palindrome!");
    } else{
        printf("Number is not a Palindrome!");
    }
    getch();
}

Output:

AWESOME! 2.0 | Multi-Color Responsive Blogger Template

2014-03-04T19:39:00.000+05:30

AWESOME! blogger template is better and colorful now. Now the Template comes with 10 COLORS to choose from. You can download your favorite color by viewing it real-time on the demo. You get all this for the price of a facebook like, tweet, or a +1. Please contact us if you have any problems regarding the download process.

Demo Download

Features

Responsive & Retina Ready
Responsive Sticky Drop Down Menu Bar
YouTube inspired Loading bar
Bouncing Back To Top
Advanced Search Box Widget [know more]
Comments With Smiley and Emotions
Comments With Images and Video Support
Author BIO

Other Features: SEO Optimized, Automatic Summary, Auto Read More, Ad Friendly, Bread Crumbs, Threading commenting with Admin comment highlighted with 'MOD' and much more.

Detailed Features

Customization

Search Box:
Search for " Search Site URL " and change URL with your domain name.

Author BIO:
Search for " Author BIO Section " make changes accordingly.
Change picture, Name, Description, RSS Feed and Social Links.

Featured Posts:
Open Layout Panel and click edit on featured posts section and place the code given below in its content:

<li>
 <a href='#'>
    Post Title 1
 </a>
</li>

<li>
 <a href='#'>
    Post Title 2
 </a>
</li>

<li>
 <a href='#'>
    Post Title 3
 </a>
</li>

Edit above code with your post links and titles.

Social Icons:
Open Layout Panel and click edit on Social Icons section and place the code given below in its content:

<li><a alt='Facebook' class='fb-but' href='https://www.facebook.com/#' target='_blank'/></a></li>

<li><a alt='Twitter' class='twitter-but' href='https://twitter.com/#' target='_blank'/></a></li>

<li><a alt='Google Plus' class='google-but' href='https://plus.google.com/#' target='_blank'/></a></li>

<li><a alt='YouTube' class='youtube-but' href='https://youtube.com/#' target='_blank'/></a></li>

<li><a alt="Pinterest" class="pinterest-but" href="http://www.pinterest.com/#" target="_blank"></a></li>

<li><a alt='RSS Feed' class='rss-but' href='http://feeds.feedburner.com/#' target='_blank'/></a></li>

Edit above code with your social links.

Need the theme selector?
Contact Here

Advanced JSON Search Box Widget For Blogger

2014-01-22T16:57:00.000+05:30

If you own a blog than you know the importance of your posts and loves to make your post visible to the visitors to get them engaged and start searching more and more on your blog. For doing that everyone works hard on adding popular posts, related posts or you might also like types of widgets to their blog and usually miss to improve the small and the most important thing might be placed on your blog too... I am talking about Search Box.

Today I will help you to add a search box to your blogger blog using JSON which retrieve blogger content to XML and show search results on the same active page. Blogger providing a normal search page to find the content using parameter q (e.g- http://www.codenirvana.in/search?q=programming). With Advanced JSON search box visitors can search any query relating to your blog and the search result will be shown in a popup using onsubmit event in input of form and simple CSS. So lets start with the procedure to add this cool search box widget!

Step 1: Open your Blogger dashboard and choose the blog.

Step 2: Navigate to >>Template>>Edit HTML

Step 3: Click anywhere in the code and press Ctrl+F and search for </body>

Step 4: Copy the code given below and place it above/before </body>

<script type='text/javascript'>
//<![CDATA[
var searchFormConfig = {
    url: "http://www.codenirvana.in",   //Search Site URL
   numPost: 100,     //Number Of Search Results
   summaryPost: true,    //enable-disable Search Result Summary
   summaryLength: 400,    //Search Result Summary Length in words
   resultTitle: "SEARCH RESULTS FOR", //Search Result Container Title
   noResult: "No result",    //No Result Tittle
   resultThumbnail: true,    //enable-disable Search Result Thumbnail
   thumbSize: 110,    //Search Result Thumbnail Size in px
   fallbackThumb: "http://2.bp.blogspot.com/-hmfDWRueV6E/UsbKQ6KYvTI/AAAAAAAAA-I/6neu80wFcSQ/s1600/no-img.jpg" //No Thumbnail
};
function getId(a){return document.getElementById(a)}var config=searchFormConfig,input=getId("feed-input"),resultContainer=getId("search-container"),resultLoader=getId("search-loader"),skeleton="";function showResult(l){var k=l.feed.entry?l.feed.entry:"",a,g,e;skeleton="<h4>"+config.resultTitle+" &quot;"+input.value+"&quot;</h4>";skeleton+='<a class="closebtn" title="Close" href="#close" onclick="resultContainer.style.display=\'none\';return false;">&times;</a><ol>';if(k===""){skeleton+="<li>"+config.noResult+"</li>"}for(var d=0;d<config.numPost;d++){if(d==k.length){break}var b=new RegExp(input.value,"ig"),f=k[d],h=f.title.$t.replace(b,"<mark>"+input.value+"</mark>");for(var c=0;c<f.link.length;c++){if(f.link[c].rel=="alternate"){a=f.link[c].href;break}}g=("summary" in f&&config.summaryPost===true)?f.summary.$t:"";if(config.resultThumbnail===true){e=("media$thumbnail" in f)?f.media$thumbnail.url.replace(/\/s[0-9]+\-c/g,"/s"+config.thumbSize+"-c"):config.fallbackThumb}g=g.replace(/<br ?\/?>/ig," ").replace(/<.*?>/g,"").replace(/[<>]/g,"");if(g.length>config.summaryLength){g=g.substring(0,config.summaryLength)+"..."}g=g.replace(b,"<mark>"+input.value+"</mark>");skeleton+='<li><img style="width:'+config.thumbSize+"px;height:"+config.thumbSize+'px;" src="'+e+'" alt="" /><p><a href="'+a+'" target="_blank">'+h+"</a>"+g+"</p></li>"}skeleton+="</ol>";resultContainer.innerHTML=skeleton;resultLoader.style.display="none";resultContainer.style.display="block"}(function(){var a=document.createElement("script");a.type="text/javascript";a.id="search-feed-script";document.getElementsByTagName("head")[0].appendChild(a)})();function updateScript(){resultContainer.style.display="none";resultLoader.style.display="block";var a=getId("search-feed-script"),b=document.createElement("script"),c=input.value;b.id="search-feed-script";b.type="text/javascript";b.src=config.url+"/feeds/posts/summary?alt=json-in-script&q="+c+"&max-results="+config.numPost+"&callback=showResult";a.parentNode.removeChild(a);document.getElementsByTagName("head")[0].appendChild(b);return false}function resetField(){if(input.value===""){resultContainer.style.display="none";resultLoader.style.display="none"}};
//]]>
</script>
<style>
#feed-input {border: 0 none;width: 150px;height: 28px;-webkit-transition: all 0.5s ease-in-out;-moz-transition: all 0.5s ease-in-out;}
#feed-input:focus{width:170px;margin-left:0px;}
#search-btn {background: none repeat scroll 0 0 #359BED;border: 0 none;color: #FFFFFF;padding: 6px 10px;height: 30px;cursor: pointer;}
#search-container { height:auto; overflow:auto; border-radius: 10px; margin-top:8px; margin-bottom: 3%; background-color: #6984BB; padding:10px 10px 0; -webkit-box-shadow:0 1px 2px rgba(0,0,0,.4),0 7px 7px -4px rgba(0,0,0,.4); -moz-box-shadow:1 1px 2px rgba(0,0,0,.4),0 7px 7px -4px rgba(0,0,0,.4); box-shadow:0 1px 2px rgba(0,0,0,.4),0 7px 7px -4px rgba(0,0,0,.4); display:none;}
#search-container mark { background-color:transparent; color:black; font-weight:bold;}
#search-container a { text-decoration:none; color:#0D3E71; font-weight:bold; font-size:15px; display:block;}
#search-container a:hover { color:#39914E;}
#search-container h4 { width : 500px; margin:0 0 10px; font-family: &#39;Segoe UI Light&#39;, &#39;Open Sans&#39;, Verdana, Arial, Helvetica, sans-serif; color:#FFF; text-align: left;}
#search-container ol { background:transparent; border:none; margin:0 0 10px; padding:0 0;}
#search-container li { margin:10px 0 1px; padding:0px 8px 0px 0px; list-style:none; background-color:white; overflow:hidden;
 word-wrap:break-word; border-radius:3px; -webkit-transition: 0.3s; -moz-transition: 0.3s; -ms-transition: 0.3s; -o-transition: 0.3s; border:1px solid #ccc;}
#search-container li img { display:block; float:left; margin:5px 5px ;}
#search-container li p { font-size: 11px; text-align: left;}
#search-loader { left:5px; z-index:999; background-color: #6984BB; width: 10%; color:white; padding:3px 5px; margin-bottom: 10px; font-size: 13px; -webkit-border-radius:0 0 3px 3px; -moz-border-radius:0 0 3px 3px; border-radius:0 0 3px 3px; display:none;}
#search-container li p { margin:0; padding:5px 0px;}
#search-container li:hover { background:#FAF4D7;}
#search-container .closebtn {font-size: 25px;color: #A8A8A8;padding-bottom: 10px;text-align: center;position: absolute;right: 25px;top: 25px;font-family: arial;}
</style>

Step 4.1 After successfully placing the above CSS and JavaScript, copy below code and place where you want to show the Search Box on your blog. You can even Add Gadget in your layout panel by adding a HTML/JavaScript Gadget.

<form action="/search" onsubmit="return updateScript();">
<input id="feed-input" name="q" placeholder=" Search Site " size="40" type="text" />
<input id="search-btn" onkeyup="resetField();" type="submit" value="Search" />
</form>

Step 5: Now the final and most important step! Placing the search result container on your blog where your results pops up!.
For this you have to find an appropriate position where you have to place the below code. Check the most appropriate position by searching on the above search box.

<div id='search-container'/>
<div id='search-loader'>Loading...</div>

->If you have some basic blogger template editing or working with blogger codes experience than I am sure you will successfully add this code too, but for the newbies or those who don't have any experience in blogger template editing or anything I will suggest you to comment below with your blog URL (without http://) after doing all the steps 1 to 4 and I will help you to place the final code(step 5).

DEMO: Scroll to TOP and search anything in search box.

Customization:
Step 4 where you placed JavaScript and CSS before </body>
You will find my comments at the right side of every searchFormConfig Elements which I think is well understood and anyone can understand. Here are some important ones to take care of!

url: "http://www.codenirvana.in", //Search Site URL
numPost: 100, //Number Of Search Results
summaryLength: 400, //Search Result Summary Length in words
resultTitle: "SEARCH RESULTS FOR", //Search Result Container Title

thumbSize: 110, //Search Result Thumbnail Size in px

Similarly Step 4 code contains all the CSS required for this search box widget so some common customization's:

- Background of Search Container:
change background-color of #search-result-container

- Text Color of Search Container Title:
change color of #search-result-container h4

- Background of Search Results:
change background-color of #search-result-container li

- Text Color of Search Results Title:
change color of #search-result-container a

Final Words: Its a great must have blogger widget and easy to install too just be careful in Step 5 and if need help, feel free to contact me by simply comment below or contact privately!

Don't Forget to change Search Site URL from codenirvana.in to your site URL