Alim Ul Karim's Blog

C Programming Introduction in Bangla

2015-01-09T05:38:00.001+08:00

C Programming Introduction in Bangla

by Alim Ul karim | group link https://www.facebook.com/groups/c.prog.alim/

It's a series in Bangla language to choose C as your first programming language. Please stay tuned at our programming group C Programming Group in Bangla . If you like us then please share the video and please like us on facebook Developers Organism facebook page .

Email me if needed : alim{at} developers-organism.com

C Programming in Bangla or Bengali :

Search Labels:

Programming in C,

Bangla Programming in C,

Programming in C with Alim Ul Karim

C Programming in Bangla,

Bangla,

Bengali,

C Language,

Small Search Engine Project For NSU CSE 373

2013-05-09T08:26:00.001+08:00

Acknowledgement

Firstly, I would like to take immense pleasure in thanking Dr. Nova Ahmed for permitting me to complete a project on Search Engine using C#.NET.

Throughout the project I have learned a lot and it was really a great experience. Experience that I had gained throughout will not be a part of my life, if Dr. Nova hasn’t permitted me in the first place. So all the credit goes to our excellent faculty of North South University Dr. Nova Ahmed.

Finally, I would like to express my heartfelt thanks to my beloved parents for their blessings and my friends/classmates for their help and wishes to try my best in this project.

Abstract

(How the information has been processed)

First I have used Flash CS5.5 to design the user interface. In addition, I have used C#.NET 4, Entity framework 5, Microsoft LinQ and SQL Express to develop this software. For core programming, I have used pure C#.NET with its CLR libraries. To communicate with database, I have used Object Relational Model (ORM) as Entity framework and Microsoft LinQ. I have also made learning video on linq and entity framework 5. For additional helps I have used google, stackoverflow and so on.

Introduction

(What is the project is about)

The primary goal of the project was to make a search engine that can search text files data from all nested folders inside a given folder. First, the search algorithm should look for the exact given text and then if not found then look for single parts without escape sequences (i.e. ‘I’,’am’,’was’,’were’ and so on) and then search for pluralize syntax or singularize syntax from a given dictionary. Finally, list the files as if found by those given search phrases.

Presentation : http://www.mediafire.com/view/?rzw2hiyqdd3i6kj
Report : http://www.mediafire.com/view/?588q63m7zmw38jc
Published Project : http://www.mediafire.com/download.php?bqd22nywr8ptvb0
Source Code : http://www.mediafire.com/download.php?phq66123ia8lc1y

Difference among IEnumerable , IQueryable, ICollection,IList, List

2012-08-31T16:55:00.003+08:00

INHERITANCE LIST:

IEnumerable (most basic)
IEnumerable-> IQueryable<T>
IEnumerable-> List<T> (just an output format, and while it implements IEnumerable<T>, is not directly related to querying or IQueryable. )
IEnumerable-> ICollection<T>
IEnumerable-> ICollection<T> -> IDictionary (An IDictionary implementation is a collection of key-and-value pairs, like theHashtable class. )
IEnumerable-> ICollection<T> -> IList (An IList implementation is a collection of values that can be sorted and whose members can be accessed by index, like the ArrayList class. In addition, IList implementations fall into three categories: read-only, fixed-size, variable-size. A read-only IList cannot be modified. A fixed-size IList does not allow the addition or removal of elements, but it allows the modification of existing elements. A variable-size IList allows the addition, removal and modification of elements.)
If neither the IDictionary interface nor the IList interface meet the requirements of the required collection, derive the new collection class from the ICollection interface instead for more flexibility.
Some collections that limit access to their elements, like the Queue class and the Stack class, directly implement the ICollection interface.

Approaches/Facilities List of IEnumerable , IQueryable, ICollection,IList, List:

Difference among IEnumerable<T> , IQueryable<T>, ICollection<T>,IList<T>, List<T>:

In this topic I am going discuss about IEnumerable<T> , Iqueryable<T> , ICollection<T>, IList<T>, List<T> generic’s pros and cons with fine tune differences in use of terms.IEnumerable<T> , Iqueryable<T> , ICollection<T>, IList<T>, List<T> are collected from various sites like stackoverflow , msdn etc. This topic is a general summarization of those generics objects.

IENUMERABLE<T>:

Pros

1. The most generic item of all.

2. Still might use deferred execution.

3. IEnumerable is best suitable for working with queries later on. It helps best when we try to add more queries with our previous one and we do not want to run our previous query in realtime but when we requested it or iterated through those or finally passing as a .ToList() object .

4. IEnumerable does not run query until it is requested by iteration.

Cons

1. IEnumerable doesn’t move between items, it is forward only collection as LinkedList. You can't get at "item 4" without passing items 0-3.

2. Read-only list, you can't add to it or remove from it.

3. Actually the model binder is not able to bind an enumerable because it is a too generic Interface, and it is not able to choose a concrete class to create that implements the IEnumerable.

IQUERYABLE<T>:

Pros

1. Query isn't executed until to really iterate over the items, maybe by doing a .ToList()

2. IQueryable best suits for remote data source, like a database or web service. IQueryable is a very powerful feature that enables a variety of interesting deferred execution scenarios (like paging and composition based queries).

Cons

1. avoid passing IQueryable to Views

2. It is not a good place to handle errors...so better getting rid of delayed execution before passing to Views.

ICOLLECTION<T>:

Is between IEnumerable and IList. In addition, is the base of IList and IDictionary Objects.

Pros

1. Considered the most basic type for collections.

2. The System.Xml.Serialization.XmlSerializer class has specific requirements for types that implement ICollection and System.Collections.IEnumerable in order to be serializable.

3. Inherited from IEnumerable<T>.

4. Collection<T> , IList<T>, IDictionary all are inherited from this, so we have flexibility.

5. Base of IList and IDictionary Object.

6. Add, Delete and modify items in the collection is acceptable.

7. Some collections that limit access to their elements, like the Queue class and the Stack class, directly implement the ICollection interface.

8. Normally in EF table relationships we use this ICollection in virtual keyword.

Cons

1. ICollection doesn’t have indexing like IList does.

ILIST<T>:

Pros

1. Random access to the full list(like an ArrayList)

2. Entirely in memory

