You can carfully wedge something in between the key and gently pull up
Answer:
Consider the language defined by the following regular expression. (x*y | zy*)* 1. Does zyyxz belong to the language?
O. No, because zyy does not belong to x*y nor zy*
2. Does zyyzy belong to the language?
Yes, because both zy and zyy belong to zy*.
Explanation:
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:
Audimeter
Explanation:
The television index is a measure of audience that estimates the percentage of households or viewers that are watching a television program and with respect to the total that your television is on during the broadcast. It manifests itself in a figure that results from the multiplication of individuals or households, by the time invested. This data is measured with audimeters.
