41. Choose the correct statements

Strictly speaking C supports 1-dimensional arrays only

An array element may be an array by itself

Array elements need not occupy contiguous memory locations

Both (a) and (b)

42. Choose the statement that best defines an array

It is a collection of items that share a common name

It is a collection of items that share a common name and occupy consecutive memory location

It is a collection of items of the same type and storage class that share a common name and occupy consecutive memory locations

None of the above

43. If n has the value 3, then the statement a [++n] = n++ ;

assigns 3 to a [5]

assigns 4 to a [5]

assigns 4 to a [4]

what is assigned is compiler-dependent

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

true

false

C's asset

C's shortcoming

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

will not compile successfully

results in run-time error

prints garbage

none of the above

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

both the subscripts may be left empty

the first (row) subscript may be left empty

the first subscript must be left empty

both the subscripts must be left empty

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

when initialization is a part of definition

when it is a declaration

when it is a formal parameter and an actual argument

All of the above

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

3

4

5

compiler dependent

49. Consider the statement int val[2] [4] = { 1, 2, 3, 4, 5, 6, 7, 8} ; 4 will be the value of

val[0 ][ 3]

val[0][4]

val[1][1]

none of the above

50. The parameter passing mechanism for an array is

call by value

call by value-result

call by reference

none of these

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

results in bus error

results in segmentation violation error

will not compile successfully

none of the above

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

with empty brackets

with its size

alone

none of the above

53. Consider the following type definition. typedef char x[10]; x myArray[5]; What will sizeof(myArray) be ? (Assume one character occupies 1 byte)

15 bytes

10 bytes

50 bytes

30 bytes

54. Consider the array definition int num [10] = {3, 3, 3}; Pick the Correct answers

num [9] is the last element of the array num

The value of num [ 8] is 3

The value of num [ 3 ] is 3

None of the above

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

automatic

external

static

either automatic or external depending on the place of occurrence

56. 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?

5x6 matrix with 9 non-zero entries

5x6 matrix with 10 non-zero entries

Efficient in accesing an entry

Efficient if the sparse matrix is a band matrix

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

Symbol table

Activation record

Both (a) and (b)

Dope vector

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

n-[log₂n]-2

n+[log₂n-2]

log₂n

none of these

59. Which of the following is an illegal array definition?

Type COLOGNE:(LIME,PINE,MUSK,MENTHOL); var a:array[COLOGNE]of REAL;

var a:array[REAL]of REAL;

var a:array['A'..'Z']of REAL;

var a:array[BOOLEAN]of REAL;

60. Minimum number of interchange needed to convert the array 89,19,40,14,17,12,10,2,5,7,11,6,9,70, into a heap with the maximum element at the root is

0

1

2

3