Funny Truths & Much More

Go INDIANS !!!

2011-08-18T22:24:00.003+05:30

Live for our nation! Show that we still have love for your country .We can do it.We have power to fight for freedom ,then we can also get rid of CORRUPTION from our country .Its we people who are supposed to throw it out form our Heart,form our Country and from INDIA.Let go together in support of Anna Hazare to achieve victory in terms of non corruption at all.Take an oath that we will not get tired till we achieve it .

The way we throw out Britishers ,the same way we can do the same with Corruption and people supporting corruption .So come up from your home ,do protest with non-violence and ask for Jan Lok Pal

*************JAI HIND*********

Kindle 3G, Free 3G + Wi-Fi, 3G Works Globally, Graphite, 6" Display with New E Ink Pearl Technology - includes Special Offers & Sponsored Screensavers

Click and Earn Money .

2011-05-28T19:20:00.001+05:30

http://www.PaisaLive.com/register.asp?1632173-210228.1

click over this link and start earning money

Amazing GoOgLe TRickS

2011-04-30T19:43:00.000+05:30

1. Google gravity
Open google.com, Type Google Gravity in the search box and click on I’m feeling Lucky button.Feel the effect of gravity on google. All page components will fall down due to gravity.
2. Epic Google
Open google.com, Type Epic Google in the search box and click on I’m feeling Lucky button. Each component on the page will start growing bigger and bigger.
3. Google Hacker
Open google.com, Type Google Hacker in the search box and click on I’m feeling Lucky button. How google will look if it was made by a hacker.
4. Annoying Google
Open google.com, Type Annoying Google in the search box and click on I’m feeling Lucky button.
5. Meaning Of Search For Google
Open google.com, Type search in the search box and click on I’m feeling Lucky button.
6. Loneliest Number
Open google.com, Type loneliest number in the search box and click on Search button. Find out which number is the loneliest number according to google.
7. Meaning Of Recursion
Open google.com, Type Recursion in the search box and click on search button. You can notice Did You Mean: Recursion text on top of results and it is recursively linked to the same page.
8. Google Loco
Open google.com, Type Google loco in the search box and click on I’m feeling Lucky button.
9. The number of horns on a unicorn
Open google.com, Type number of horns on a unicorn in the search box and click on search button.
10. Chuck Norris
Open google.com, Type Find Chuck Norris in the search box and click on I’m feeling Lucky button. Google won’t search for Chuck Norris because it knows you don’t find Chuck Norris, he finds you.

Tere bin ....

2011-03-19T15:50:00.003+05:30

Without You

Without you, how did I live like this?
How did I live without you?
Without you, how did I live like this?
How did I live without you?
With your memories,my nights passed - 2
The moonlight talks to me about you
My nights are lonely with out you
My days aren't like days
Lonely body, lonely soul, my eyes stay wet
Come by me now
I Don't want to live without you Without you, how did I live like this?
How did I live without you?
Without you, how did I live like this?
How did I live without you?
Since when are my eyes layed in your path?
Atleast let me meet you somewhere accidently
I can't forget your words
My eyes are wet every second
Why should I breath? Why should I live?
Living feels bad
Why did you become unfaithful, tell me the reason
Without you, how did I live like this?
How did I live without you...
Without you, how did I live like this?
How did I live without you...
You can not beat a good euphonious

Commonly Used Phrases at the Office

2011-03-16T21:41:00.001+05:30

Commonly Used Phrases at the Office and what they really mean!

1. For your information, please. (FYI)
Meaning: I don't know what to do with this, so please keep it.

2. Noted and returned.
Meaning: I don't know what to do with this, so please keep it little while.

3. Review and comment.
Meaning: Do the dirty work so that I can forward it.

4. Action please.
Meaning: Get yourself involved for me. Don't worry, I'll claim the credit.

5. For your necessary action.
Meaning: It's your headache now.

6. Copy to.
Meaning: Here's a share of my headache.

7. For your approval, please.
Meaning: Put your neck on the chopping board for me please.

8. Action is being taken.
Meaning: Your correspondence is lost and I am trying to locate it.

9. Your letter is receiving our attention.
Meaning: I am trying to figure out what you want.

10. Please discuss.
Meaning: I don't know what the hell this is, so please brief me.

11. For your immediate action.
Meaning: Do it NOW! Or I will get into serious trouble.

12. Please reply soon.
Meaning: Please be efficient. It makes me look inefficient.

13. We are investigating/ processing your request with the relevant authorities.
Meaning: They are causing the delay, not us.

14. Regards.
Meaning: Thanks and bless you for reading all the crap.

My true Friends

2011-03-05T23:30:00.000+05:30

   A Best Friend knows you from
   past,your all sorrows and
   fears,also he wipes out your tears
   remove your fears,
   very close and very dear.
   again very near and also my dear,
   his views are sharp and very clear
   for the very future near
   A best friend is harder to find
   & UNFORGETTABLE

   -Vinil

Google Analytics Tutorial 1: Setup

2011-03-05T19:08:00.000+05:30

TAX is More Than INCOME!!!!!!!1

2011-03-05T12:49:00.001+05:30

Question 1.. : What are you doing?
Ans. : Business.
Tax : PAY PROFESSIONAL TAX!

Question 2 : What are you doing in Business?
Ans. : Selling the Goods.
Tax : PAY SALES TAX!

Question 3 : From where are you getting Goods?
Ans. : From other State/Abroad
Tax : PAY CENTRAL SALES TAX, CUSTOM DUTY & OCTROI

Question 4 : What are you getting in Selling Goods?
Ans. : Profit.
Tax : PAY INCOME TAX!

Question 5: How do you distribute profit ?
Ans : By way of dividend
Tax : PAY DIVIDEND DISTRIBUTION TAX

Question 6 : Where you Manufacturing the Goods?
Ans. : Factory...
Tax : PAY EXCISE DUTY!

Question 7 : Do you have Office / Warehouse / Factory?
Ans. : Yes
Tax : PAY MUNICIPAL & FIRE TAX!

Question 8 : Do you have Staff?
Ans. : Yes
Tax : PAY STAFF PROFESSIONAL TAX!

Question 9 : Doing business in Millions?
Ans. : Yes -- Tax : PAY TURNOVER TAX!
Ans : No -- Tax : Then pay Minimum Alternate Tax

Question 10 : Are you taking out over 25,000 Cash from Bank?
Ans. : Yes, for Salary.
Tax : PAY CASH HANDLING TAX!

Question 11 : Where are you taking your client for Lunch & Dinner?
Ans. : Hotel
Tax : PAY FOOD & ENTERTAINMENT TAX

Question 12 : Are you going Out of Station for Business?
Ans. : Yes
Tax : PAY FRINGE BENEFIT TAX