3. Best for model binding.

4. Supports adding and removing but for only variable-size one.

5. An IList implementation is a collection of values that can be sorted and whose members can be accessed by index, like the ArrayList class.

6. In addition, IList implementations fall into three categories:

a) Read-only: (A read-only IList cannot be modified)

b) Fixed-size: (A fixed-size IList does not allow the addition or removal of elements, but it allows the modification of existing elements.)

c) Variable-size: (A variable-size IList allows the addition, removal and modification of elements.)

Cons

1. Memory Consuming.

LIST<T>:

Propertise

1. Implements : IList<T>, ICollection<T>, IEnumerable<T>, IList, ICollection, IEnumerable

Pros

1. The List<T> class is the generic equivalent of the ArrayList class. It implements the IList<T> generic interface using an array whose size is dynamically increased as required.

2. In deciding whether to use the List<T> or ArrayList class, both of which have similar functionality, remember that the List<T> class performs better in most cases and is type safe.

3. Methods such as BinarySearch and Sort use an ordering comparer for the list elements. The default comparer for type T is determined as follows. If type T implements the IComparable<T> generic interface, then the default comparer is the CompareTo(T) method of that interface; otherwise, if type T implements the nongeneric IComparable interface, then the default comparer is the CompareTo(Object) method of that interface. If type T implements neither interface, then there is no default comparer, and a comparer or comparison delegate must be provided explicitly.

Cons

1. List<T> accepts null as a valid value for reference types and allows duplicate elements.

2. The List<T> is not guaranteed to be sorted. You must sort the List<T> before performing operations (such as BinarySearch) that require the List<T> to be sorted.

READONLYCOLLECTION<T>

Propertise

1. Implements : IList<T>, ICollection<T>, IEnumerable<T>, IList, ICollection, IEnumerable

Example

List<string> dinosaurs = new List<string>();

dinosaurs.Add("Tyrannosaurus");

dinosaurs.Add("Amargasaurus");

dinosaurs.Add("Deinonychus");

dinosaurs.Add("Compsognathus");

ReadOnlyCollection<string> readOnlyDinosaurs =

new ReadOnlyCollection<string>(dinosaurs);

SUMMARY

