1) Store the number of days in each month in a month Array.

int month_days[] = { 31,28,31,30,31,30,

31,31,30,31,30,31};
Using Scanner, enter the month and
display the number of days in the month.
====================================================
2) Between numbers 1,2,3...N find out duplicate number.
There is only one duplicate number.

Example: 2,3,1,3,4. Duplicate=3

==================================
3) Reduce program size:-
int p=10;
for (k=0; k<=9; k++)
{
z[k] = p;
p = p +10;
}
====================================
4) Write program to print the pattern:-
1
23
345
4567
56789
=====================================
5) Write program to print the pattern:-
1
1
23
456
7 8 9 10

1
23
456
====================================
6) Reduce code size:-
switch(queue)
{
case 0: letter = 'w';
break;
case 1: letter = 's';
break;
case 2: letter = 'u';
break;
}
========================================
7) Add digits of a number (use while loop)
=========================================
8) Check whether a set of numbers are in ascending order