What are the updated values of high and low in the array if the element being searched is greater than the value at calculated index in interpolation search? (pos = current position)(a) low = pos + 1, high remains unchanged(b) high = pos – 1, low remains unchanged(c) low = low +1, high = high – 1(d) low = pos +1, high = pos – 1I have been asked this question by my college director while I was bunking the class.This question is from Searching in portion Searching of Data Structures & Algorithms II

What are the updated values of high and low in the array if the elemen

1.	What are the updated values of high and low in the array if the element being searched is greater than the value at calculated index in interpolation search? (pos = current position)(a) low = pos + 1, high remains unchanged(b) high = pos – 1, low remains unchanged(c) low = low +1, high = high – 1(d) low = pos +1, high = pos – 1I have been asked this question by my college director while I was bunking the class.This question is from Searching in portion Searching of Data Structures & Algorithms II
Answer» CORRECT answer is (a) low = pos + 1, HIGH REMAINS unchanged The best I can explain: When the ELEMENT being searched is greater than the VALUE at the calculated position then in that case we update low and high remains unaltered. Updated value of low is low = pos + 1.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following searching algorithm is fastest when the input array is sorted but has non uniformly distributed values?(a) jump search(b) linear search(c) binary search(d) interpolation searchA simple yet interesting question from data structure and algorithms.
Interpolation search performs better than binary search when?(a) array has uniformly distributed values but is not sorted(b) array is sorted and has uniform distribution of values(c) array is sorted but the values are not uniformly distributed(d) array is not sortedThis is one of most asked question in data structure and algorithms interview.
Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.(a) true(b) falseI had been asked this question by my school principal while I was bunking the class.This is a very interesting question from Searching in portion Searching of Data Structures & Algorithms II
The naive pattern searching algorithm is an in place algorithm.(a) true(b) falseThe question was posed to me in examination.My question is based upon Searching in section Searching of Data Structures & Algorithms II
What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?(a) O(n + m)(b) O(m)(c) O(n)(d) O(m * n)I got this question in an online quiz.I'm obligated to ask this question of Searching topic in division Searching of Data Structures & Algorithms II
What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?(a) O(n + m)(b) O(m)(c) O(n)(d) O(m * n)I had been asked this question in a job interview.My question is from Searching topic in portion Searching of Data Structures & Algorithms II
What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?(a) O(n)(b) O(n*m)(c) O(m)(d) O(log n)I had been asked this question during an online exam.This interesting question is from Searching topic in section Searching of Data Structures & Algorithms II
Which of the following is a sub string of “SANFOUNDRY”?(a) SANO(b) FOUND(c) SAND(d) FONDThe question was posed to me in an online quiz.The doubt is from Searching topic in division Searching of Data Structures & Algorithms II
What are the updated values of high and low in the array if the element being searched is lower than the value at calculated index in interpolation search? (pos = current position)(a) low = pos + 1, high remains unchanged(b) high = pos – 1, low remains unchanged(c) low = low +1, high = high – 1(d) low = pos +1, high = pos – 1I have been asked this question in an online interview.The above asked question is from Searching in chapter Searching of Data Structures & Algorithms II
What are the updated values of high and low in the array if the element being searched is greater than the value at calculated index in interpolation search? (pos = current position)(a) low = pos + 1, high remains unchanged(b) high = pos – 1, low remains unchanged(c) low = low +1, high = high – 1(d) low = pos +1, high = pos – 1I have been asked this question by my college director while I was bunking the class.This question is from Searching in portion Searching of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment