Answer:
The Correct answer for the given question is "elements " .
Explanation:
The number of bytes is always multiple by the number of array elements in an array to getting total memory occupy by any array .
For example :
int a[100];
Since in c language int is 2 bytes
So memory in number of bytes =2*100=200 bytes
Indexes is keep the track of physical location of any file this is also used to track the logical location of file in database so this option is wrong
Subscripts are the index number of an array so we will never used subscripts to getting total memory occupy by any array so this option is wrong
Iterators are the loop so this option is wrong.
Due to this the correct answer is elements.
This totally depends on what they need and what they are willing to spend. If they just need access to google docs/ sheets etc for example (so just the web with a web browser), either Linux / Un*x or Windows will do and linux is the free choice. If they want to be part of the microsoft ecosystem or use some windows specific software they will need to use Windows or an emulator in Linux.
I would not recommend MSDOS in this day and age.
Column is the correct answer. Hope this helps. :)
Answer:
True: In binary search algorithm, we follow the below steps sequentially:
Input: A sorted array B[1,2,...n] of n items and one item x to be searched.
Output: The index of x in B if exists in B, 0 otherwise.
- low=1
- high=n
- while( low < high )
- { mid=low + (high-low)/2
- if( B[mid]==x)
- {
- return(mid) //returns mid as the index of x
- }
- else
- {
- if( B[mid] < x) //takes only right half of the array
- {
- low=mid+1
- }
- else // takes only the left half of the array
- {
- high=mid-1
- }
- }
- }
- return( 0 )
Explanation:
For each iteration the line number 11 or line number 15 will be executed.
Both lines, cut the array size to half of it and takes as the input for next iteration.