Non-Generic	Similar Generic Type
ArrayList	List<T>
Hashtable	Dictionary<TKey,TValue>
SortedList	SortedList<TKey,TValue>
Queue	Queue<T>
Stack	Stack<T>
IEnumerable	IEnumerable<T>
ICollection	IEnumerable<T> and System.Xml.Serialization.XmlSerializer
N/A	ICollection<T>
IList	IList<T>
CollectionBase	Collection<T>
ReadOnlyCollectionBase	ReadOnlyCollection<T>
DictionaryBase	N/A (just implement IDictionary<TKey,TValue>
N/A	SortedDictionary<TKey,TValue>
N/A	KeyedCollection<TKey,TItem>
N/A	LinkedList<T>

IEnumerable

2012-08-31T15:45:00.001+08:00

IEnumerable<T>:

Pros

1. The most generic item of all.

2. Still might use deferred(execute when needed) execution.

3. IEnumerable is best suitable for working with in-memory collection.

Cons

1. IEnumerable doesn’t move between items, it is forward only collection as LinkedList. You can't get at "item 4" without passing items 0-3.

2. Read-only list, you can't add to it or remove from it.

3. Actually the model binder is not able to bind an enumerable because it is a too generic Interface, and it is not able to choose a concrete class to create that implements the IEnumerable.

What is IEnumerable? , Pros and Cons of IEnumerable

SEO Labels for IEnumerable<T>?:

IEnumerable ,

IEnumerable<T> ,

IEnumerable<T> Pros and Cons ,

Pros and Cons ,

Pros and Cons of IEnumerable ,

**Pros and Cons of IEnumerable<T>** ,

**Cons of IEnumerable<T>** ,

**Pros of IEnumerable<T>** ,

**Benefits of using IEnumerable<T>**

Inheritance List of IEnumerable

2012-08-31T14:25:00.003+08:00

Inheritance List IEmurable:

IEnumerable (most basic) everything inherits from interface.
IEnumerable-> IQueryable<T>(means IQueryable<T> inherits from IEnumerable<T>)
IEnumerable-> List<T> (just an output format, and while it implements IEnumerable<T>, is not directly related to querying or IQueryable. )
IEnumerable-> ICollection<T>
IEnumerable-> ICollection<T> -> IDictionary (An IDictionary implementation is a collection of key-and-value pairs, like theHashtable class. )
IEnumerable-> ICollection<T> -> IList (An IList implementation is a collection of values that can be sorted and whose members can be accessed by index, like the ArrayList class. In addition, IList implementations fall into three categories: read-only, fixed-size, variable-size. A read-only IList cannot be modified. A fixed-size IList does not allow the addition or removal of elements, but it allows the modification of existing elements. A variable-size IList allows the addition, removal and modification of elements.)
If neither the IDictionary interface nor the IList interface meet the requirements of the required collection, derive the new collection class from the ICollection interface instead for more flexibility.
Some collections that limit access to their elements, like the Queue class and the Stack class, directly implement the ICollection interface.

Inheritance List of IEnumerable, Inheritance List of IList, Inheritance List of ICollection , Inheritance List of IDictionary:

SEO Labels for Inheritance List Of IEnumerable:

Inherihance of IEnumerable<T> ,

IEnumerable<T> Inheritance List ,

Inheritance ,

Inherit ,

IEnumerable ,

IList ,

ICollection ,

IDictionary

Put MyComputer/Computer in Windows 7's/Windows Vista Taskbar/Task-bar

2011-11-20T04:39:00.001+08:00

Put MyComputer/Computer in Windows 7's/Windows Vista Taskbar/Task-bar:

It is very easy , right click on the folder icon in the taskbar and then right click on the "Windows Explorer" item and then click on the properties. Which will give you a display like below:

Put MyComputer/Computer in Windows 7's/Windows Vista Taskbar/Task-bar 1

And then to put MyComputer/Computer in Windows 7's/Windows Vista Taskbar/Task-bar

replace that target link with this below line:

"%windir%\explorer.exe shell:MyComputerFolder"

Put MyComputer/Computer in Windows 7's/Windows Vista Taskbar/Task-bar 2

So, I am assuming that you have successfully implemented it. Therefore, you can visit your my computer using that "Windows Explorer" shortcut.

Install VS2010 SP1

2011-11-09T21:45:00.002+08:00

Install VS2010 SP1

If you had tried many times installing Visual Studio 2010(VS 2010) Service Pack 1(SP1) and failed then this is is the right place for you. As you may have already known that you must keep the installation of VS2010 Beta or VS2010 Ultimate to install the VS2010 SP1.

So now, I am assuming that you have already installed VS2010 Beta or VS2010 Ultimate and besides this you should download Visual Studio 2010 SP1 ISO Format (my recommendation) or the Microsoft Web Platform Installer ( if you use .iso format then you should install this as a next step for latest features) to install Visual Studio 2010 SP1. And once again you will be failed again installing Visual Studio 2010 SP1(Service Pack 1), so what's wrong again? My answer is 'nothing'; you did everything you could but unfortunately microsoft made some mistakes in their repositories and that is why your installation is not going well. So what is the solution to your problem? Actually , it is pretty easy , and to solve your problem you have to download two more components to make it work . One of them is Entity Framework 4.1 (must install to complete the VS2010 SP1 installation process) and the other one is Microsoft ADO.NET Entity Framework Feature ( second important component to complete the installation ).

Hopefully , it will help and work(run Microsoft Web Platform Installer to see if it is successfully done) and if it doesn't then please leave a feedback, I will help you as soon as possible.

Download:

Visual Studio 2010 SP1
Visual Studio 2010 SP1 ISO Format
Microsoft Web Platform Installer
Entity Framework 4.1 (must install to complete the VS2010 SP1 installation process)
Microsoft ADO.NET Entity Framework Feature ( second important component to complete the installation )

-------------------------------------------------------------------------------------------------

Search Engine Friendly Links:

Search Engine Friendly Labels:

VS2010 SP1 ,

VS2010 Service Pack 1 ,

Visual Studio 2010 Ultimate SP1 ,

Visual Studio 2010 Ultimate Service Pack1 ,

Visual Studio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 SP1 ,

VisualStudio Ultimate 2010 SP1 ,

VS2010SP1 ,

VS2010 SP1 Installation ,

VS2010 Service Pack1 Installation Failed

How to install VS 2010 SP 1

2011-10-29T00:36:00.001+08:00

How to install VS 2010 SP 1

Hopefully , it will help and work(run Microsoft Web Platform Installer to see if it is successfully done) and if it doesn't then please leave a feedback, I will help you as soon as possible.

Download:

Visual Studio 2010 SP1
Visual Studio 2010 SP1 ISO Format
Microsoft Web Platform Installer
Entity Framework 4.1 (must install to complete the VS2010 SP1 installation process)
Microsoft ADO.NET Entity Framework Feature ( second important component to complete the installation )

-------------------------------------------------------------------------------------------------

Search Engine Friendly Links:

Search Engine Friendly Labels:

VS2010 SP1 ,

VS2010 Service Pack 1 ,

Visual Studio 2010 Ultimate SP1 ,

Visual Studio 2010 Ultimate Service Pack1 ,

Visual Studio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 SP1 ,

VisualStudio Ultimate 2010 SP1 ,

VS2010SP1 ,

VS2010 SP1 Installation ,

VS2010 Service Pack1 Installation Failed

Swapping

2011-10-20T13:10:00.000+08:00

Swapping

There are many ways to handle a swap operation; moreover, people have reason to believe that bitwise swapping is faster and more efficient than other methods; however, I strongly disagree with them. Only with the oldest microprocessor, people can have their desire effectiveness using bitwise operation but in modern processor architecture, bitwise operations can perform as faster as adding or subtracting operation. Consequently, for bitwise operators like XOR(^) have more operations than simple addition or subtraction ; as a result , it seems that addition is the best way to go.

Please save the file in (.cpp) format for Code::Blocks, Code:

/* | Author : Alim Ul Karim |

| Email : auk.junk@live.com |

| Portfolio : auk-port.webs.com |

| Blog : bit.ly/auk-blog |

|------------------------------------------|

| Code tested on CodeBlocks , GCC Compiler |

| Example of Swapping in C/C++, Save in .cpp |

|------------------------------------------|

#include <stdio.h>

//using third variable

void swap_based_on_address(int *a, int *b){

if ( *a == *b ){ return;}

int temp = *a;

*a = *b;

*b = temp;

}

//using third variable

void swap_based_on_address(int &a, int &b){

if ( a == b ){ return;}

int temp = a;

a = b;

b = temp;

}

//using without using third variable, XOR(Bitwise Swapping)

void swap_using_xor(int &a, int &b){

//no need to change if a=b, and this condition is must for XOR

if ( a == b ){ return;}

a = a ^ b;

b = a ^ b;

a = a ^ b;

}

//using without using third variable, using addition and subtraction

void swap_using_add(int &a, int &b){

//no need to change if a=b

if ( a == b ){ return;}

a = a + b;

b = a - b;

a = a - b;

}

//using without using third variable, using multiplication , division

void swap_using_division(int &a, int &b){

//no need to change if a=b

if( a == b ){ return;}

a = a * b;

b = a / b;

a = a / b;

}

int main(){

// save file as a .cpp format

int a = 10 , b = 12;

int backup_a = a , backup_b = b;

swap_based_on_address(&a , &b);

printf("swapping using memory location :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a

, backup_b , a ,b);

a = backup_a, b = backup_b;

swap_based_on_address(a , b); // save file as a .cpp format

printf("swapping using memory location by sending only value to a function :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a , backup_b , a ,b);

a = backup_a, b = backup_b;

swap_using_xor(a , b); // save file as a .cpp format

printf("Swap using XOR :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a , backup_b ,

a ,b);

a = backup_a, b = backup_b;

swap_using_add(a , b); // save file as a .cpp format

printf("Swap using addition, subtraction :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" ,

backup_a , backup_b , a ,b);

a = backup_a, b = backup_b;

swap_using_division(a , b); // save file as a .cpp format

printf("Swap using multiplication, division :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" ,

backup_a , backup_b , a ,b);

return 0;

}

----------------------------------------------------------------------------------------------------------------------------------

Search Engine Friendly Links:

Author:

Search Engine Friendly Labels:

Swapping ,

Swap,

Swap using addition and subtraction,

Swapping using addition and subtraction ,

Swapping using addition without the third variable ,

Swapping numbers in C ,

Swapping variables in C ,

Swapping variables in C++ ,

Swap variables in C++ ,

Swap variables in C,

Swapping without using the third varible in C ,

Swap variable using bitwise operator ,

Swap variable using XOR operator ,

Swap variable using division operator ,

Swap variable using multiplication operator ,

Swap variable using XOR (^) operator ,

Swap XOR ,

XOR(^)

Swap in C

2011-10-20T13:08:00.002+08:00

Swap in C

Please save the file in (.cpp) format for Code::Blocks, Code:

/* | Author : Alim Ul Karim |

| Email : auk.junk@live.com |

| Portfolio : auk-port.webs.com |

| Blog : bit.ly/auk-blog |

|------------------------------------------|

| Code tested on CodeBlocks , GCC Compiler |

| Example of Swapping in C/C++, Save in .cpp |

|------------------------------------------|

#include <stdio.h>

//using third variable

void swap_based_on_address(int *a, int *b){

if ( *a == *b ){ return;}

int temp = *a;

*a = *b;

*b = temp;

}

//using third variable

void swap_based_on_address(int &a, int &b){

if ( a == b ){ return;}

int temp = a;

a = b;

b = temp;

}

//using without using third variable, XOR(Bitwise Swapping)

void swap_using_xor(int &a, int &b){

//no need to change if a=b, and this condition is must for XOR

if ( a == b ){ return;}

a = a ^ b;

b = a ^ b;

a = a ^ b;

}

//using without using third variable, using addition and subtraction

void swap_using_add(int &a, int &b){

//no need to change if a=b

if ( a == b ){ return;}

a = a + b;

b = a - b;

a = a - b;

}

//using without using third variable, using multiplication , division

void swap_using_division(int &a, int &b){

//no need to change if a=b

if( a == b ){ return;}

a = a * b;

b = a / b;

a = a / b;

}

int main(){

// save file as a .cpp format

int a = 10 , b = 12;

int backup_a = a , backup_b = b;

swap_based_on_address(&a , &b);

printf("swapping using memory location :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a

, backup_b , a ,b);

a = backup_a, b = backup_b;

swap_based_on_address(a , b); // save file as a .cpp format

printf("swapping using memory location by sending only value to a function :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a , backup_b , a ,b);

a = backup_a, b = backup_b;

swap_using_xor(a , b); // save file as a .cpp format

printf("Swap using XOR :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a , backup_b ,

a ,b);

a = backup_a, b = backup_b;

swap_using_add(a , b); // save file as a .cpp format

printf("Swap using addition, subtraction :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" ,

backup_a , backup_b , a ,b);

a = backup_a, b = backup_b;

swap_using_division(a , b); // save file as a .cpp format

printf("Swap using multiplication, division :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" ,

backup_a , backup_b , a ,b);

return 0;

}

----------------------------------------------------------------------------------------------------------------------------------

Search Engine Friendly Links:

Author:

Search Engine Friendly Labels:

Swapping ,

Swap,

Swap using addition and subtraction,

Swapping using addition and subtraction ,

Swapping using addition without the third variable ,

Swapping numbers in C ,

Swapping variables in C ,

Swapping variables in C++ ,

Swap variables in C++ ,

Swap variables in C,

Swapping without using the third varible in C ,

Swap variable using bitwise operator ,

Swap variable using XOR operator ,

Swap variable using division operator ,

Swap variable using multiplication operator ,

Swap variable using XOR (^) operator ,

Swap XOR ,

XOR(^)

Swapping Algorithms in C/C++

2011-10-20T11:54:00.000+08:00

Swapping Algorithms in C/C++

Please save the file in (.cpp) format for Code::Blocks, Code:

/* | Author : Alim Ul Karim |

| Email : auk.junk@live.com |

| Portfolio : auk-port.webs.com |

| Blog : bit.ly/auk-blog |

|------------------------------------------|

| Code tested on CodeBlocks , GCC Compiler |

| Example of Swapping in C/C++, Save in .cpp |

|------------------------------------------|

#include <stdio.h>

//using third variable

void swap_based_on_address(int *a, int *b){

if ( *a == *b ){ return;}

int temp = *a;

*a = *b;

*b = temp;

}

//using third variable

void swap_based_on_address(int &a, int &b){

if ( a == b ){ return;}

int temp = a;

a = b;

b = temp;

}

//using without using third variable, XOR(Bitwise Swapping)

void swap_using_xor(int &a, int &b){

//no need to change if a=b, and this condition is must for XOR

if ( a == b ){ return;}

a = a ^ b;

b = a ^ b;

a = a ^ b;

}

//using without using third variable, using addition and subtraction

void swap_using_add(int &a, int &b){

//no need to change if a=b

if ( a == b ){ return;}

a = a + b;

b = a - b;

a = a - b;

}

//using without using third variable, using multiplication , division

void swap_using_division(int &a, int &b){

//no need to change if a=b

if( a == b ){ return;}

a = a * b;

b = a / b;

a = a / b;

}

int main(){

// save file as a .cpp format

int a = 10 , b = 12;

int backup_a = a , backup_b = b;

swap_based_on_address(&a , &b);

printf("swapping using memory location :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a

, backup_b , a ,b);

a = backup_a, b = backup_b;

swap_based_on_address(a , b); // save file as a .cpp format

printf("swapping using memory location by sending only value to a function :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a , backup_b , a ,b);

a = backup_a, b = backup_b;

swap_using_xor(a , b); // save file as a .cpp format

printf("Swap using XOR :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" , backup_a , backup_b ,

a ,b);

a = backup_a, b = backup_b;

swap_using_add(a , b); // save file as a .cpp format

printf("Swap using addition, subtraction :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" ,

backup_a , backup_b , a ,b);

a = backup_a, b = backup_b;

swap_using_division(a , b); // save file as a .cpp format

printf("Swap using multiplication, division :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" ,

backup_a , backup_b , a ,b);

return 0;

}

----------------------------------------------------------------------------------------------------------------------------------

Search Engine Friendly Links:

Author:

Search Engine Friendly Labels:

Swapping ,

Swap,

Swap using addition and subtraction,

Swapping using addition and subtraction ,

Swapping using addition without the third variable ,

Swapping numbers in C ,

Swapping variables in C ,

Swapping variables in C++ ,

Swap variables in C++ ,

Swap variables in C,

Swapping without using the third varible in C ,

Swap variable using bitwise operator ,

Swap variable using XOR operator ,

Swap variable using division operator ,

Swap variable using multiplication operator ,

Swap variable using XOR (^) operator ,

Swap XOR ,

XOR(^)

Swapping without third variable

2011-10-20T11:18:00.000+08:00

Swapping/Swap without using third variable in C/C++

It was never been so hard to swap number variables without using third variable, however there are many ways to do it but it seems that swapping variables using addition and subtraction operators are the best way to go.

For instance, assume two number variables ‘a’ and ‘b’

a = 10; b = 12;

Now, if a = a + b; then ‘a’ would be 22. Hence, ‘a’ is a combination of ‘a’ and ‘b’ , so if ‘b’ is subtracted from ‘a’ , it will return the value of ‘a’.

a = a + b; // summation of both 22

b = a – b; // remain the ‘a’, which we are taking in b. 22 – 12 = 10

a = a – b; // remain the ‘b’, which we are taking in b. 22 – 10 = 12

Now we can see the code for swapping variables using addition (+) and subtraction (-) operator without using the third variable:

(See the code very carefully how pointers in functions can help to use the memory location to swap)

/* | Author : Alim Ul Karim |

| Email : auk.junk@live.com |

| Portfolio : auk-port.webs.com |

| Blog : bit.ly/auk-blog |

|------------------------------------------|

| Code tested on CodeBlocks , GCC Compiler |

| Example of Swapping in C/C++, Save in .cpp |

|------------------------------------------|

#include <stdio.h>

//using without using third variable, using addition and subtraction , save as .cpp file

void swap_using_add(int &a, int &b){

//no need to change if a=b

if ( a == b ){ return;}

a = a + b;

b = a - b;

a = a - b;

}

int main(){

// save as .cpp file

int a = 10 , b = 12;

int backup_a = a , backup_b = b;

swap_using_add(a , b); // save file as a .cpp format

printf("Swap using addition, subtraction :\nFrom(a=%d,b=%d) to a=%d , b=%d\n\n" ,

backup_a , backup_b , a ,b);

return 0;

}

----------------------------------------------------------------------------------------------------------------------------------

Search Engine Friendly Links:

Author:

Search Engine Friendly Labels:

Swapping ,

Swap,

Swap using addition and subtraction,

Swapping using addition and subtraction ,

Swapping using addition without the third variable ,

Swapping numbers in C ,

Swapping variables in C ,

Swapping variables in C++ ,

Swap variables in C++ ,

Swap variables in C,

Swapping without using the third varible in C

Clean up the Screen in C/C++ Using CLS

2011-08-09T18:40:00.003+08:00

How to Clean up the Screen in C/C++

To clean up your C/C++ screen you can use system("cls"). It is very understandable that some compilers does not support cls/CLS and clrscr()

/* | Author : Alim Ul Karim |

| Email : auk.junk@live.com |

| Portfolio : auk-port.webs.com |

| Blog : bit.ly/auk-blog |

|------------------------------------------|

| Code tested on CodeBlocks , GCC Compiler |

| Example of cls or clean up screen |

|------------------------------------------|

#include <stdio.h>

int main(){

printf("Before system(cls)\n");

system("cls");

printf("after system(cls)\n");

}

Author Alim Ul Karim's Related Links:

Google Alim Ul Karim
Visit Alim Ul Karim's Portfolio

Related Links :

Cls In C/C++

Clean Screen in C

System Cls in C/C++

SEO LABELS:

Clean Screen In C/C++ ,

CLS in C/C++ ,

system("cls") in C , s

ystem("cls") in C++, Cl

eanScreen in c,

clean the screen in C/C++

Send Data Using Flash

2011-08-09T17:18:00.004+08:00

Alim Ul Karim's Blog: Adobe Flash CS3,CS4,CS5 (ActionScript 3.0 AS3) - S...: "Adobe Flash CS3,CS4,CS5 (ActionScript 3.0 AS3) - Send Data (SendData) to a URL or PHP or ASP Page as Post or Get Method Example by using th..."

Alim Ul Karim's Blog: Send Data Using Flash AS3

Convert double to char[] array in C/C++

2011-08-08T13:15:00.012+08:00

How to Convert Double to Char[] Array in C/C++

It is very easy to convert double to char[] array in C or C++, we can do it by using sprintf method.
If you have no idea about sprintf , then please take a look at sprintf in cplusplus.com .

In below code , we are trying to utilize the the sprintf to get the double to get back in the char[] array in C or C++:

/* | Author : Alim Ul Karim |

| Email : auk.junk@live.com |

| Portfolio : auk-port.webs.com |

| Blog : bit.ly/auk-blog |

|------------------------------------------|

| Code tested on CodeBlocks , GCC Compiler |

| Example of Double to Char[] array |

|------------------------------------------|

#include <stdio.h>

int main(){

char c[10]; //becuase double is 8 bytes in GCC compiler but take 10 for safety

double d = -234.2341;

sprintf(c , "%lf" , d);

printf("output :: |%s|\n" , c);

}

Related Links:

Search Labels:

Double to Char[] array,

Convert Double to Char[] array,

Convert Double to Char[] array in C,

Convert Double to Char[] array in C++ ,

Convert,

double,

to,

char[]

Alim Ul Karim's Blog: Division Operation Using Minus Operator In C/C++, ...

2011-07-30T17:16:00.000+08:00

Alim Ul Karim's Blog: Division Operation Using Minus Operator In C/C++, ...: "Division Operation Using Minus Operator In C/C++, Algorithm Division Operation Using Minus Operator In C/C++, Algorithm It is not ve..."

Remainder Base Operation Using Minus In C/C++, Algorithm

2011-07-30T13:29:00.002+08:00

Remainder Base Operation Using Minus In C/C++, Algorithm

It is not very hard to write such an algorithm “Remainder Base Operation Using minus & plus Operator” in C. To accomplish our motives we can create a user-defined function, where we will use only minus to get our division result. Algorithm is the main fact for those kinds of problems. However, the algorithm is very easy to understand.

Division-by-Division Operator:

1. 9 / 3

2. 9 / 5

3. 3 / 2

We know that a division is a combination of (numerator / denominator or divisor).

Think as a simple division as above, what we do is subtract the numerator (9) by the divisor (3) each time if the numerator is not less than the divisor (3).

numerator = numerator – divisor; // (if numerator is not equal or less than the divisor)

Once we get the quotient, we can get the remainder very easily.

remainder = numerator – (quotient * divisor) ;

From that above algorithm, we can hence our code:

/* Code Written By Alim Ul Karim */

/* email : auk.junk@live.com */

#include <stdio.h>

int multiplication(int a, int b){

int i , sum = 0;

for (i = 1; i <= b ; i++ ){

// a multiplication of 5 x 6 is actually adding 5, 6 times

sum += a;

}

return sum;

}

int remainder_module(int a, int b)

{

//approximate result of the division operation between a ,b using minus

int quotient = 0;

int remainder = 0;

int x = a , y = b ;

//this condition works for positive numbers only

while (x >= y) {

x -= y;

quotient++;

}

//remainder = numerator – (quotient * divisor)

remainder = a - ( multiplication( b , quotient) );

return remainder;

}

int main(){

int x = 9;

int y = 5;

int r = remainder_module(x , y );

printf("%d" , r);

}

However, since we have a problem with the negative number so we can include 2 more conditions in our code to make it better.

Code for all numbers:

/* Code Written By Alim Ul Karim */

/* email : auk.junk@live.com */

#include <stdio.h>

int multipication(int a, int b){

int i , sum = 0;

if(a == 0 || b == 0) { return 0;}

//works for all positive numbers

if(b > -1){

for (i = 1; i <= b ; i++ ){

// a multipication of 5 x 6 is actually adding 5, 6 times

sum += a;

}

} else {

//if we assume b = -6 , we are incrementing +1 every time until we reaches the -1

for (i = b; i <= -1 ; i++ ){

sum -= a;

//printf("a=%d , b = %d , mul = %d\n" , a ,b , sum );

}

return sum;

}

int remainder_modulous(int a, int b)

{

//approximate result of the division operation between a ,b using minus

int quotient = 0;

int result_in_minus = 0;

int remainder = 0;

int x = a , y = b ;

//if one is positive and the other is negetive the result would be in negative

if( (a < 0 && b > -1) || (a > -1 && b < 0) ){

result_in_minus = 1;

}

//check if minus exist, make all positive

if (a < 0){ x = multipication(a , -1); }

if (b < 0){ y = multipication(b , -1); }

//this condition works for positive numbers only

while (x >= y) {

x -= y;

quotient++;

}

//if one is positive and the other is negetive the result would be in negative

if(result_in_minus == 1) { quotient = multipication(quotient , -1) ;}

//printf("quotient= %d\n" , quotient);

//remainder = numerator – (quotient * divisor)

remainder = a - ( multipication( b , quotient) );

return remainder;

}

int main(){

int x = -7;

int y = 5;

int r = remainder_modulous(x , y );

printf("remainder of x(%d) / y(%d) is r=%d\n" , x , y , r);

}

Remainder / Remainder in C / Remainder In C++ / modulus(%) user-defined function / modulus using custom codes / Remainder get using minus and plus or add operator only / remainder get without using %

Division Operation Using Minus Operator In C/C++, Algorithm

2011-07-30T05:37:00.003+08:00

Division Operation Using Minus Operator In C/C++, Algorithm

It is not very hard to write such a function “Division Between Two Numbers Using Without Using Division Operator” in C. To accomplish our motives we can create a user-defined function, where we will use only minus to get our division result. Algorithm is the main fact for those kinds of problems. However, the algorithm is very easy to understand.

Division-by-Division Operator:

1. 9 / 3

2. 9 / 5

3. 3 / 2

We know that a division is a combination of (numerator / denominator or divisor).

Think as a simple division as above, what we do is subtract the numerator (9) by the divisor (3) each time if the numerator is not less than the divisor (3).

numerator = numerator – divisor; // (if numerator is not equal or less than the divisor)

From that above algorithm, we can hence our code:

/* Code Written By Alim Ul Karim */

/* email : auk.junk@live.com */

#include <stdio.h>

int division(int x, int y) {

int quotient = 0;

while (x >= y) {

x -= y; // (if numerator is not equal or less than the divisor)

quotient++;

}

return quotient;

}

void main() {

int x = 9;

int y = 3;

//works fine for all positive numbers, but not for negative numbers

int r = division(x ,y); // result 1

printf("%d" , r);

}

However, since we have a problem with the negative number so we can include 2 more conditions in our code to make it better.

Code for all numbers:

/* Code Written By Alim Ul Karim */

/* email : auk.junk@live.com */

#include <stdio.h>

int division(int a, int b)

{

//approximate result of the division operation between a ,b using minus

int quotient = 0;

int result_in_minus = 0;

//if one is positive and the other is negative the result would be in negative

if ((a < 0 && b > -1) || (a > -1 && b < 0) ){

result_in_minus = 1;

}

//check if minus exist, make all positive

if (a < 0){ a = a * (-1); }

if (b < 0){ b = b * (-1); }

//this condition works for positive numbers only

while (a >= b) {

a -= b;

quotient++;

}

//if one is positive and the other is negative the result would be in negative

if(result_in_minus == 1) { quotient = quotient * -1 ;}

return quotient;

}

void main(){

int x = 9;

int y = -3;

// works for all numbers

int r = division(x , y);

printf("%d" , r);

}

See also related links from Alim Ul Karim's Blog:

SEO Labels:

Division Operation Using Minus Operator In C/C++, Algorithm

Division without Using Division Operator In C/C++, Algorithm

2011-07-30T05:22:00.002+08:00

Division without Using Division Operator In C/C++, Algorithm

It is not very hard to write such a function “Division Between Two Numbers Using Without Using Division Operator” in C. To accomplish our motives we can create a user-defined function, where we will use only minus to get our division result. Algorithm is the main fact for those kinds of problems. However, the algorithm is very easy to understand.

Division-by-Division Operator:

1. 9 / 3

2. 9 / 5

3. 3 / 2

We know that a division is a combination of (numerator / denominator or divisor).

Think as a simple division as above, what we do is subtract the numerator (9) by the divisor (3) each time if the numerator is not less than the divisor (3).

numerator = numerator – divisor; // (if numerator is not equal or less than the divisor)

From that above algorithm, we can hence our code:

/* Code Written By Alim Ul Karim */

/* email : auk.junk@live.com */

#include <stdio.h>

int division(int x, int y) {

int quotient = 0;

while (x >= y) {

x -= y; // (if numerator is not equal or less than the divisor)

quotient++;

}

return quotient;

}

void main() {

int x = 9;

int y = 3;

//works fine for all positive numbers, but not for negative numbers

int r = division(x ,y); // result 1

printf("%d" , r);

}

However, since we have a problem with the negative number so we can include 2 more conditions in our code to make it better.

Code for all numbers:

/* Code Written By Alim Ul Karim */

/* email : auk.junk@live.com */

#include <stdio.h>

int division(int a, int b)

{

//approximate result of the division operation between a ,b using minus

int quotient = 0;

int result_in_minus = 0;

//if one is positive and the other is negative the result would be in negative

if ((a < 0 && b > -1) || (a > -1 && b < 0) ){

result_in_minus = 1;

}

//check if minus exist, make all positive

if (a < 0){ a = a * (-1); }

if (b < 0){ b = b * (-1); }

//this condition works for positive numbers only

while (a >= b) {

a -= b;

quotient++;

}

//if one is positive and the other is negative the result would be in negative

if(result_in_minus == 1) { quotient = quotient * -1 ;}

return quotient;

}

void main(){

int x = 9;

int y = -3;

// works for all numbers

int r = division(x , y);

printf("%d" , r);

}

See also related links from Alim Ul Karim's Blog:
SEO Labels:
Division Operation Using Minus Operator In C/C++, Algorithm

[NSU] English 102.7 Summer 2011 Board

2011-07-01T14:37:00.004+08:00

[NSU] English 102.7 Summer 2011 Board
All details will be publish here.

Class Journal as a Home Journal Details
Date - 06-July-2011
Narrate a situation what you did in the last rainy day. This has to be a paragraph with a minimum word limit of 150 words. Give a proper title.

Quiz - 3
Date - 06-July-2011
Outlines -

RUN-ON
Fragment and
parallelism

Correct me , If I am wrong.

Stay in touch and follow my blog.
[all upcomming events about Eng 102.7 will be published here]

CSS/HTML Interview Questions

2011-06-21T22:18:00.005+08:00

CSS/HTML Interview Questions

1. What CSS means? In addition, how it works?
CSS:
How it works:

2. Which of them should work and which of them do not work to center an object horizontally (also implement the theoretical concept), explain?
(Put cross or right, left side and explain it right side)
a) Take a wrapper and style it to {margin: 0 auto; }. Explain:

b) #DIV {top: center; left:center; }. Explain:

