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.
Answer:
Option a electronic switch used on FPDs
Explanation:
A thin film transistor (TFT) is an electronic switch which is commonly used in a liquid crystal display (LCD). TFT derives its name by the way how it is produced. It is produced by layering thin films of semiconductor. TFT is a type of transistor which is used to control state every individual pixel in a LCD. TCT can change the states of pixels (on and off) very quickly.
The only thing that I know is that after you input the text file, it could either:
-save those lines as a variable
-display the text file
However any more would be dependent on the language.
<span>To verify the version of HTML being run on any given page, check the DOCTYPE declaration at the head of the file. Use "inspect element" to view the page source; the DOCTYPE is generally in the header.</span>
