11. | The way in which the data item or items are logically related defines ….. |
a. | storage structure |
b. | data structure |
c. | data relationship |
d. | data operation |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (b).data structure
|
12. | The logical or mathematical model of a particular organization of data is called a ……… |
a. | Data structure |
b. | Data arrangement |
c. | Data configuration |
d. | Data formation |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (a).Data structure
|
13. | The simplest type of data structure is ……………… |
a. | Multidimensional array |
b. | Linear array |
c. | Two dimensional array |
d. | Three dimensional array |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (b).Linear array
|
14. | Linear arrays are also called ………………. |
a. | Straight line array |
b. | One-dimensional array |
c. | Vertical array |
d. | Horizontal array |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (b).One-dimensional array
|
15. | The data structure which is one ended is ……………… |
a. | queue |
b. | stack |
c. | tree |
d. | graph |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (b).stack
|
16. | A list which displays the relationship of adjacency between elements is said to be |
a. | linear |
b. | non linear |
c. | linked list |
d. | trees |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (a).linear
|
17. | Which of the following data structure is not linear data structure? |
a. | Arrays |
b. | Linked lists |
c. | Both of above |
d. | None of above |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (d).None of above
|
18. | Which of the following data structure is linear data structure? |
a. | Trees |
b. | Graphs |
c. | Arrays |
d. | None of above |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (c).Arrays
|
19. | 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 adjecent 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 |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (c).pointers store the next data element of a list
|
20. | Which of the following sorting algorithm is of divide-and-conquer type? |
a. | Bubble sort |
b. | Insertion sort |
c. | Quick sort |
d. | All of above |
View Answer Report Discuss Too Difficult! Search Google |
Answer: (c).Quick sort
|