c) #DIV {top: 50%; left:50%; right: -200px; bottom: -250px; height:500px ;weight:400}. Explain:

d) #DIV {top: 50%; left:50% }. Explain:

e) Take a wrapper and style it to {text-align:center;}. Explain:

3. How to align an object to vertically center?

4. How overlap a Flash Object?

5. How to create CSS Menu (one item would be enough)? Give an Example with HTML + CSS.

6. What do you understand by the term of selectors? Give some example.

7. How many types of styles sheets are there?

8. What do you know about Reset CSS?

9. Suppose you have an ID named “id”, class named “class”, h1 and h2 tags; now write a simple css rule for all of them at the same time.

10. What is the default CSS position for every object and the inherit does work?

11. Why specification is need in CSS Terms?

12. How to use a transparent image?

13. What float does? And What does ‘Clear’ have to do with it, explain.

14. Which cannot be negative? Which one does the outer spacing?

15. What CSS fixed position means?

16. What z-index does?

17. Write some CSS pseudo codes? And give some example of it.

18. Is CSS case sensitive?
a) Yes
b) No
19. How to use a Fixed and Repeated background using CSS?

20. What inline,block,none attribute does in the display parameter ?
Inline:
Block:
None:
21. What do you understand by the term of XHTML and HTML?
XHTML:
HTML:

