Q. An array can be____________type.

View solution

Q. The first element in the array is numbered 0, so the last element is ______ than the size of the array.

View solution

Q. The first element is referred to as array [__________] and any element at x position is referred to as array[_________].

View solution

Q. What are used to refer to array elements?

View solution

Q. The method of subscribing arrays in ‘________’ is different from that used in many other
programming languages.

View solution

Q. The first element in the array is numbered__________.

View solution

Q. Once memory space is allocated to an array, it cannot be________.

View solution

Q. If the number of elements to be stored in an ______increases or decreases significantly at runtime, it may require more memory space or result in wastage of memory, both of which are unacceptable.

View solution

Q. The total number of elements that can be stored in a string without increasing its current amount of allocated memory is called its:

View solution

Q. A double sub-scripted array declared as int a[ 3 ][ 5 ]; has how many elements?

View solution

Q. Using square brackets ([]) to retrieve vector elements .............. perform bounds checking; using member function at to retrieve vector elements ................ perform bounds checking.

View solution

Q. The largest element of an array index is called its .................

View solution

Q. The information about an array that is used in a program will be stored in

View solution

Q. Which of the following expressions accesses the (i,j)th entry of an (m x n) matrix stored in column major form?

View solution

Q. Sparse matrices have

View solution

Q. For a linear search in an array of n elements the time complexity for best, worst and average case are ......., ....... and ........ respectively

View solution

Q. The expression which accesses the (ij)th entry of am x n matrix stored in column majorform is

View solution

Q. An object that can be used in accessing another object, is known to be

View solution

Q. Basic mechanism for storing a large number of identically-typed objects are known to be

View solution

Q. Basic technique of using an array which is considered safer and easier is named as

View solution