Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5c8d4d3d2c4d1c2c1, where the data bits and the check bits are given in the following tables: Data bits d8 d7 d6 d5 d4 d3 d2 d1 1 1 0 x 0 1 0 1   c8 c4 c2 c1 Y 0 1 0 Which one of the following choices gives the correct values of x and y?
Which statement(s) about IPv4 and IPv6 addresses are true?1. An IPv6 address is 32 bits long, represented in hexidecimal.2. An IPv6 address is 128 bits long, represented in decimal.3. An IPv4 address is 32 bits long, represented in decimal.4. An IPv6 address is 128 bits long, represented in hexidecimal.
A message consisting of 2400 bits is to be passed over the Internet. The message is passed to the transport layer which appends a 150-bit header, followed by the network layer which uses a 120-bit header. Network layer packets are transmitted via two networks, each of which uses a 26-bit header. The destination network only accepts up to 900 bits long. The number of bits, including headers delivered to the destination network, is
Two stock options are available for buying. Each offers a variable rate of return of profit over a period of 10 years. For first 4 years one has an incremental rate of return which increases by 2% per year starting from 3% of the investment and stays constant at 8% for the rest of the period. The second one has a constant annual rate of return throughout and give 10% more return after 10 years. What is the annual rate of return on second option?
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root. int height (treeptr n) { if (n == NULL) return -1;   if (n →  left == NULL)        if (n →  right == NULL) return 0;        else return ; \(\boxed{B1}\);     // Box 1 else { h1 = height (n →  left);          if (n → right == NULL) return (1+h1);          else { h2 = height (n → right);          return ; \(\boxed{B2}\)   // Box 2                        }            } } The appropriate expressions for the two boxes B1 and B2 are
Consider the following C code segment int f (int x) { if (x<1) return 1; else return ( f{x-1) + g(x) ); } int g (int x) {  if (x< 2) return 2; else return ( f(x-1) + g(x/2)); } Of the following, which best describes the growth of f(x) as a function of x ?
Pick the correct statements.
I.   The body of a function should have only one return statement.
II.  The body of a function may have many return statements.
III. A function can return only one value to the calling environment.
IV. If return statement is omitted, then the function does its job but returns no value to the calling environment.
Observe the following Python code?
def a(n): if n == 0: return 0 else: return n*a(n - 1)def b(n, tot): if n == 0: return tot else: return b(n-2, tot-2)
Which of the following codes uses a number of parity bits located at certain positions in the codeword and uses the relations between redundancy bits and the data bits?
When two 8-bit numbers A7 … A0 and B7 … B0 in 2’ s complement representation (with A0 and B0 as the least significant bits) are added using a ripple-carry adder, the sum bits obtained are S7 … S0 and the carry bits are C7 … C0. An overflow is said to have occurred if