My Linux Stuff - Complete Blog For Linux Articles

My Linux Stuff - Complete Blog For Linux Articles

A Website For Complete Linux OS,Step by Step linux Installtion, Linux Tips and Tricks and Linux Stuff and so on... Connect and sharing here....

TOP 50 ENGINEERING COLLEGES IN INDIA 2014

TOP 50 ENGINEERING COLLEGES IN INDIA 2014

This below survey was taken many form many colleges in India. These Top 50 Engineering Colleges in India have Good Infrastructure, Good Environment, Educations , Staff, Placement , Research Activities and other Facilities are good.

Top 10 Government Engineering Colleges in India

Top 10 Government Engineering Colleges in India

These Government Engineering Colleges in India are really good for all kind of stuff like Education , research , Placement and New Innovation Ideas etc... But Getting seat in these colleges are heavy competition in students .....

Top 10 Colleges In India 2014

Top 10 Colleges In India 2014

Indian Institute Of Technology Delhi,Indian Institute Of Technology Bombay,Indian Institute Of Technology Kanpur,Indian Institute Of Technology Madras,Indian Institute Of Technology Kharagpur,Indian Institute Of Technology Roorkee,University Of Delhi,Indian Institute Of Technology Guwahati,University Of Calcutta,University Of Mumbai, National Institute Of Technology,Trichy.

2014 LATEST SURVEY TOP RANKING ENGINEERING COLLEGES IN INDIA

2014 LATEST SURVEY TOP RANKING ENGINEERING COLLEGES IN INDIA

This below survey was taken many form many colleges in India. These Top 100 Engineering Colleges in India have Good Infrastructure, Good Environment, Educations , Staff, Placement , Research Activities and other Facilities are good. If you want to do Engineering as your dream and try out these colleges

Subscribe Now!

Enter your email address:

Saturday, October 29, 2011

Ten Days of Dhul Ḥijja


The Many Blessings of the Ten
Days of Dhul Ḥijja
Once more a period of divine blessing has dawned upon
us, bringing with it its zephyrs of divine mercy and
opportunity.  For truly, it is not that one sacred season of
devotion ends, except that another opportunity for attaining God’s forgiveness, bounty, and self%
purification begins.  In these cycles of sacred times, we find the heavenly gift of a renewed chance to
replenish our souls and seek God’s reward and proximity.  

More Click Here 

signs of the day of judgment

Friday, October 28, 2011

C# Job For Experience


Dear Candidate,
Hi,

Greetings for the day!!!

We have an immediate opening with a TOP MNC in Bangalore for Permanent Rolls. Details are as follows -

Skill : C# with Windows application
CURRENTLY in C# with Windows application/\Winfroms/Windows service/Windows mobile..etc will only be short listed by panel.
DON'T APPLY IF CURRENTLY IN ASP.NET/WEB APPLICATION (WILL BE SCREEN REJECT)
PLEASE MENTION PROJECTS CLEAR AS ABOVE ONLY.

Experience1-2 years of experience.
Location: Bangalore

Package definitely will be best in market standards.
Only client short-listed candidates must need to take a interview on O5TH NOV 2011(ONE DAY PROCESS-OFFER CONFIRMATION)

If your CV matches with the above requirement then, send your updated CV at earliest for details.

"Can refer anyone interested for the same"

NOTE: IT'S A BULK MAIL,IGNORE IF AGAIN.

Best Regards
--
Arun Iyengar
Talent Acquisition
COVENANT CONSULTANTS

"Fastest Growing Recruitment Company in India accredited by ERA"
6th Floor,Astral Heights
No.6-3-352/2/3, Above Reliance communications
Road # 1 Banjara Hills, Hyderabad - 500 034.
Direct: 040 3017 3026 / 040 3017 3020
Fax: 044 4390 3915 / E-Mail: arunk@covenantindia.net
Web : http://covenantindia.net
Locations : Chennai : Bangalore: Coimbatore : Pune : Hyderabad

PUSH UP Tips

f you’re sick of doing the same old exercises—the same old way—it’s probably time to rethink your approach. And take it from us: There’s never just a single way to do any exercise. In fact, here at Men’s Health, we still learn new movements and methods every week.