Question 13 : Have you taken or given any Services?
Ans. : Yes
Tax : PAY SERVICE TAX

Question 14 : How come you got such a Big Amount?
Ans. : Gift on birthday.
Tax : PAY GIFT TAX

Question 15.: Do you have any Wealth?
Ans. : Yes
Tax : PAY WEALTH TAX

Question 16 : To reduce Tension, for entertainment, where are you going?
Ans. : Cinema or Resort.
Tax : PAY ENTERTAINMENT TAX

Question 17 : Have you purchased House?
Ans. : Yes
Tax : PAY STAMP DUTY & REGISTRATION FEE

Question 18 : How you Travel?
Ans. : Bus
Tax : PAY SURCHARGE

Question 19.: Any Additional Tax?
Ans. : Yes
Tax : PAY EDUCATIONAL, ADDITIONAL EDUCATIONAL & SURCHARGE ON ALL THE CENTRAL GOVT.'s TAX

Question 20: Delayed any time Paying Any Tax?
Ans. : Yes
Tax : PAY INTEREST & PENALTY

A visit To Mosque

2011-02-28T23:43:00.001+05:30

Huh !!!What a fantastic Day.I had to go to ajmer alone for some purpose.I went their alone .I reached their at 1 And within half an hour I reached my destination point which is in same street of DARGAH of KHWAJA .I go to shop where i had to go and then went out towards Dargah.I I bent my head in front of Dargah,outside it and started moving towards the bus station.but my mann was saying to go to Dargah once in a while.I kept going towards bus station.Suddenly i go inside a shop and asked for a cold drink.Fortunately that shop keeper was also Jain.So didn't hesitate to ask him how to go to Dargah.i mean where to put shoes and what to take inside etc.and then my legs move towards the Great Dargah.i reached their in 15 minutes.Then i opened my shoes in near by shop and purchased flowers(only thing to take inside for Dargah).Then i went inside the Dargah.AN awsm feel in my heart and mann.It seems like whole world is outside and and i am here in the world of peace under the shed of GOD.I went on their by asking few people as where to go for.They help me.Finally i reached at the gate of KHWAJA Sharif.I was late.It was time not to allow any person inside main Dargah for next 1 hour.But fortunately we were allowed to go inside.I went inside.And I can't express the peace of mind and heart at that time.I was feeling so goood and calm that words are seeming less to describe my situation.I put my head down their and pray for the best of three relations which gives life to me and also for the whole world.Then i came out and with other people .then after i found lots of things ,shops all round.Few tombs and a well was their.I went near the well .I couldn't understand what was that actually.Soon I came outside the Dargah praying for the welfare of humanity and all living creatures over earth and everywhere.

Java prgramming-Month Name in java

2011-02-24T23:48:00.000+05:30

import java.util.Calendar;
public class Month {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String months[]={"January","February","March","April","May","June","July","August","September","Octomber","November","December"};

Calendar cal =Calendar.getInstance();
String month=months[cal.get(Calendar.MONTH)];
System.out.println("month is "+month);

}

}

Calendar in java

2011-02-24T23:36:00.000+05:30

import java.util.Calendar;
public class Calendar_1
{
public static void main(String[] argv)
{
Calendar cal = Caleendar.getInstance();
System.out.println("Year "+cal.get(Calendar.YEAR));
System.out.println("Month "+cal.get(Calendar.MONTH));
System.out.println("Day "+cal.get(Calendar.DAY_OF_WEEK));
System.out.println("Week "+cal.get(Calendar.WEEK_OF-MONTH));
System.out.println("hour "+cal.get(Calendar.HOUR_OF_DAY));
System.out.println("Minute"+cal.get(Calendar.MINUTE_OF_DAY));
System.out.println("Seconds "+cal.get(Calendar.SECOND_OF_DAY));
}
}
Result will be:
Year 2011
Month
Day 55
Day of Week 24
Week of month 4
Hour 23
Minute 36
Second 45

Programming in Java-Get memory

2011-02-24T23:16:00.000+05:30

public class Memory{
public static void main(String args[])
{
System.out.println("total Memory is "+Runtime.getRuntime.totalMemory());
System.out.println("freeMemory is "+Runtime.getRuntime.freelMemory());
System.out.println("maximum Memory is "+Runtime.getRuntime.maxMemory());
}
output will be:
total memory is 5177344
free memory is 4996952
maximum memory is 66620112

Code in Java to Get Host name

2011-02-24T22:07:00.001+05:30

import java.io;
import java.net;
public class GetHost{
public static void main(String args[])
{
try{
InetAddress addr=Inetaddress.getLocalHost();
byte[] ipaddr=addr.getAddress();
String hostName=addr.getHostname();
System.out.println("HostName="+hostName);
}
catch(UnknowHostException e)
{
}

Funny Programming Quotes

2011-02-19T12:52:00.000+05:30

1 “The first 90% of the code accounts for the first 90% of the development time. The remaining 10% of the code accounts for the other 90% of the development time.” – Tom Cargil

2 “In order to understand recursion, one must first understand recursion.” – Author Unknown
3 “I have always wished for my computer to be as easy to use as my telephone; my wish has come true because I can no longer figure out how to use my telephone.” – Bjarne Stroustrup
4 “A computer lets you make more mistakes faster than any other invention in human history, with the possible exceptions of handguns and tequila.” – Mitch Ratcliffe

5 “There are two ways of constructing a software design: One way is to make it so simple that there are obviously no deficiencies, and the other way is to make it so complicated that there are no obvious deficiencies. The first method is far more difficult.” -C.A.R. Hoare

6 “The gap between theory and practice is not as wide in theory as it is in practice.” – Author Unknown

7 “If builders built buildings the way programmers wrote programs, then the first woodpecker that came along would destroy civilization.” – Gerald Weinberg

8 “If debugging is the process of removing software bugs, then programming must be the process of putting them in.” – Edsger Dijkstra

9“Measuring programming progress by lines of code is like measuring aircraft building progress by weight.” – Bill Gates

10 “Programming today is a race between software engineers striving to build bigger and better idiot-proof programs, and the Universe trying to produce bigger and better idiots. So far, the Universe is winning.” – Rich Cook

11 “There are two major products that come out of Berkeley: LSD and UNIX. We don’t believe this to be a coincidence.” – Jeremy S. Anderson

12 “Before software can be reusable it first has to be usable.” – Ralph Johnson

Tips For Interviews

2011-02-17T23:01:00.000+05:30

I have appeared 4 times in technical interviews and almost cleared two of them.nd Here are some tips to follow during an interview:
1.Be calm and confident.
2.Give respect to interviewer
3.Dont give wrong answer intentionally.Say i Dont know if you really Dont know the correct answer.
4.Dont feel nervous in front of him/her.
5.Give your introduction in ENGLISH fluently.
LLlaLater on i will continue to share my personal experiences with you people .
Best of Luck!!!

Few Golden Sentense

2011-02-02T21:44:00.001+05:30

] Prayer is not a "spare wheel" that you pull out when in trouble; it is a "steering wheel" that directs us in the right path throughout life.

2] Do you know why a car's WINDSHIELD is so large & the rear view mirror is so small? Because our PAST is not as important as our FUTURE. So, look ahead and move on.

3] Friendship is like a BOOK. It takes few seconds to burn, but it takes years to write.

4] Allthings in life are temporary. If going is well enjoy it, they will not last forever. If going is wrong don’t worry, they can't last long either.

5] Old friends are like Gold! New friends are Diamonds! If you get a Diamond, don't forget the Gold! Because to hold a Diamond, you always need a base of Gold!

6] Often when we lose hope and think this is the end, GOD smiles from above and says, "Relax, sweetheart, it's just a bend, not the end!

7] When GOD solves your problems, you have faith in HIS abilities; when GOD doesn't solve your problems HE has faith in your abilities.

8] A blindperson asked St. Anthony: "Can there be anything worse than losing eye sight?" He replied: "Yes, losing your vision."

9] When you pray for others, God listens to you and blesses them; and sometimes, when you are safe and happy, remember that someone has prayed for you.

10] WORRYING does not take away tomorrow's TROUBLES; it takes away today’s PEACE.

Windows AZURE

2011-01-30T19:13:00.000+05:30

Building out an infrastructure that supports your web service or application can be expensive, complicated and time consuming. Forecasting the highest possible demand. Building out the network to support your peak times. Getting the right servers in place at the right time, managing and maintaining the systems.

Or you could look to the Microsoft cloud. The Windows Azure platform is a flexible cloud–computing platform that lets you focus on solving business problems and addressing customer needs. No need to invest upfront on expensive infrastructure. Pay only for what you use, scale up when you need capacity and pull it back when you don’t. We handle all the patches and maintenance — all in a secure environment with over 99.9% uptime.

Silverlight-

2011-01-29T22:01:00.000+05:30

An Overview of Silverlight

Silverlight enables development of the next generation of Microsoft .NET-based media experiences and rich interactive applications (RIAs) for the Web. Silverlight is delivered as a cross-platform and cross-browser plug-in that exposes a programming framework and features that are a subset of the .NET Framework and Windows Presentation Foundation (WPF).

The .NET Framework

Microsoft introduced the .NET Framework in 2000 as a new approach to software development. The .NET Framework borrowed ideas from the best practices in the software industry as well as brought new ideas to the table in an effort to meet developer needs and requests.

Virtually all programming languages manage data at some point. The primary reason that communication between applications created using C++, Visual Basic, Visual FoxPro, and other languages was difficult was because each language stored data being managed in a unique set of data types. For example, an integer in one language may not represent an integer in another language. Data needed to be converted to common data types to communicate between languages.

