Register
Filter

Answers by sandygate

3 votes
1
Graph
If a graph requires k different colors for its proper coloring, then chromatic number of the graph is (a) 1 (b) k (c) k-1 (d) k/2
If a graph requires k different colors for its proper coloring, then chromatic number of the graph is(a) 1(b) k(c) k-1(d) k/2
0 votes
2
made easy test series
what is the value of z? #include <stdio.h> int main() { int a[]={3,5,6,4}; int z=0; for (int y=0;y<(sizeof(a)/sizeof int);y++) z=a[y]+value(a[y]); } int value(int *x) { static int count; while(*x) { count=count+*x&1; *x>>1 ; } }
what is the value of z?#include <stdio.h>int main() { int a[]={3,5,6,4}; int z=0; for (int y=0;y<(sizeof(a)/sizeof int);y++) z=a[y]+value(a[y]);}int valu...