# where w is the number of words per memory cell for the array

### Hashing technique in Data structures in C

Posted on

USEFUL FOR FYBSC (IT), FYBCA STUDENTS

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

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

a. LOC(Array=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
b. LOC(Array)=Base(Array)+(5-lower bound), where w is the number of words per memory cell for the array
c. LOC(Array)=Base(Array)+(5-Upper bound), where w is the number of words per memory cell for the array
d. None of above

3. Which of the following data structures are indexed structures?

a. linear arrays
c. both of above
d. none of above

4. Which of the following is not the required condition for binary search algorithm?

a. The list must be sorted
b. there should be the direct access to the middle element in any sub list
c. There must be mechanism to delete and/or insert elements in list
d. none of above

5. Which of the following is not a limitation of binary search algorithm?

a. must use a sorted array
b. requirement of sorted array is expensive when a lot of insertion and deletions are needed
c. there must be a mechanism to access middle element directly
d. binary search algorithm is not efficient when the data elements are more than 1000.

6. Two dimensional arrays are also called

a. tables arrays
b. matrix arrays
c. both of above
d. none of above

7. A variable P is called pointer if

a. P contains the address of an element in DATA.
b. P points to the address of first element in DATA
c. P can store only memory addresses
d. P contain the DATA and the address of DATA

Posted By-: Vissicomp Technology Pvt. Ltd.

Website -: http://www.vissicomp.com

### Data structures in C

Posted on

USEFUL FOR FYBSC (IT), FYBCA STUDENTS

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

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

a. LOC(Array=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
b. LOC(Array)=Base(Array)+(5-lower bound), where w is the number of words per memory cell for the array
c. LOC(Array)=Base(Array)+(5-Upper bound), where w is the number of words per memory cell for the array
d. None of above

3. Which of the following data structures are indexed structures?

a. linear arrays
c. both of above
d. none of above

4. Two dimensional arrays are also called

a. tables arrays
b. matrix arrays
c. both of above
d. none of above

5. Which of the following data structure can’t store the non-homogeneous data elements?

a. Arrays
b. Records
c. Pointers
d. None

6. Which of the following data structure store the homogeneous data elements?

a. Arrays
b. Records
c. Pointers
d. None

7. Binary search algorithm cannot be applied to