In a binary search,the entries in the table being searched must be in either ascending or descending sequence.
Correct Answer:
Verified
Q14: The keywords AND and OR are examples
Q15: What is the maximum number of comparisons
Q16: A program switch must always contain one
Q17: What is the name of the field
Q18: What is the maximum number of comparisons
Q20: The result of an OR operation will
Q21: If X = INT(6.5)then the value of
Q22: The name of the field that is
Q23: A sequential search is more efficient than
Q24: The binary search technique is particularly valuable
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents