Answer:
hope this helps if not srry
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:
False
Explanation:
Using subnet mask will be helpful, what the subnet mask does is moving the IP address boundary bettween the part that represents a network and the part that represents a host, thus, instructing the operating system which IP addresses are on the local subnet. Then the operating will communicate directly with the other host without using the router. Once this is achieved, memorizing the IP addresses is needless.
Answer:
There is an IRQ conflict, and you need to use Device Manager to resolve the problem.
Explanation:
IRQ is a synonym for "interrupt request line" and are lines which devices use to send interrupt signal to the microprocessor of a device. IRQ conflicts usually occur when a new device is added to a PC, and this can be resolved by setting the IRQ number and you can go about this by going using the Device Manager to resolve this.
A software that is free of cost for a certain amount of time such as Adobe programs, or Winzip.