CSS Center or Centering an Object

2011-06-21T22:03:00.005+08:00

CSS Center or Centering an Object

How do you center a containing block on a page using CSS? There are two main methods and the choice should be made based on whether your page layout is liquid (will move in and out depending on the size of the browser window) or fixed width.

Centering liquid layouts

Liquid layouts are easy to center using margins on each side of the containing box. The margins can be set with em, pixel or percentage units.

div#container
{
 margin-left: 10%;
 margin-right: 10%;
}

Centering fixed-width layouts

Theoretically, you should be able to apply auto margins to the left and right of the containing block and it should center on the page.

The W3C Visual formatting model states: “If both ‘margin-left’ and ‘margin-right’ are ‘auto’, their used values are equal. This horizontally centers the element with respect to the edges of the containing block.”

So, a containing block should be able to be centered using the following rules:

div#container
{
 margin-left: auto;
 margin-right: auto;
 width: 50em;
}

However, some browsers do not center the containing blocks using this method as they ignore the auto margins. These browsers include:

NN4 (Mac and Win)
Win/IE4
Win/IE5
Win/IE5.5
Win/IE6 (when in quirks-mode)

By adding two simple rules, this problem can be overcome in all of the browsers mentioned above, excluding NN4.

1. Center the body

While these browsers ignore auto margins, they will follow “text-align: center”. If this is applied to the body, the containing block will center correctly. So, a new rule is added:

