91. Which of the following data structures are indexed structures?#a) linear arraysb) linked listsc)Dequesd) Treese)Stacks92. Which of the following is not the required condition for binary search algorithm?a) The list must be sortedb) there should be the direct access to the middle element in any sublist#c)There must be mechanism to delete and/or insert elements in listd) The list must be partitionede) none of the above93. Which of the following is not a limitation of binary search algorithm?a) must use a sorted arrayb) requirement of sorted array is expensive when a lot of insertion and deletions areneededc)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.e) both a and b94. 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 DATAc) P can store only memory addressesd) P contain the DATA and the address of DATAe) P can store only the DATA95. Which of the following data structure can't store the non-homogeneous data elements?#a)Arraysb) Recordsc)Pointersd) LinkedListe)Trees96. Which of the following data structure store the homogeneous data elements?
Question
- Which of the following data structures are indexed structures?#a) linear arraysb) linked listsc)Dequesd) Treese)Stacks92. Which of the following is not the required condition for binary search algorithm?a) The list must be sortedb) there should be the direct access to the middle element in any sublist#c)There must be mechanism to delete and/or insert elements in listd) The list must be partitionede) none of the above93. Which of the following is not a limitation of binary search algorithm?a) must use a sorted arrayb) requirement of sorted array is expensive when a lot of insertion and deletions areneededc)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.e) both a and b94. 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 DATAc) P can store only memory addressesd) P contain the DATA and the address of DATAe) P can store only the DATA95. Which of the following data structure can't store the non-homogeneous data elements?#a)Arraysb) Recordsc)Pointersd) LinkedListe)Trees96. Which of the following data structure store the homogeneous data elements?
Solution
The text is a series of multiple choice questions related to data structures and algorithms in computer science. Here are the answers:
-
Indexed structures are those where each element can be accessed directly based on its position. So, the answer is a) Linear arrays.
-
The required conditions for binary search algorithm are that the list must be sorted and there should be direct access to the middle element in any sublist. So, the answer is c) There must be a mechanism to delete and/or insert elements in list.
-
The limitations of binary search algorithm are that it must use a sorted array and it is not efficient when the data elements are more than 1000. So, the answer is d) binary search algorithm is not efficient when the data elements are more than 1000.
-
A variable P is called a pointer if it contains the address of an element in DATA. So, the answer is a) P contains the address of an element in DATA.
-
Non-homogeneous data elements are those that are of different types. So, the answer is a) Arrays.
-
Homogeneous data elements are those that are of the same type. So, the answer is a) Arrays.
Similar Questions
91. Which of the following data structures are indexed structures?#a) linear arraysb) linked listsc)Dequesd) Treese)Stacks92. Which of the following is not the required condition for binary search algorithm?a) The list must be sortedb) there should be the direct access to the middle element in any sublist#c)There must be mechanism to delete and/or insert elements in listd) The list must be partitionede) none of the above93. Which of the following is not a limitation of binary search algorithm?a) must use a sorted arrayb) requirement of sorted array is expensive when a lot of insertion and deletions areneededc)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.e) both a and b94. 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 DATAc) P can store only memory addressesd) P contain the DATA and the address of DATAe) P can store only the DATA95. Which of the following data structure can't store the non-homogeneous data elements?#a)Arraysb) Recordsc)Pointersd) LinkedListe)Trees96. Which of the following data structure store the homogeneous data elements?
"Data Structures and Algorithms
.Question 8Which of the following are actual data structures? 1 pointB TreesC TreesA Trees
A structure may have data items of similar data types
A —— data structure is a hierarchical structure that is used to represent and organize data in a way that is easy to navigate and search.
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.