Page 64 - DCAP407_DATA_STRUCTURE

Unit 3: Arrays

(c) Which of the following searching techniques sequentially traverses an array to search an
element?
(i) Binary search

(ii) Linear search
(iii) Quick search
(iv) Jump search
(d) What is the memory address of the first element of an array called as?
(i) Floor address
(ii) Base address

(iii) Foundation address
(iv) First address
(e) Which of the following is specified to access an element of an array?
(i) Syntax
(ii) Lower bound
(iii) Index
(iv) Upper bound
3.7 Review Questions

1. “Elements in an array are stored in continuous locations and are identified using the location of
the first element.” Discuss.

2. “Any element can be accessed by specifying the index of the element.” Comment.
3. “If the number of initial values in an array is less than the actual array size then, the remaining
array elements will be initialized to zero.” Discuss.
4. “Multidimensional arrays are nothing but arrays of arrays.” Comment.
5. “Linear arrays can be indexed.” Analyze.

6. “To use the values stored in the number array, we can treat each array element as a simple
variable of data type int.” Comment.
7. “If too many initial values are specified, a syntax error will occur.” Explain.
8. “Efficient sorting is important for optimizing the use of other algorithms that require sorted lists to
work correctly.” Discuss.
9. “Bubble sort is the simple sorting technique among all sorting techniques.” Comment.
10. “Efficient storage of data facilitates fast searching. “Analyze.
11. “Traversing operation also involves printing each and every element in an array. “Comment.
12. “Insertion of data elements is usually done at the end of an array.” Analyze.

LOVELY PROFESSIONAL UNIVERSITY 57