Q. Minimun number of comparison required to compute the largest and second largest element in array is

View solution

Q. The information about an array used in a program will be sorted in

View solution

Q. In which of the following cases, linked list implementation of sparse matrices consumes the same memory space as the conventional way of storing the entire array?

View solution

Q. The minmum number of inter changes needed to convert the array 89,19,40,17,12,10,2,5,7,11,6,9,70 into a heap with maximum element at the root is

View solution

Q. The  const  feature can be applied to

View solution

Q. Choose the correct statement among the following:

View solution

Q. If storage class is missing in the array definition, by default it will be taken to be

View solution

Q. Consider the array definition

int num [10] =  {3, 3, 3};

Pick the Correct answers

View solution

Q. Consider the following type definition.

typedef char x[10];

x myArray[5];

What will sizeof(myArray)  be ? (Assume one character occupies 1 byte)

View solution

Q. While passing an array as an actual argument, the function call must have the array name

View solution

Q. The following program

main( )
{
static int a[ ] = { 7, 8, 9 } ;
printf( "%d", 2[ a ] + a[ 2 ] ) ;
}

View solution

Q. The parameter passing mechanism for an array is

View solution

Q. Consider the statement

int val[2] [4] = { 1, 2, 3, 4, 5, 6, 7, 8} ;

4 will be the value of

View solution

Q. The maximum number of dimension an array can have in C is

View solution

Q. Under which of the following conditions, the size of an one-dimensional array need not be specified?

View solution

Q. If a two dimensional array is used as a formal parameter, then

View solution

Q. The following program

main()
{
  static char a[3][4] = {"abcd", "mnop", "fghi"};
  putchar(**a);
}

View solution

Q. C does no automatic array bound checking. This is

View solution

Q. If n has the value 3, then the statement

a [++n] = n++ ;

View solution

Q. Choose the statement that best defines an array

View solution