int select() is also useful when there are multiple sockets and an application has to recieve data from them , select solves this problem while polling all the sockets to see if they are available for reading,writing & non-blocking operations.

Generally scanf() ignores the spaces,backslash n,tabs etc while taking input from the user, but by using scanset specifiers we are able to deal with this problem.
scanset specifiers are represented by %[].
whether we want to right a character or a string, both can be done by specifying it in these square brackets.

Let us take some cases:
char arr[15];
1. scanf(“%[a-z]c”,&arr);
2. scanf(“%[a-z]s”,&arr);

According to this- %[]is a scanset specifier & by writing a-z means only a-z characters can be given as input, nothing else.
c is specifying that only a character can be taken at a time as an input.
Whereas in 2nd case by writing s we are allowing a string to be taken as input.

3. scanf(“%[^\n]s”,&arr);
By using ^ we are telling that while writing a string, the time when we enter,scanf only takes a string upto that enter.That means it will allow all things as n input except newline. It can count spaces, tabs etc.

4. scanf(“%[^\t]s”, &arr);
this will stop taking input when it gets a tab.

5. scanf(“%[^24]“, &arr);
this would take input till 24 or 2 or 4 not encountered.

1.2
date 2015.02.28.09.26.43; author root; state Exp;
branches;
next 1.1;

1.1
date 2015.02.27.12.00.41; author root; state Exp;
branches;
next ;

desc
@@

1.2
log
@this program is about binary search.
@
text
@#include
#define MAX 4

int main()
{
int l=0;
int h= MAX;
int i;

int key;
int arr[MAX];
printf(“enter the array”);
for(i=0;i<MAX;i++)
{

scanf("%d", &arr[i]);
}
for(i=0;i<MAX;i++)
{
printf("%d=%d:\n", i,arr[i]);
}
printf("enter the key element \n");
scanf("%d", &key);
int m;
while(l<=h)
{
m=(l+h)/2;

if(key==arr[m])
{
printf("key element is found");
break;
}
else if (keyarr[m]&& m<l)
{
l=m+1;
printf("true");
}

else
{
printf("key element is not found");
break;

}

}
return 0;
}

@

1.1
log
@Initial revision
@
text
@d2 2
d6 22
a27 3
int l=0;
int h=9;
int i;
d29 25
a53 32
int key;
int arr[10];
printf("enter the array");
for(i=0;i<10;i++)
{

scanf("%d", &arr[i]);
}
for(i=0;i<10;i++)
{
printf("%d=%d:\n", i,arr[i]);
}
printf("enter the key element \n");
scanf("%d", &key);
while(l<=h)
{
bint m=(l+h)/2;
if(key==arr[m])
{
printf("key element is found");
break;
}
else if(keyarr[m])
l=m+1;

else if(key!=arr[m])

printf(“key element is not found”);
}
return 0;

a54 1

@

1.2
date 2002.01.01.01.04.00; author root; state Exp;
branches;
next 1.1;

1.1
date 2002.01.01.00.56.25; author root; state Exp;
branches;
next ;

desc
@used tem variable to interchange the position.
array is reversed with the help of temp variable.
@

1.2
log
@initialised temp=0
reversing of array is successfully completed.
@
text
@#include
int main()
{
int i=0;
int arr[10];
int temp=0;

printf(“enter the array elements\n”);
for(i=0;i<=10;i++)
{
scanf("%d", &arr[i]);
}
for(i=0;i<=10;i++)
{ printf(" array is %d:%d\n", i,arr[i]);

}

for(i=0;i<5;i++)
{
temp = arr[i];
arr[i]= arr[10-i-1];
arr[10-i-1] = temp;
}

for(i=0;i<=10;i++)
printf("array is %d:%d\n", i,arr[i]);

return 0;
}

@

1.1
log
@Initial revision
@
text
@d4 1
a4 1
int i;
d6 1
a6 1
int temp;
@

1,4 Top