The .NET Framework introduced a common set of data types (the Common Type System) that is used by all .NET-compliant languages (C++, Visual Basic, C#, etc). Thus all languages can easily intercommunicate. Furthermore, all .NET-compliant languages render a common result when compiling code, Microsoft Intermediate Language (MSIL). (see footnote) MSIL can be deployed to any platform running the Common Language Runtime (CLR). Currently, the CLR is only available for Microsoft Windows although an open source version of the CLR was created for Linux (called the Mono Project). Code written by using the .NET Framework is compiled instead of interpreted resulting in much better performance than Java and competing technologies.

Microsoft took the Web development industry by storm with their .NET upgrade to ASP. ASP.NET put a new face on Web development through a compiled code architecture and improved state management and it provides access to the full functionality of the .NET Framework. ASP.NET is built around XML, supports the latest Web development standards, and allows for the creation of advanced Web Services.

The .NET Framework also provides improved data access and database integration through ADO.NET. For more information, see MSDN.

There are many more features and benefits of the .NET Framework than those mentioned here. The .NET Framework has become the leading software development environment available.

Introducing Silverlight

What's New in the .NET Framework

As of the writing of this course, version 3.5 of the .NET Framework has been released. Version 3.5 includes features that encompass all facets of Windows, Web, and network development:

Includes just under 10,000 classes, methods, and properties.
Complies with the latest Web development standards.
Introduces revolutionary technologies used in Windows Vista development, rich media and user experiences, workflow management, security and authorization, and complete distributed communication protocols.

The .NET Framework can also be fully extended by developers to create custom classes and types. The functionality of the .NET Framework spans the server, the workstation, and the Web. The four primary additions to the .NET Framework as of version 3.0 are:

Windows Presentation Foundation (WPF)
Windows Communication Foundation (WCF)
Windows Workflow Foundation (WF)
CardSpace

Silverlight Architecture

Unlike ASP.NET, the bulk of Silverlight processing occurs on the client machine thus decreasing server resource utilization and improving the Web experience on the client. The figure below shows the difference between ASP.NET processing and Silverlight processing:

When a client initially attempts to run a Silverlight application, if the Silverlight plug-in has not been installed on the client machine, it will be downloaded and installed. Upon subsequent requests to run the application, the application will instantiate on the client machine and make requests for resources from the server only when necessary. The Silverlight plug-in can be thought of as a scaled-down version of the full .NET Framework. It only contains those classes and functionality that are applicable to a Silverlight Web client and those were streamlined and optimized for use on the Web client machine.

Silverlight was designed using the same design paradigm as ASP.NET. Each page of a Silverlight application includes an associated code behind file that includes the code that handles events fired by the page. Silverlight resembles WPF in that it uses Extensible Application Markup Language (XAML) to construct the user interface (presentation layer). As Silverlight applications are composed of text-based files that include markup and code, they can be created using any text editor; however, more advanced tools and development environments such as Visual Studio or Expression Blend simplify the task significantly.

Silverlight Technologies

Version 1.0 of Silverlight used JavaScript and supported the industry-leading Windows Media Services enabling delivery of audio and video that includes 2D and vector graphics.

Version 2 includes all features of version 1.0 and:

support for the .NET Framework.
support for .NET-compliant programming languages such as C#, Visual Basic, Python, and Ruby.
support for database operations and language-integrated query (LINQ).

The figure below illustrates the major differences between version 1.0 and version 2:

Further information regarding SilverLight :

The Microsoft Silverlight deployment guide can be downloaded athttp://download.microsoft.com/download/7/8/d/78da8ec9-8801-42e5-89e5-3809386f1316/Silverlight%20Deployment%20Guide.doc.

Fobiaaaaa Type and their meanings

2011-01-24T22:51:00.000+05:30

'Hippopotomonstrosesquippedaliophobia' is the fear of long words.
Didaskaleinophobia is the fear of going to school.
Phobatrivaphobia is a fear of trivia about phobias
Ablutophobia - Fear of washing or bathing.
Acarophobia - Fear of itching or of the insects that cause itching.
Acerophobia - Fear of sourness.
Achluophobia - Fear of darkness.
Acousticophobia - Fear of noise.
Aeroacrophobia - Fear of open high places.
Aeronausiphobia - Fear of vomiting secondary to airsickness.
Aerophobia - Fear of drafts, air swallowing, or airborne noxious substances.
Agliophobia - Fear of pain.
Agoraphobia - Fear of open spaces or of being in crowded, public places like markets. Fear of leaving a safe place. Fear of crowds.
Agraphobia - Fear of sexual abuse.
Agrizoophobia - Fear of wild animals.
Agyrophobia - Fear of streets or crossing the street.
Aichmophobia - Fear of needles or pointed objects.
Ailurophobia - Fear of cats.
Albuminurophobia - Fear of kidney disease.
Alektorophobia - Fear of chickens.
Algophobia - Fear of pain.
Alliumphobia - Fear of garlic.
Allodoxaphobia - Fear of opinions.
Altophobia - Fear of heights.
Amathophobia - Fear of dust.
Amaxophobia - Fear of riding in a car.
Ambulophobia - Fear of walking.
Amnesiphobia - Fear of amnesia.
Amychophobia - Fear of scratches or being scratched.
Anablephobia - Fear of looking up.
Ancraophobia - Fear of wind.
Androphobia - Fear of men.
Anemophobia - Fear of air drafts or wind.
Anemophobia - Fear of wind.
Anginophobia - Fear of angina, choking of narrowness.
Anglophobia - Fear of England, English culture, ect. Angrophobia - Fear of becoming angry.

Best practices in developing ASP.NET applications

2011-01-24T21:52:00.000+05:30

Best practices in developing ASP.NET applications

Remove unused private fields and functions.
Do not cast unnecessarily. Avoid duplicate casts where possible, since there is a cost associated with them.
Properties that return arrays are prone to code inefficiencies. Consider using a collection or making this a method.
To test for empty strings, check if String.Length is equal to zero. Constructs such as "".Equals(someString) and String.Empty.Equals(someString) are less efficient than testing the string length. Replace these with checks forsomeString.Length == 0.
Methods in the same type that differ only by return type can be difficult for developers and tools to properly recognize. When extending a type, be sure not to define new methods that differ from base type methods only by type.
Use stringbuilder instead of string types for string manipulation.
Use String.Format instead of concatenating and appending strings.
Use Type.TryParse rather than Convert.ToDestinationType(). For example, useint.TryParse() rather than Convert.ToInt32() which might throw an exception.
Override Equals() method wherever applicable in your classes.
Consider passing base types as parameters - Using base types as parameters to methods improves re-use of these methods if you only use methods & properties from the parameter's base class. E.g. use Stream instead of FileStream as a parameter when only calling Stream.Read(), this makes the method work on all kind of streams instead of just File streams.
Do not catch general exception types - You should not catch Exception orSystemException. Catching generic exception types can hide run-time problems from the library user, and can complicate debugging. You should catch only those exceptions that you can handle gracefully.
Use properties instead of visible instance fields.
Follow the same naming conventions accross the solution.
Remove unwanted commented code, indent code properly.
Use curly braces with in an if statement, even if there is a single statement in the ifblock. This will provide better readability.
Make sure to refactor your code to move the duplicated code to common reusable functions.
Move one time control settings into the .aspx page rather than having them in the code behind in if(!IsPostback) block.
Use inheritance wherever possible, which enables code reuse and also reduces the amount of code we have to write and test.
Move the reusable JavaScript functions to an external .js file instead of having them on the page.
For controls that are declaratively specified on the page, tie the event handlers to the controls events on the aspx page rather than initializing them in the codebehind. If the controls are built dynamically, then we do not have a choice.
Make sure to check for nulls when using any type retrieved from a session, querystring or a database to avoid NullReferenceExceptions.
Use foreach loop instead of using for loop which may lead to out of boundary run time exceptions.

Visualization and Comparison of sorting algorithms in in C#

2011-01-24T21:49:00.000+05:30

Introduction

The first thing I consider to be most important to understand is what sorting algorithms are. According to Wikipedia, the sorting algorithm is algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output.

In this article I will describe some sorting algorithms. All algorithms presented here have been written in C# and a lot of ideas are based on algorithms you can find on Wikipedia

Sorting algorithms

Bubble Sort

Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. The equally simple insertion sort has better performance than bubble sort, so some have suggested no longer teaching the bubble sort.

public IList BubbleSort(IList arrayToSort) { int n = arrayToSort.Count - 1; for (int i = 0; i < n; i++) { for (int j = n; j > i; j--) { if (((IComparable)arrayToSort[j - 1]).CompareTo(arrayToSort[j]) > 0) { object temp = arrayToSort[j - 1]; arrayToSort[j - 1] = arrayToSort[j]; arrayToSort[j] = temp; RedrawItem(j); RedrawItem(j - 1); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); } } } return arrayToSort; }
BiDirectional Bubble Sort

public IList CombSort(IList arrayToSort)
{
    int gap = arrayToSort.Count;
    int swaps = 0;

    do
    {
        gap = (int)(gap / 1.247330950103979);
        if (gap < 1)
        {
            gap = 1;
        }
        int i = 0;
        swaps = 0;

        do
        {
            if (((IComparable)arrayToSort[i]).CompareTo(arrayToSort[i + gap]) > 0)
            {
                object temp = arrayToSort[i];
                arrayToSort[i] = arrayToSort[i + gap];
                arrayToSort[i + gap] = temp;
                RedrawItem(i);
                RedrawItem(i + gap);
                pnlSamples.Refresh();
                if (chkCreateAnimation.Checked)
                    SavePicture();
                swaps = 1;
            }
            i++;
        } while (!(i + gap >= arrayToSort.Count));

    } while (!(gap == 1 && swaps == 0));

    return arrayToSort;
}

