Data structures in C

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

a. floor address
b. foundation address
c. first address
d. base address

 

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

a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
c. LOC(Array[5])=Base(Array[4])+(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
b. linked lists
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

a. sorted linked list
b. sorted binary trees
c. sorted linear array
d. pointer array

 

Posted By-: Vissicomp Technology Pvt. Ltd.

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

Advertisements