Q. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….

View solution

Q. Arrays are best data structures

View solution

Q. Which of the following statement is false?

View solution

Q. A …………………… does not keep track of address of every element in the list.

View solution

Q. Each array declaration need not give, implicitly or explicitly, the information about

View solution

Q. The elements of an array are stored successively in memory cells because

View solution

Q. The memory address of the first element of an array is called

View solution

Q. The memory address of fifth element of an array can be calculated by the formula

View solution

Q. Two dimensional arrays are also called

View solution

Q. A variable P is called pointer if

View solution

Q. What is right way to Initialize array?

View solution

Q. An array elements are always stored in ________ memory locations.

View solution

Q. Size of the array need not be specified, when

View solution

Q. What does the following declaration mean?

int (*ptr)[10];

View solution

Q. Array passed as an argument to a function is interpreted as

View solution

Q. Which of the following correctly accesses the seventh element stored in arr, an array with 100 elements?

View solution

Q. The smallest element of an array’s index is called its

View solution

Q. If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been stored in _________ order.

View solution

Q. An adjacency matrix representation of a graph cannot contain information of :

View solution

Q. The extra key inserted at the end of the array is called a,

View solution