public IList CombSort(IList arrayToSort)
{
    int gap = arrayToSort.Count;
    int swaps = 0;

    do
    {
        gap = (int)(gap / 1.247330950103979);
        if (gap < 1)
        {
            gap = 1;
        }
        int i = 0;
        swaps = 0;

        do
        {
            if (((IComparable)arrayToSort[i]).CompareTo(arrayToSort[i + gap]) > 0)
            {
                object temp = arrayToSort[i];
                arrayToSort[i] = arrayToSort[i + gap];
                arrayToSort[i + gap] = temp;
                RedrawItem(i);
                RedrawItem(i + gap);
                pnlSamples.Refresh();
                if (chkCreateAnimation.Checked)
                    SavePicture();
                swaps = 1;
            }
            i++;
        } while (!(i + gap >= arrayToSort.Count));

    } while (!(gap == 1 && swaps == 0));

    return arrayToSort;
}
Cocktail sort, also known as bidirectional bubble sort, cocktail shaker sort, shaker sort (which can also refer to a variant of selection sort), ripple sort, shuttle sort or happy hour sort, is a variation of bubble sort that is both a stable sorting algorithm and a comparison sort. The algorithm differs from bubble sort in that it sorts in both directions on each pass through the list. This sorting algorithm is only marginally more difficult to implement than bubble sort, and solves the problem with so-called turtles in bubble sort.
The first rightward pass will shift the largest element to its correct place at the end, and the following leftward pass will shift the smallest element to its correct place at the beginning. The second complete pass will shift the second largest and second smallest elements to their correct places, and so on. After i passes, the first i and the last i elements in the list are in their correct positions, and do not need to be checked. By shortening the part of the list that is sorted each time, the number of operations can be halved.

public IList BiDerectionalBubleSort(IList arrayToSort)
{

    int limit = arrayToSort.Count;
    int st = -1;
    bool swapped = false;
    do
    {
        swapped = false;
        st++;
        limit--;

        for (int j = st; j < limit; j++)
        {
            if (((IComparable)arrayToSort[j]).CompareTo(arrayToSort[j + 1]) > 0)
            {
                object temp = arrayToSort[j];
                arrayToSort[j] = arrayToSort[j + 1];
                arrayToSort[j + 1] = temp;
                swapped = true;
                RedrawItem(j);
                RedrawItem(j + 1);
                pnlSamples.Refresh();
                if(chkCreateAnimation.Checked)
                    SavePicture();

            }
        }
        for (int j = limit - 1; j >= st; j--)
        {
            if (((IComparable)arrayToSort[j]).CompareTo(arrayToSort[j + 1]) > 0)
            {
                object temp = arrayToSort[j];
                arrayToSort[j] = arrayToSort[j + 1];
                arrayToSort[j + 1] = temp;
                swapped = true;
                RedrawItem(j);
                RedrawItem(j + 1);

                pnlSamples.Refresh();
                if (chkCreateAnimation.Checked)
                    SavePicture();

            }
        }

    } while (st < limit && swapped);

    return arrayToSort;
}

Bucket Sort

Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, and is a cousin of radix sort in the most to least significant digit flavour. Bucket sort is a generalization of pigeonhole sort. Since bucket sort is not a comparison sort, the O(n log n) lower bound is inapplicable. The computational complexity estimates involve the number of buckets.
Bucket sort works as follows:

Set up an array of initially empty "buckets."

Scatter: Go over the original array, putting each object in its bucket.

Sort each non-empty bucket.

Gather: Visit the buckets in order and put all elements back into the original array.

public IList BucketSort(IList arrayToSort) { if (arrayToSort == null || arrayToSort.Count == 0) return arrayToSort; object max = arrayToSort[0]; object min = arrayToSort[0]; for (int i = 0; i < arrayToSort.Count; i++) { if (((IComparable)arrayToSort[i]).CompareTo(max) > 0) { max = arrayToSort[i]; } if (((IComparable)arrayToSort[i]).CompareTo(min) < 0) { min = arrayToSort[i]; } } ArrayList[] holder = new ArrayList[(int)max - (int)min + 1]; for (int i = 0; i < holder.Length; i++) { holder[i] = new ArrayList(); } for (int i = 0; i < arrayToSort.Count; i++) { holder[(int)arrayToSort[i] - (int)min].Add(arrayToSort[i]); } int k = 0; for (int i = 0; i < holder.Length; i++) { if (holder[i].Count > 0) { for (int j = 0; j < holder[i].Count; j++) { arrayToSort[k] = holder[i][j]; RedrawItem(k); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); k++; } } } return arrayToSort; }
Comb Sort

Comb sort is a relatively simplistic sorting algorithm originally designed by Wlodzimierz Dobosiewicz in 1980. Later it was rediscovered and popularized by Stephen Lacey and Richard Box with a Byte Magazine article published in April 1991. Comb sort improves on bubble sort, and rivals algorithms like Quicksort. The basic idea is to eliminate turtles, or small values near the end of the list, since in a bubble sort these slow the sorting down tremendously. (Rabbits, large values around the beginning of the list, do not pose a problem in bubble sort.).
In bubble sort, when any two elements are compared, they always have a gap (distance from each other) of 1. The basic idea of comb sort is that the gap can be much more than one.
The gap starts out as the length of the list being sorted divided by the shrink factor (generally 1.3), and the list is sorted with that value (rounded down to an integer if needed) for the gap. Then the gap is divided by the shrink factor again, the list is sorted with this new gap, and the process repeats until the gap is 1. At this point, comb sort continues using a gap of 1 until the list is fully sorted. The final stage of the sort is thus equivalent to a bubble sort, but by this time most turtles have been dealt with, so a bubble sort will be efficient.
public IList CombSort(IList arrayToSort) { int gap = arrayToSort.Count; int swaps = 0; do { gap = (int)(gap / 1.247330950103979); if (gap < 1) { gap = 1; } int i = 0; swaps = 0; do { if (((IComparable)arrayToSort[i]).CompareTo(arrayToSort[i + gap]) > 0) { object temp = arrayToSort[i]; arrayToSort[i] = arrayToSort[i + gap]; arrayToSort[i + gap] = temp; RedrawItem(i); RedrawItem(i + gap); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); swaps = 1; } i++; } while (!(i + gap >= arrayToSort.Count)); } while (!(gap == 1 && swaps == 0)); return arrayToSort; }

Cycle Sort

Cycle sort is an in-place, unstable sorting algorithm, a comparison sort that is theoretically optimal in terms of the total number of writes to the original array, unlike any other in-place sorting algorithm. It is based on the idea that the permutation to be sorted can be factored into cycles, which can individually be rotated to give a sorted result.
Unlike nearly every other sort, items are never written elsewhere in the array simply to push them out of the way of the action. Each value is either written zero times, if it's already in its correct position, or written one time to its correct position. This matches the minimal number of overwrites required for a completed in-place sort.
public IList CycleSort(IList arrayToSort) { int writes = 0; for (int cycleStart = 0; cycleStart < arrayToSort.Count; cycleStart++) { object item = arrayToSort[cycleStart]; int pos = cycleStart; do { int to = 0; for (int i = 0; i < arrayToSort.Count; i++) { if (i != cycleStart && ((IComparable)arrayToSort[i]).CompareTo(item) < 0) { to++; } } if (pos != to) { while (pos != to && ((IComparable)item).CompareTo(arrayToSort[to]) == 0) { to++; } object temp = arrayToSort[to]; arrayToSort[to] = item; RedrawItem(to); item = temp; RedrawItem(cycleStart); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); writes++; pos = to; } } while (cycleStart != pos); } return arrayToSort; }

Gnome Sort
Gnome sort, originally proposed by Hamid Sarbazi-Azad in 2000 and called Stupid sort, and then later on described by Dick Grune and named "Gnome sort", is a sorting algorithm which is similar to insertion sort, except that moving an element to its proper place is accomplished by a series of swaps, as in bubble sort.
It is conceptually simple, requiring no nested loops. The running time is O(n²), but tends towards O(n) if the list is initially almost sorted. In practice the algorithm can run as fast as Insertion sort. The average runtime is O(n²)
The algorithm always finds the first place where two adjacent elements are in the wrong order, and swaps them. It takes advantage of the fact that performing a swap can introduce a new out-of-order adjacent pair only right before or after the two swapped elements. It does not assume that elements forward of the current position are sorted, so it only needs to check the position directly before the swapped elements.
public IList GnomeSort(IList arrayToSort) { int pos = 1; while (pos < arrayToSort.Count) { if (((IComparable)arrayToSort[pos]).CompareTo(arrayToSort[pos - 1]) >= 0) { pos++; } else { object temp = arrayToSort[pos]; arrayToSort[pos] = arrayToSort[pos - 1]; RedrawItem(pos); arrayToSort[pos - 1] = temp; RedrawItem(pos - 1); RefreshPanel(pnlSamples); if (savePicture) SavePicture(); if (pos > 1) { pos--; } } } return arrayToSort; }
Heap Sort

Heapsort begins by building a heap out of the data set, and then removing the largest item and placing it at the end of the partially sorted array. After removing the largest item, it reconstructs the heap, removes the largest remaining item, and places it in the next open position from the end of the partially sorted array. This is repeated until there are no items left in the heap and the sorted array is full. Elementary implementations require two arrays - one to hold the heap and the other to hold the sorted elements.
Heapsort inserts the input list elements into a binary heap data structure. The largest value (in a max-heap) or the smallest value (in a min-heap) are extracted until none remain, the values having been extracted in sorted order. The heap's invariant is preserved after each extraction, so the only cost is that of extraction.
During extraction, the only space required is that needed to store the heap. To achieve constant space overhead, the heap is stored in the part of the input array not yet sorted.
Heapsort uses two heap operations: insertion and root deletion. Each extraction places an element in the last empty location of the array. The remaining prefix of the array stores the unsorted elements.
public IList HeapSort(IList list) { for (int i = (list.Count - 1) / 2; i >= 0; i--) Adjust(list, i, list.Count - 1); for (int i = list.Count - 1; i >= 1; i--) { object Temp = list[0]; list[0] = list[i]; list[i] = Temp; RedrawItem(0); RedrawItem(i); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); Adjust(list, 0, i - 1); } return list; } public void Adjust(IList list, int i, int m) { object Temp = list[i]; int j = i * 2 + 1; while (j <= m) { if (j < m) if (((IComparable)list[j]).CompareTo(list[j + 1]) < 0) j = j + 1; if (((IComparable)Temp).CompareTo(list[j]) < 0) { list[i] = list[j]; RedrawItem(i); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); i = j; j = 2 * i + 1; } else { j = m + 1; } } list[i] = Temp; RedrawItem(i); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); }
Insertion Sort
If the first few objects are already sorted, an unsorted object can be inserted in the sorted set in proper place. This is called insertion sort. An algorithm consider the elements one at a time, inserting each in its suitable place among those already considered (keeping them sorted). Insertion sort is an example of an incremental algorithm. It builds the sorted sequence one number at a time. This is perhaps the simplest example of the incremental insertion technique, where we build up a complicated structure on n items by first building it on n − 1 items and then making the necessary changes to fix things in adding the last item. The given sequences are typically stored in arrays. We also refer the numbers as keys. Along with each key may be additional information, known as satellite data.
public IList InsertionSort(IList arrayToSort) { for (int i = 1; i < arrayToSort.Count; i++) { object val = arrayToSort[i]; int j = i - 1; bool done = false; do { if (((IComparable)arrayToSort[j]).CompareTo(val) > 0) { arrayToSort[j + 1] = arrayToSort[j]; RedrawItem(j + 1); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); j--; if (j < 0) { done = true; } } else { done = true; } } while (!done); arrayToSort[j + 1] = val; RedrawItem(j + 1); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); } return arrayToSort; }
Merge Sort
Conceptually, a merge sort works as follows
If the list is of length 0 or 1, then it is already sorted. Otherwise:

Divide the unsorted list into two sublists of about half the size.

Sort each sublist recursively by re-applying merge sort.

Merge the two sublists back into one sorted list.

Merge sort incorporates two main ideas to improve its runtime:
A small list will take fewer steps to sort than a large list.

Fewer steps are required to construct a sorted list from two sorted lists than two unsorted lists. For example, you only have to traverse each list once if they're already sorted (see the merge function below for an example implementation).

public IList MergeSort(IList a, int low, int height) { int l = low; int h = height; if (l >= h) { return a; } int mid = (l + h) / 2; MergeSort(a, l, mid); MergeSort(a, mid + 1, h); int end_lo = mid; int start_hi = mid + 1; while ((l <= end_lo) && (start_hi <= h)) { if (((IComparable)a[l]).CompareTo(a[start_hi]) < 0) { l++; } else { object temp = a[start_hi]; for (int k = start_hi - 1; k >= l; k--) { a[k + 1] = a[k]; RedrawItem(k + 1); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); } a[l] = temp; RedrawItem(l); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); l++; end_lo++; start_hi++; } } return a; }
Odd-Even Sort
Odd-even sort is a relatively simple sorting algorithm. It is a comparison sort based on bubble sort with which it shares many characteristics. It functions by comparing all (odd, even)-indexed pairs of adjacent elements in the list and, if a pair is in the wrong order (the first is larger than the second) the elements are switched. The next step repeats this for (even, odd)-indexed pairs (of adjacent elements). Then it alternates between (odd, even) and (even, odd) steps until the list is sorted. It can be thought of as using parallel processors, each using bubblesort but starting at different points in the list (all odd indices for the first step). This sorting algorithm is only marginally more difficult than bubble sort to implement.
public IList OddEvenSort(IList arrayToSort) { bool sorted = false; while (!sorted) { sorted = true; for (var i = 1; i < arrayToSort.Count - 1; i += 2) { if (((IComparable)arrayToSort[i]).CompareTo(arrayToSort[i + 1]) > 0) { object temp = arrayToSort[i]; arrayToSort[i] = arrayToSort[i + 1]; RedrawItem(i); arrayToSort[i + 1] = temp; RedrawItem(i+1); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); sorted = false; } } for (var i = 0; i < arrayToSort.Count - 1; i += 2) { if (((IComparable)arrayToSort[i]).CompareTo(arrayToSort[i + 1]) > 0) { object temp = arrayToSort[i]; arrayToSort[i] = arrayToSort[i + 1]; arrayToSort[i + 1] = temp; RedrawItem(i); RedrawItem(i+1); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); sorted = false; } } } return arrayToSort; }
Pigeonhole Sort
Pigeonhole sorting, also known as count sort (not to be confused with counting sort), is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the number of possible key values (N) are approximately the same. It requires O(n + N) time.
The pigeonhole algorithm works as follows:
Given an array of values to be sorted, set up an auxiliary array of initially empty "pigeonholes," one pigeonhole for each key through the range of the original array.

