1. Which of the following is not possible with an array in C programming language −
A. Declaration B. Definition C. Dynamic Allocation D. Array of strings
2. Index of arrays in C programming langauge starts from
A. 0 B. 1 C. either 0 or 1 D. undefined
3. Which of the following data structure can’t store the non-homogeneous data elements?
A. Arrays B. Records C. Pointers D. Stacks
4. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….
A. pointers B. linked allocation C. stack D. queue
5. Arrays are best data structures
A. for relatively permanent collections of data B. for the size of the structure and the data in the structure are constantly changing C. for both of above situation D. for non of above situation
6. Which of the following statement is false?
A. Arrays are dense lists and static data structure. B. Data elements in linked list need not be stored in adjacent space in memory C. Pointers store the next data element of a list. D. Linked lists are collection of the nodes that contain information part and next pointer.
7. A …………………… does not keep track of address of every element in the list.
A. Stack B. String C. Linear array D. Queue
8. Each array declaration need not give, implicitly or explicitly, the information about
A. the name of array B. the data type of array C. the first data from the set to be stored D. the index set of the array
9. The elements of an array are stored successively in memory cells because
A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated B. the architecture of computer memory does not allow arrays to store other than serially C. both of above D. none of above
10. The memory address of the first element of an array is called
A. floor address B. foundation address C. first address D. base address