Self Exam Numerical Ability

There are n person sitting round a table
find the number of different ways in which 3 person can be selected so that no two are neighbors...
Answer hint : 1/6*n(n-4)(n-5)

Read Solution (Total 0)

Self Other Question

What will be output of the following c program?
#include "stdio.h"
int main()
{
int _ = 5;
int __ = 10;
int ___;
___ = _ + __;
printf("%i", ___);
return 0;
} Find the number of 4- letter words,that can be formed from the letters of the word "ALLAHABAD"