|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
Binary Exponential Backoff Algorithm was chosen to dynamically adapt to the number of stations trying to send. If the randomization interval for all collision was 1023 slots, the chance of two stations colliding for a second time would be negligible, but the average wait after a collision would be hundreds of slot times, introducing significant delay. On the other hand, if each station always delayed for either 0 or 1 slot, then if 100 stations ever tried to send at once, they would collide over and over until 99 of them picked 1 and the remaining station picked 0. This may take years. But having the randomization interval grow exponentially as more and more consecutive collisions occur, the algorithm ensures a low delay when only a few stations collide but also ensures that the collision is resolved in a reasonable interval when many stations collide. Truncating the backoff at 1023 keeps the bound from growing too large.
Create Date
:
Monday, January 07, 2008
Click here
to improve the Interview Question, Answer and other fields.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
On AIX use --
groups -To Display full list
id -G - To display group id number
On Solaris use --
groups - To display full list
id -a - To diaplsy full list of groups with group id numbers
Create Date
:
Wednesday, March 19, 2008
Click here
to improve the Interview Question, Answer and other fields.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
Test s for prime or not?
#include<stdio.h>
void main(void)
{
int no,rem,cnt;
Printf("enter No");
scanf("%d",&no);
cnt=2;
while(cnt<=no)
{
rem=no % cnt;
if (rem==0)
{
printf("No is not prime");
exit(0);
}
cnt++;
}
printf("No is Prime");
}
Create Date
:
Thursday, October 16, 2008
Click here
to improve the Interview Question, Answer and other fields.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
main()
{
int n,row=1,col=40,i=0,j,k=0,count=1;
int a[10];
clrscr();
i=n-1;
printf(" WELCOME TO THE PROGRAM SIR/MADAM
<BR>);
printf("Pyramid of how many numbers? ");
scanf("%d",&n);
for (j=0;j<n;j++)
{
printf("Enter no.:- ");
scanf("%d",&a[j]);
}
clrscr();
for (row=n;row>=1;row--)
{
k=0;
k=40-(4*(row-1));
i=row-1;
for (col=40;col>=k;col=(col-4))
{
gotoxy(col,row);
printf("%d",a[i]);
--i;
}
}
for (count=n;count>=1;count--)
{
k=0;
k=40+(4*(count-1));
i=count-1;
for (col=40;col<=k;col=(col+4))
{
gotoxy(col,count);
printf("%d",a[i]);
--i;
}
}
getch();
}
Create Date
:
Thursday, October 16, 2008
Click here
to improve the Interview Question, Answer and other fields.