Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the following program that attempts ...
Start Learning for Free
Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?
var i,j,k: integer; x: integer;
a: array; [1....N] of integer;
begin i:= 1; j:= N;
repeat
k:(i+j) div 2;
if a[k] < x then i:= k
else j:= k
until (a[k] = x) or (i >= j);
if (a[k] = x) then
writeln ('x is in the array')
else
writeln ('x is not in the array')
end;
a: array; [1....N] of integer;
begin i:= 1; j:= N;
repeat
k:(i+j) div 2;
if a[k] < x then i:= k
else j:= k
until (a[k] = x) or (i >= j);
if (a[k] = x) then
writeln ('x is in the array')
else
writeln ('x is not in the array')
end;
- a)x is the last element of the array a[]
- b)x is greater than all elements of the array a[]
- c)Both of the Above
- d)x is less than the last element of the array a[]
Correct answer is option 'C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider the following program that attempts to locate an element x in...
The above program doesn’t work for the cases where element to be searched is the last element of a[] or greater than the last element (or maximum element) in a[]. For such cases, program goes in an infinite loop because i is assigned value as k in all iterations, and i never becomes equal to or greater than j. So while condition never becomes false.
Most Upvoted Answer
Consider the following program that attempts to locate an element x in...
Is the size of the array and x is the element to be searched.
```
int binary_search(int a[], int N, int x)
{
int low = 0, high = N-1, mid;
while (low <=>
{
mid = (low + high) / 2;
if (a[mid] == x)
return mid;
else if (a[mid] < />
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
```
This program first initializes two variables, `low` and `high`, to the beginning and end of the array, respectively. It then enters a loop that continues as long as the `low` index is less than or equal to the `high` index.
In each iteration, the program computes the middle index `mid` of the current subarray using integer division. If the element at `mid` is equal to `x`, the function immediately returns the index `mid`.
Otherwise, if the element at `mid` is less than `x`, the program updates `low` to `mid + 1`, indicating that the element `x` must be in the upper half of the subarray.
Similarly, if the element at `mid` is greater than `x`, the program updates `high` to `mid - 1`, indicating that the element `x` must be in the lower half of the subarray.
If the loop completes without finding the element `x`, the function returns `-1`.
Overall, this program efficiently searches for an element in a sorted array by repeatedly dividing the search space in half. Its worst-case time complexity is O(log N), which is much faster than linear search, making it ideal for searching large arrays.
```
int binary_search(int a[], int N, int x)
{
int low = 0, high = N-1, mid;
while (low <=>
{
mid = (low + high) / 2;
if (a[mid] == x)
return mid;
else if (a[mid] < />
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
```
This program first initializes two variables, `low` and `high`, to the beginning and end of the array, respectively. It then enters a loop that continues as long as the `low` index is less than or equal to the `high` index.
In each iteration, the program computes the middle index `mid` of the current subarray using integer division. If the element at `mid` is equal to `x`, the function immediately returns the index `mid`.
Otherwise, if the element at `mid` is less than `x`, the program updates `low` to `mid + 1`, indicating that the element `x` must be in the upper half of the subarray.
Similarly, if the element at `mid` is greater than `x`, the program updates `high` to `mid - 1`, indicating that the element `x` must be in the lower half of the subarray.
If the loop completes without finding the element `x`, the function returns `-1`.
Overall, this program efficiently searches for an element in a sorted array by repeatedly dividing the search space in half. Its worst-case time complexity is O(log N), which is much faster than linear search, making it ideal for searching large arrays.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer?
Question Description
Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer?.
Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer?.
Solutions for Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?var i,j,k: integer; x: integer; a: array; [1....N] of integer;begin i:= 1; j:= N;repeat k:(i+j) div 2; if a[k] < x then i:= k else j:= kuntil (a[k] = x) or (i >= j); if (a[k] = x) then writeln (x is in the array)else writeln (x is not in the array)end;a)x is the last element of the array a[]b)x is greater than all elements of the array a[]c)Both of the Aboved)x is less than the last element of the array a[]Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup