10) Minimum 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

Answer is:

n+[log₂n-2]

C Programming MCQ with Answers

For more MCQ's Click Here

11) The information about an array used in a program will be sorted in

Symbol table

Activation record

Both (a) and (b)

Dope vector

Answer is:

Dope vector

12) 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 accessing an entry

Efficient if the sparse matrix is a band matrix

Answer is:

Efficient in accessing an entry

13) The minimum 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

None of these

Answer is:

2

14) The const feature can be applied to

an identifier

an array

an array argument

All of these

Answer is:

All of these

Explanation:

The const feature can be applied to
* an identifier
* an array
* an array argument

C Programming MCQ with Answers

For more MCQ's Click Here

10) Minimum number of comparison required to compute the largest and second largest element in array is

n+[log₂n-2]

C Programming MCQ with Answers

Related C Programming MCQ with Answers

11) The information about an array used in a program will be sorted in

Dope vector

12) 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

Efficient in accessing an entry

13) The minimum 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

2

14) The const feature can be applied to

All of these

C Programming MCQ with Answers