I think it's D because it's made out of facts. The other ones are more likely to include bias.
Answer:
to set up placeholders in a document where data will be inserted
23 bits would leave room for 512 node numbers.
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:
C. 7200 bps.
Explanation:
In networking, transmission lines or connectors and ports operates at a specific speed based on the port type and the cable or medium of transmission.
Baud rate is a concept in digital information technology that defines the rate of symbol per channel during transmission. The bit or data rate is the number of bits transfered in a link per second.
The relationship between baud rate and bit rate is;
Bit rate = baud rate x number of symbol bit level
To get the bit rate of a 2400 baud signal with symbol level = 8 = 2^3
Bit rate = 2400 x 3. = 7200 bps.