Going over the original array, put each value into the pigeonhole corresponding to its key, such that each pigeonhole eventually contains a list of all values with that key.

Iterate over the pigeonhole array in order, and put elements from non-empty pigeonholes back into the original array.

public IList PigeonHoleSort(IList list) { object min = list[0], max = list[0]; foreach (object x in list) { if (((IComparable)min).CompareTo(x) > 0) { min = x; } if (((IComparable)max).CompareTo(x) < 0) { max = x; } Thread.Sleep(speed); } int size = (int)max - (int)min + 1; int[] holes = new int[size]; foreach (int x in list) holes[x - (int)min]++; int i = 0; for (int count = 0; count < size; count++) while (holes[count]-- > 0) { list[i] = count + (int)min; RedrawItem(i); i++; RefreshPanel(pnlSamples); Thread.Sleep(speed); } return list; }
Quick Sort
Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists. The steps are:
Pick an element, called a pivot, from the list.

Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.

Recursively sort the sub-list of lesser elements and the sub-list of greater elements.

The base case of the recursion are lists of size zero or one, which never need to be sorted.
public IList QuickSort(IList a, int left, int right) { int i = left; int j = right; double pivotValue = ((left + right) / 2); int x = (int)a[int.Parse(pivotValue.ToString())]; while (i <= j) { while (((IComparable)a[i]).CompareTo(x) < 0) { i++; } while (((IComparable)x).CompareTo(a[j]) < 0) { j--; } if (i <= j) { object temp = a[i]; a[i] = a[j]; RedrawItem(i); i++; a[j] = temp; RedrawItem(j); j--; pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); } } if (left < j) { QuickSort(a, left, j); } if (i < right) { QuickSort(a, i, right); } return a; }
Selection Sort
The algorithm works as follows:
Find the minimum value in the list

Swap it with the value in the first position

Repeat the steps above for the remainder of the list (starting at the second position and advancing each time)

Effectively, the list is divided into two parts: the sublist of items already sorted, which is built up from left to right and is found at the beginning, and the sublist of items remaining to be sorted, occupying the remainder of the array.
Collapse
public IList SelectionSort(IList arrayToSort)
{ int min; for (int i = 0; i < arrayToSort.Count; i++) { min = i; for (int j = i + 1; j < arrayToSort.Count; j++) { if (((IComparable)arrayToSort[j]).CompareTo(arrayToSort[min]) < 0) { min = j; } } object temp = arrayToSort[i]; arrayToSort[i] = arrayToSort[min]; arrayToSort[min] = temp; RedrawItem(i); RedrawItem(min); pnlSamples.Refresh(); if (chkCreateAnimation.Checked) SavePicture(); } return arrayToSort; }

Join our Community - Astronomy.com - Online Community, Forums, Media Galleries, Blogs

2011-01-24T14:24:00.000+05:30

Join our Community - Astronomy.com - Online Community, Forums, Media Galleries, Blogs

Sirius and Orion

2011-01-24T14:14:00.001+05:30

Sending e-mail using C#

2011-01-23T16:52:00.000+05:30

Protocols:-its a group of rules that communicates with each other from network
SMTP-Simple Mail Transfer Protocol. Its a protocol used to send e-mails .
MTA-Mail Transfer Agent. its a mail server that communicates with other server and clients to fetch mails.
MUA-Mail User Agent. Its an application that lets he user to create and read mails.

Namespaces we used;
System
System.Net.Sockets
System.IO
We used sockets ns to connect to MTA by tcpclient class, IO ns to receive and send the information arrived to netstream object.
You can find the members of our class below

Member Name	Description
mvarSMTPServerAddress	�fully qualified domain name� or the ip address of the MTA (string)
mvarSenderName	The sender name that will shown in MUA (string)
mvarSenderEmailAddress	The sender email account that we'll inform to MTA. (string)
mvarRecipientName	The recipient name that will shown in MUA (string)
mvarRecipientEmailAddress	The recipient email account that we'll inform to MTA (string)
mvarEmailSubject	Subject of our email (string)
mvarEmailBody	The body of our email (string)
mvarSMTPTimeOut	Timeout in seconds. (int, default=60)
mvarSMTPRemotePort	The port number of the MTA (int, default=25)
SendEmail	The method that sends the email. (bool)

</center>

We've set the default values of our two properties in our default constructor method.

public SMTPMailSender()
{
mvarSMTPTimeOut = 60;
mvarSMTPRemotePort = 25;
}

Let'shave a look at the heart of our class, the SendEmail() method.

1- We connect to MTA
The method will return a false value at any line if any error occurs.This willhelp us to know that the mail is sent successfully or not.

tclSMTP=new TcpClient();
try
{
tclSMTP.Connect(mvarSMTPServerAddress,mvarSMTPRemotePort);
}
catch
{
return false;
}

If you look at the code above the method willreturn false value if the connection to the mta fails.

2- After our connection is ready, we create an instance of the networkstream tohandle the incoming/outgoing tcpip traffic.To send and receive stringinformation via the networkstream object, we create the streamwriter and thestreamreader classes.

nstSMTP=tclSMTP.GetStream();
stwSMTP=new StreamWriter(nstSMTP);
strSMTP=new StreamReader(nstSMTP);

3- All of our tools for communicating with mta is ready so we can make astart.As i have mentioned in the beginning of this article we'll use the SMTPprotocol.
I'll explain the WaitForResponse method later so it is ok for you to know thatthis method waits for the mta response.

//mta'dan kar��lama mesaj� bekleniyor
//waiting for greeting message from MTA
if (WaitForResponse("220"))
{
//mta'ya kar��lama mesaj� g�nderiliyor
//sending greeting message to MTA
stwSMTP.WriteLine("HELO " + mvarSMTPServerAddress);
stwSMTP.Flush();
}
else
{
tclSMTP.Close();
return false;
}

Asyou can see above if we get the 220 response from the mta "HELOmail.somemta.com" message is being sent.If any problem occurs in theWaitForResponse method the connection will be closed and the SendEmail() methodwill return false.

