General knowledge for competitive exam
1. The memory address of the first element of an array is called
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
3. Which of the following data structures are indexed structures?
a. linear arrays
4. Which of the following is not the required condition for
binary search algorithm?
c. There must be mechanism to delete and/or insert elements
in list
5. Which of the following is not a limitation of binary
search algorithm?
d. binary search algorithm is not efficient when the data elements are more than 1000.
6. Two dimensional arrays are also called
c. both of above
7. A variable P is called pointer if
a. P contains the address of an element in DATA.
8. Which of the following data structure can't store the
non-homogeneous data elements?
a. Arrays
9. Which of the following data structure store the
non-homogeneous data elements?
b. Records
10. Each data item in a record may be a group item composed
of sub-items; those items which are indecomposable are called
RELATED SEARCH
0 comments:
Post a Comment
Feel free to ask here :)