AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
Which of the following is not...
Which of the following is not a limitation of binary search algorithm?
there must be a mechanism to access middle element directly
must use a sorted array
binary search algorithm is not efficient when the data elements more than 1500
Correct
requirement of sorted array is expensive when a lot of insertion and deletions are needed
Similar ITE-6201 questions
When the largest element is at its root it's called
What does the sequential representation of binary trees use?
Which indicates pre-order traversal?
What is a queue?
Which of the following is not the part of ADT description?
Which of the following data structure can't store the non-homogeneous data elements?