The rest of the protocol messages will be send and the responses will bereceived just the same as the above code.The only difference will be the messagethat we send and the response we received.

Nowwe'll have a look at our WaitForResponsemethod;

bool WaitForResponse(string strResponseCode)
{
//zamana��m� kontrol� i�in mevcut tarih saat bilgisi al�n�yor
//gathering current date time data for timeout check
dteTimeOutCheck=DateTime.Now;
//zamana��m� de�eri bulunuyor
//calculating timeout value
TimeSpan tsp=DateTime.Now-dteTimeOutCheck;
//zamana��m� de�eri kullan�c�n�n belirledi�i de�eri a��ncaya kadar d�ng� �al��t�r�l�yor
//looping code until the timeout exceeds the user defined value
while(tsp.Seconds<mvarSMTPTimeOut)
{
//MTA bize herhangi bir mesaj g�ndermi� mi kontrol ediliyor.
//checking if MTA has sent a message to us
if (nstSMTP.DataAvailable)
{
//e�er g�ndermi��se mesaj okunuyor
//if so, get the message
string strIncomingData=strSMTP.ReadLine();
//gelen bilginin protokol numaras� istenen koda uyuyormu kontrol ediliyor
//checking if the requested protocol number matches the server response
if (strIncomingData.Substring(0,strResponseCode.Length)==strResponseCode)
return true;
}
//zamana��m� de�eri yeniden hesaplan�yor
//recalculating the timeout value
tsp=DateTime.Now-dteTimeOutCheck;
}
return false;
}

As you can see this method takes a string parameter, strResponseCode.
This parameter represents the first 3 char of the response we wait from the MTA.
Remember that when we connect with the telnet application we were sendingcommands and waiting for the mta's "250 ok" responses.By sending thefirst 3 char to this method we understand tht the mta has successfully receivedour message and sent us the ok command.If this method returns false weunderstand tht some problem occured and we cut off the connection.

At this stage the only thing we should consider is the timeout property and howwe'll understand the timeout is exceeded or not.
Mta can end the connection by any reason or we can have a network problem.If sohow we'll solve this problem.If we do not create a timeout mechanizm and we havea network connectivity problem the WaitForResponse method will wait until we endour program.This will not be a good solution.

We should store the current datetime value to a variable and check if thedifference exceeds the timeout value.

//zamana��m� kontrol� i�in mevcut tarih saat bilgisi al�n�yor
//gathering current date time data for timeout check
dteTimeOutCheck=DateTime.Now;
//zamana��m� de�eri bulunuyor
//calculating timeout value
TimeSpan tsp=DateTime.Now-dteTimeOutCheck;
//zamana��m� de�eri kullan�c�n�n belirledi�i de�eri a��ncaya kadar d�ng� �al��t�r�l�yor
//looping code until the timeout exceeds the user defined value
while(tsp.Seconds<mvarSMTPTimeOut)
{
�
�
//zamana��m� de�eri yeniden hesaplan�yor
//recalculating the timeout value
tsp=DateTime.Now-dteTimeOutCheck;
}

We store the current datetime value to the dteTimeOutCheck variable.
Using the TimeSpan class we can find out the difference between ourdteTimeOutCheck value and the current datetime and if the difference exceeds thetimeout value we return a false value telling the outer block thatWaitForResponse method failed.

Have a look at the following code;

tyle="border:1pt solid windowtext;padding:0in 5.4pt;width:6.45in;" valign="top" width="619">//MTA bize herhangi bir mesaj g�ndermi� mi kontrol ediliyor.
//checking if MTA has sent a message to us
if (nstSMTP.DataAvailable)
{
//e�er g�ndermi��se mesaj okunuyor
//if so, get the message
string strIncomingData=strSMTP.ReadLine();
//gelen bilginin protokol numaras� istenen koda uyuyormu kontrol ediliyor
//checking if the requested protocol number matches the server response
if (strIncomingData.Substring(0,strResponseCode.Length)==strResponseCode)
return true;
}
//zamana��m� de�eri yeniden hesaplan�yor
//recalculating the timeout value
tsp=DateTime.Now-dteTimeOutCheck;

We check that if there is any data waiting to be received in the first line.

At first look this line seems unneccessary.Even we can think that we can write asmaller code with just using �strSMTP.ReadLine()�.Correct but not all thetime.
If we have any problem with the mta or any problem occurs in the protocol flowyou'll see how important this line is.

Assume that we are waiting the 250 response from the mta and somehow the mtaresponded us as "502 unimplemented".
If we do not use the nstSMTP.DataAvailable check we'll receive the 502 commandand because of the 502 is not the message we are waiting for we'll continue towait.If this scenario happens you'll continue waiting the 250 command in thesecond loop.You will wait because the strSMTP.ReadLine() command waits until hehas received any message.Finally you won't reach to the checkpoint of thetimeout mechanizm until the mta sends us the message we wait.
Beleive me it's good to write more code, thinking all the possibilities thanwriting a small but unsafe code.

Yahooo, the last stage , testing the code.
Copy the following code and do not forget to change the mta recipient senderproperties.

using System;
namespace SendMailviaSMTP
{
class Class1
{
[STAThread]
static void Main(string[] args)
{
SMTPMailSender sm=new SMTPMailSender();
sm.SMTPTimeOut=10;
sm.SenderEmailAddress="lyildiz@somemta.com";
sm.RecipientEmailAddress="leventyildiz@gmail.com";
sm.SMTPServerAddress="mail.somemta.com";
sm.SenderName="Levent YILDIZ ACME Inc";
sm.RecipientName="Levent YILDIZ MINDSTORM Inc";
sm.EmailSubject="Test subject";
sm.EmailBody="Test Body";
if (sm.SendEmail())
{
Console.WriteLine("Email has been sent successfully.");
}
else
{
Console.WriteLine("Problem occured.");
}
}
}
}

Mp3 player in c#

2011-01-23T16:43:00.000+05:30

1 import winmm.dll
2 write the code as given below

private string _command;
private bool isOpen;
[DllImport("winmm.dll")]

private static extern long mciSendString(string strCommand,StringBuilder strReturn,int iReturnLength, IntPtr hwndCallback);

public void Close()
{
   _command = "close MediaFile";
   mciSendString(_command, null, 0, IntPtr.Zero);
   isOpen = false;
}
public void Open(string sFileName)
{
   _command = "open \"" + sFileName + "\" type mpegvideo alias MediaFile";
   mciSendString(_command, null, 0, IntPtr.Zero);
   isOpen = true;
}
public void Play(bool loop)
{
   if(isOpen)
   {
   _command = "play MediaFile";
   if (loop)
   _command += " REPEAT";
   mciSendString(_command, null, 0, IntPtr.Zero);
   }
}