body
{
 text-align: center;
}

div#container
{
 margin-left: auto;
 margin-right: auto;
 width: 50em;
}

2. Resetting text-align

The only problem with this new rule is that all content on the page is now center-aligned. To overcome the center alignment problem, a new declaration is added within the containing block rule set – “text-align: left”. The final CSS code is:

body
{
 text-align: center;
}

div#container
{
 margin-left: auto;
 margin-right: auto;
 width: 50em;
 text-align: left;
}

Alim Ul Karim's Blog: Database First Approach / DB First Approach / MVC3

2011-06-04T13:44:00.000+08:00

Alim Ul Karim's Blog: How to Create Database First in ASP.NET MVC3/MVC 3...: "If you are new in ASP . NET MVC / MVC3 or in EntityFramework ( EF ) you should look for some articles before read this topic. If you ar..."

Alim Ul Karim's Blog: Database First Approach / DB First Approach / MVC3

How to install Code::Blocks GCC Compiler / C Compiler / OpenSource Cross Platform C++ compiler Correctly in your machine(windows) / computer / pc

2011-06-01T01:00:00.002+08:00

Many of us downloaded the code blocks (codeblocks-10.05-setup.exe) 23 MB version which doesn't have any compilers , consequently all default installation doesn't give you the correct result that you have been expecting.