Take the classic pushup. Most folks opt for some version of 3 sets of 10 reps (or 15 or 20). Or they just do as many pushups as they can. But below, you’ll find three easy ways to make this exercise instantly more interesting. And whether you can do 50 pushups, or just one, there’s a routine for you. Remember: Your workout is only as stale as your imagination. (Want to upgrade your diet, too?

If you have trouble doing at least 10 good pushups . . . 
Take the number of perfect pushups you can complete, and divide that in half. Then perform five sets of that number of pushups, resting 60 seconds between each set. For example, if you did 6 pushups in the test, you’ll do five sets of 3 pushups—for a total of 15 pushups. Each workout (do it every 4 days), deduct 5 seconds from the rest interval. In theory, after 12 workouts, you’ll be down to zero rest between sets—and able to do 15 pushups in a row. (It won’t necessarily work perfectly, but you’ll no doubt be above 10.) At first, it’ll seem too easy to be effective. But give it a shot, and you’ll be pleasantly surprised.

Note: If you can’t complete at last two standard pushups, then do the same routine, but with your hands on a raised surface—such as a bench or step—instead of the floor. This reduces the amount of your body weight you have to lift. That’s because the higher the surface, the easier the exercise becomes. (When it comes to your overall fitness, mobility is as important as strength:

If you want a super-fast, muscle-blast . . . 
Grab a stopwatch and try this routine. It’s designed to quickly improve your upper-body endurance. Time how long it takes you do as many pushups as you can. Then rest for the same time period, and repeat the process two to four times. So if you do 20 pushups in 25 seconds, you’ll rest 25 seconds, and repeat. Let’s say on your next round you complete 12 pushups in 16 seconds. You’d then rest for 16 seconds before your next set. You can apply this technique to any variation of the exercise you want. (For more variations of this classic exercise,

If you’re ready to take the Men’s Health Pushup Challenge . . . 
Then try this very cool ladder workout in the above video. How high can you go? After you find out, try to do better the next time you perform the challenge.

Important Message to all Indian Friend

Attention all Indian Friends……

Supreme Court has announced, any person who meets road accidents can be taken to the nearby hospital immediately. Hospital must not ask for police report to admit him,its doctors' duty to do First-aid.

Police can be informed later. Pls spread this message by sharing on your wall .. It will help us all...!!!

Thursday, October 27, 2011

C# Sample Programs


Linear Search Program

using System;
class linSearch
{
public static void Main()
{
int[] a= new int[100];
Console.WriteLine("Enter number of elements you want to hold in the array ?");
string s=Console.ReadLine();
int x=Int32.Parse(s);
Console.WriteLine("-------------------------");
Console.WriteLine("\n Enter array elements \n");
for(int i=0;i<x;i++)
{
string s1=Console.ReadLine();
a[i]=Int32.Parse(s1);
}
Console.WriteLine("-------------------------");
Console.WriteLine("Enter Search element\n");
string s3=Console.ReadLine();
int x2=Int32.Parse(s3);
for(int i=0;i<x;i++)
{
if(a[i]==x2)
{
Console.WriteLine("-------------------------");
Console.WriteLine("Search successful");
Console.WriteLine("Element {0} found at location {1}\n",x2,i+1);
return;
}
}
Console.WriteLine("Search unsuccessful");
}
}

Binary Search Program

using System;
class binSearch
{
public static void Main()
{
int[] a= new int[100];
Console.WriteLine("Number of elements in the array ?");
string s=Console.ReadLine();
int x=Int32.Parse(s);
Console.WriteLine("-----------------------");
Console.WriteLine(" Enter array elements ");
Console.WriteLine("-----------------------");
for(int i=0;i<x;i++)
{
string s1=Console.ReadLine();
a[i]=Int32.Parse(s1);
}
Console.WriteLine("--------------------");
Console.WriteLine("Enter Search element");
Console.WriteLine("--------------------");
string s3=Console.ReadLine();
int x2=Int32.Parse(s3);
int low=0;
int high=x-1;
while(low<=high)
{
int mid=(low+high)/2;
if(x2<a[mid])
high=mid-1;
else if(x2>a[mid])
low=mid+1;
else if(x2==a[mid])
{
Console.WriteLine("-----------------");
Console.WriteLine("Search successful");
Console.WriteLine("-----------------");
Console.WriteLine("Element {0} found at location {1}\n",x2,mid+1);
return;
}
}
Console.WriteLine("Search unsuccessful");
}
}

Selection Sort Program

using System;
class selectionSort
{
public static void Main()
{
int[] a= new int[100];
int min,pass,i;
Console.WriteLine("Number of elements in the array ?");
string s=Console.ReadLine();
int x=Int32.Parse(s);
Console.WriteLine("-----------------------");
Console.WriteLine(" array elements ");
Console.WriteLine("-----------------------");
for(int j=0;j<x;j++)
{
string s1=Console.ReadLine();
a[j]=Int32.Parse(s1);
}
for(pass=0;pass<x-1;pass++)
{
min=pass;
for(i=pass+1;i<x;i++)
{
if(a[min]>a[i])
min=i;
}
if( min!=pass)
{
int k=a[pass];
a[pass]=a[min];
a[min]=k;
}
}
Console.WriteLine("--------------------------------------------");
Console.WriteLine("Sorted elements of an array are(selection sort)");
for (int j=0;j<x;j++)
Console.WriteLine(a[j]);
}
}

Bubble Sort Program

using System;
class bubbleSort
{
public static void Main()
{
int[] a= new int[100];
Console.WriteLine("Number of elements in the array ?");
string s=Console.ReadLine();
int x=Int32.Parse(s);
Console.WriteLine("-----------------------");
Console.WriteLine(" array elements ");
Console.WriteLine("-----------------------");
for(int j=0;j<x;j++)
{
string s1=Console.ReadLine();
a[j]=Int32.Parse(s1);
}
int limit= x-1;
for(int pass=0;pass<x-1;pass++)
{
for(int j=0;j<limit-pass;j++)
{
if(a[j]>a[j+1])
{
int k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
Console.WriteLine("------------------------------------------------");
Console.WriteLine("Sorted elements of an array are(buble sort)");
for (int j=0;j<x;j++)
Console.WriteLine(a[j]);
}
}

Finding Largest and Smallest Number

using System;
class Test
{
public static void Main()
{
int n;
float large,small;
int[] a = new int[50];
Console.WriteLine("Enter the size of Array");
string s= Console.ReadLine();
n=Int32.Parse(s);
Console.WriteLine("Enter the array elements");
for(int i=0;i<n;i++)
{
string s1=Console.ReadLine();
a[i]=Int32.Parse(s1);
}
Console.Write("");
large =a[0];
small= a[0];
for(int i=1;i<n;i++)
{
if(a[i]>large)
large=a[i];
else if(a[i]<small)
small=a[i];
}
Console.WriteLine("Largest element in the array is {0}",large);
Console.WriteLine("Smallest element in the array is {0}",small);
}
}

Fibonacci Series

using System;
class FS
{
public static void Main()
{
int n;
Console.WriteLine("Number of terms to be generated ?");
string s=Console.ReadLine();
n=Int32.Parse(s);
Console.WriteLine("*******************************");
Console.WriteLine("Fibonacci seqence upto {0}",n);
Console.WriteLine("*******************************");
test1.generateFib(n);
}
}
class generateFib
{
static int f1=0;
static int f2=1;
public static void fib(int n)
{
int temp;
if(n<2)
{
f1=0;
f2=1;
}
else
{
fib(n-1);
temp=f2;
f2=f1+f2;
f1=temp;
}
Console.WriteLine(f1);
}
}

Palindrome Program

using System;
class palindrome
{
public static void Main()
{
int n,num,digit,sum=0,rev=0;
string s;
Console.WriteLine("*******************");
Console.WriteLine("Please enter a number");
Console.WriteLine("*******************");
s=Console.ReadLine();
num=Int32.Parse(s);
n=num;
do
{
digit=num%10;
sum+=digit;
rev=rev*10+digit;
num/=10;
}while(num!=0);
Console.WriteLine("*******************************");
Console.WriteLine("Sum of the digit of the number = {0}",sum);
Console.WriteLine("************************");
Console.WriteLine("Reverse of the number = {0}",rev);
Console.WriteLine("************************");
if(n==rev)
Console.WriteLine("The number is a palindrome");
else
Console.WriteLine("The number is not a palindrome");
}
}

Generating Pascal Triangle

using System;
class pascalTriangle
{
public static void Main()
{
int binom=1,q=0,r,x;
Console.WriteLine("Enter the number of rows");
string s=Console.ReadLine();
int p =Int32.Parse(s);
Console.WriteLine(p);
Console.WriteLine("The Pascal Triangle");
while(q<p)
{
for(r=40-(3*q);r>0;--r)
Console.Write(" ");
for(x=0;x<=q;++x)
{
if((x==0)||(q==0))
binom=1;
else
binom=(binom*(q-x+1))/x;
Console.Write(binom);
}
Console.Write("\n ");
++q;
}
}
}

The following two source code listings showhow to write a crude but effective console mode application forconverting a number, either from binary to decimal, or from decimal tobinary. Note: you pass in the decimal number or the binary string as aparameter when typing the program's name at a command prompt.

From Decimal to Binary…

using System;

class Program{

static void Main(string[] args){

try{

int i = (int)Convert.ToInt64(args[0]);
Console.WriteLine("\n{0} converted to Binary is {1}\n",i,ToBinary(i));

}catch(Exception e){

Console.WriteLine("\n{0}\n",e.Message);

}

}//end Main

public static string ToBinary(Int64 Decimal)
{
// Declare a few variables we're going to need
Int64 BinaryHolder;
char[] BinaryArray;
string BinaryResult = "";

while (Decimal > 0)
{
BinaryHolder = Decimal % 2;
BinaryResult += BinaryHolder;
Decimal = Decimal / 2;
}

// The algoritm gives us the binary number in reverse order (mirrored)
// We store it in an array so that we can reverse it back to normal
BinaryArray = BinaryResult.ToCharArray();
Array.Reverse(BinaryArray);
BinaryResult = new string(BinaryArray);

return BinaryResult;
}

}//end class Program

——————————————————————————–

From Binary to Decimal…

using System;

class Program{

static void Main(string[] args){

try{

int i = ToDecimal(args[0]);
Console.WriteLine("\n{0} converted to Decimal is {1}",args[0],i);

}catch(Exception e){

Console.WriteLine("\n{0}\n",e.Message);

}

}//end Main

public static int ToDecimal(string bin)
{
long l = Convert.ToInt64(bin,2);
int i = (int)l;
return i;
}

}//end class Program



//Binary equivalent of a binary number
#include<stdio.h>
#include<conio.h>
int binary (int);
void main()
{
int num;
clrscr();
printf("\nEnter The Number: ");
scanf("%d",&num);
binary(num);
printf("\n\n\n\n\nPress any key to exit.....");
getch();
}
//function to convert deciaml to binary
int binary (int n)
{
int r;
r=n%2;
n=n/2;
if (n==0)
{
printf("\nThe binary equivalent is %d",r);
return(r);
}
else
binary(n);
printf("%d",r);
}


We can achieve the string reversal in a easy way.

Let us Consider a one dimensional character array, input string and an output string variable.

Char[] arrStr;

string strInput = "Naveen";

string strOutput= string.Empty;


Am passing the string "Naveen" to the array in the following manner.

arrStr = strInput.ToCharArray();


then we have to put a reverse for loop like below

for(int idx=arrStr.Length-1;idx>=0; idx--)

{

   strOutput  += arrStr.Getvalue(idx);

}



The output will be "neevaN"


Reversing strings
First, there are many solutions, but this one can be done with three lines of code. The method shown in this article is based on the author's work with ToCharArray, and the method is static because it does not need to save state. This article is based on .NET 3.5 SP1.

=== Example program that reverses strings (C#) ===

using System;

static class StringHelper
{
    /// <summary>
    /// Receives string and returns the string with its letters reversed.
    /// </summary>
    public static string ReverseString(string s)
    {
        char[] arr = s.ToCharArray();
        Array.Reverse(arr);
        return new string(arr);
    }
}

class Program
{
    static void Main()
    {
        Console.WriteLine(StringHelper.ReverseString("framework"));
        Console.WriteLine(StringHelper.ReverseString("samuel"));
        Console.WriteLine(StringHelper.ReverseString("example string"));
    }
}

=== Output of the program ===

krowemarf
leumas
gnirts elpmaxe

Visual Studio Keyboard Shortcuts


Visual Studio 2003 & 2005 Default Keyboard Shortcuts
Text Manipulation Copy Ctrl + C
Cut
Ctrl + X Paste Ctrl + V
Undo
Ctrl + Z Redo Ctrl + Shift + Z
Transpose characters
Ctrl + T Transpose Lines Shift + Alt + T
Transpose Words
Ctrl + Shift + T Cut Line Ctrl + L
Delete Line
Ctrl + Shift + L Insert Line Above Ctrl + Enter
Insert Line Below
Ctrl + Shift + Enter Delete word to right Ctrl + Delete
Delete word to left
Ctrl + Backspace Collapse All Ctrl + M, O
Toggle outlining
Ctrl + M, M Toggle All Outlining Ctrl + M, L
Comment Selection
Ctrl + K, C Uncomment Selection Ctrl + K, U
Format Selection
Ctrl +K, F Format Document Ctrl + K, D
Make lowercase
Ctrl + U Make uppercase Ctrl + Shift + U
Delete horizontal whitespace
Ctrl + K, \ Toggle overtype/insert Insert
Toggle wordwrap
Ctrl +R, R Toggle whitespace Ctrl + R, W
Text Navigation Document end Ctrl + End
Document start
Ctrl + Home Go to line Ctrl + G
Go to matching brace
Ctrl + [ Scroll line Ctrl + [Up/Down]
Next word
Ctrl + Right Previous word Ctrl + Left
Next bookmark
Ctrl + K, N Previous bookmark Ctrl + K, P
Quick info
Ctrl + K, I
Text Selection Extend Selection Shift + [Arrow]
Select to end of document
Ctrl + Shift + End Select to start of document Ctrl + Shift + Home
Select to matching brace
Ctrl + Shift + ] Select to end of line Shift + End
Select to start of line
Shift + Home Extend selection by page Shift + [Page Up/Down]
Select to bottom of view
Ctrl + Shift + Page Down Select to top of view Ctrl + Shift + Page Up
Select All
Ctrl + A Select Word Ctrl + W
Select to last position
Ctrl + = Select to next word Ctrl + Shift + Right
Select to previous word
Ctrl + Shift + Left
Searching/Referencing Find all references Shift + F12
Next Location
F8 Previous Location Shift + F8
Find
Ctrl + F Find in Files Ctrl + Shift + F
Find Next
F3 Find Previous Shift + F3
Find Next Selected
Ctrl + F3 Find Previous Selected Ctrl + Shift + F3
Replace
Ctrl + H Replace in Files Ctrl + Shift + H
Debugging Apply Code Changes Alt + F10
Run
F5 Run w/o Debug Ctrl + F5
Restart
Shift + F5 Run to Cursor Ctrl + F10
Set Next Statement
Ctrl + Shift + F10 Step Over F10
Step Into
F11 Step Out Shift + F11
Call stack
Ctrl + Alt + C Breakpoints Ctrl + Alt + B
Disassembly
Ctrl + Alt + D Exceptions Ctrl + Alt + E
Immediate
Ctrl + Alt + I Modules Ctrl + Alt + U
Quick Watch
Ctrl + Alt + Q Registers Ctrl + Alt + G
Running Documents
Ctrl + Alt + N Threads Ctrl + Alt + T
View Autos
Ctrl + Alt + V, A View Locals Ctrl + Alt + V, L
View This
Ctrl + Alt + V, T View Watch 1-4 Ctrl + Alt + W, [1-4]
View Memory 1-4
Ctrl + Alt + M, [1-4] Toggle Breakpoint F9
New breakpoint
Ctrl + B Clear All Breakpoints Ctrl + Shift + F9
Attach to processes
Ctrl + Alt + F9
Designer View Code F7
View Designer
Shift + F7

Happy New Year Wallpaper






Advanced happy new year to Visitors

Different Wallpaper


Related Posts Plugin for WordPress, Blogger...