The correct version you should download codeblocks-10.05mingw-setup.exe which is approximately 73 MB and has GCC compilers ; which will give you the correct result that you have been expecting for.

Code Block C Compiler (light-weight) Installation Settings :

First Screen After Installing Code::Blocks

Click on that radio button and hit ok.

After Configuration First look of the Code::Blocks IDE

Making the Editor better - Font Size , Fonts etc...

see now you have better fonts and looks than before.

Now you can run your c++ or c codes from the Built Menu item.

Suppose you had installed that correct version but still your code isn't compiling , now what should you do?

Goto [Settings] -> [ Compiler and Debugger ]

You should check and follow below images to configure your code blocks compiler.

Select those options as shown.

Select as shown and hit ok.

Interview Questions: What is the difference between unique-key and primary-key in database (Oracle , Microsoft SQL Server, Access , MySQL etc)

2011-05-27T13:22:00.006+08:00

This is a mature question , I myself had faced this question in an interview but couldn't describe all the points but I was able to describe the main key point of this question "What is the difference between unique-key and primary-key in database".

The main key points of this question( "What is the difference between unique-key and primary-key in database") is below number 1,2.

1) Unique key (UK) can be null but Primary key can't be null.
2) Primary key (PK) can be referenced to other Data-tables as a Foreign(FK) but

Unique key (UK) can't play this role.

3) We can have multiple unique keys(UK) in a table but in the case of Primary key (PK) there should be only one.
4) And also a primary key creates a cluster-index by default but unique key creates a non-cluster-index by default.

More Explanation:

Primary Key is a combination of Unique and NOT NULL Constraints so it can’t have duplicate values or any null values.
Moreover in Oracle Databases, UNIQUE Key Columns can have any number of NULL values, however in MS SQL Server/ Microsoft-Access can only have one NULL value in their unique key column.

What is Foreign Key:
http://en.wikipedia.org/wiki/Foreign_key

SEO LABELS:
Related links in What is the difference between unique-key and primary-key:

SEO Labels:

Uniquekey and primarykey Difference ,

What is the difference between unique-key and primary-key ,

Interview Questions: What is the difference between unique-key and primary-key ,

Foreign ,Key, Primary ,Key, Unique, Key

Alim Ul Karim's Blog

C Programming Introduction in Bangla

C Programming Introduction in Bangla

C Programming in Bangla or Bengali :

Programming in C,

Bangla Programming in C,

Programming in C with Alim Ul Karim

C Programming in Bangla,

Bangla,

Bengali,

C Language,

Small Search Engine Project For NSU CSE 373

Difference among IEnumerable , IQueryable, ICollection,IList, List

Approaches/Facilities List of IEnumerable , IQueryable, ICollection,IList, List:

Difference among IEnumerable<T> , IQueryable<T>, ICollection<T>,IList<T>, List<T>:

IEnumerable

What is IEnumerable? , Pros and Cons of IEnumerable

IEnumerable ,

IEnumerable<T> ,

IEnumerable<T> Pros and Cons ,

Pros and Cons ,

Pros and Cons of IEnumerable ,

Pros and Cons of IEnumerable<T> ,

Cons of IEnumerable<T> ,

Pros of IEnumerable<T> ,

Benefits of using IEnumerable<T>

Inheritance List of IEnumerable

Inheritance List of IEnumerable, Inheritance List of IList, Inheritance List of ICollection , Inheritance List of IDictionary:

Inherihance of IEnumerable<T> ,

IEnumerable<T> Inheritance List ,

Inheritance ,

Inherit ,

IEnumerable ,

IList ,

ICollection ,

IDictionary

Put MyComputer/Computer in Windows 7's/Windows Vista Taskbar/Task-bar

Put MyComputer/Computer in Windows 7's/Windows Vista Taskbar/Task-bar:

Install VS2010 SP1

Install VS2010 SP1

Search Engine Friendly Links:

VS2010 SP1 ,

VS2010 Service Pack 1 ,

Visual Studio 2010 Ultimate SP1 ,

Visual Studio 2010 Ultimate Service Pack1 ,

Visual Studio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 SP1 ,

VisualStudio Ultimate 2010 SP1 ,

VS2010SP1 ,

VS2010 SP1 Installation ,

VS2010 Service Pack1 Installation Failed

How to install VS 2010 SP 1

How to install VS 2010 SP 1

Search Engine Friendly Links:

VS2010 SP1 ,

VS2010 Service Pack 1 ,

Visual Studio 2010 Ultimate SP1 ,

Visual Studio 2010 Ultimate Service Pack1 ,

Visual Studio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 Ultimate ServicePack1 ,

VisualStudio 2010 SP1 ,

VisualStudio Ultimate 2010 SP1 ,

VS2010SP1 ,

VS2010 SP1 Installation ,

VS2010 Service Pack1 Installation Failed

Swapping

Swapping

Search Engine Friendly Links:

Author:

Swapping ,

Swap,

Swap using addition and subtraction,

Swapping using addition and subtraction ,

Swapping using addition without the third variable ,

Swapping numbers in C ,

Swapping variables in C ,

Swapping variables in C++ ,

Swap variables in C++ ,

Swap variables in C,

**Pros and Cons of IEnumerable<T>** ,

**Cons of IEnumerable<T>** ,

**Pros of IEnumerable<T>** ,

**Benefits of using IEnumerable<T>**