Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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 two relations R1(A, B) with the tuples (1, 5), (3, 7) and R2(A, C) = (1, 7), (4, 9). Assume that R(A, B, C) is the full natural outer join of R1 and R2. Consider the following tuples of the form (A, B, C): a = (1, 5, null), b = (1, null, 7), c = (3, null, 9), d = (4, 7, null), e = (1, 5, 7), f = (3, 7, null), g = (4, null, 9). Which one of the following statements is correct?
Consider the following statements in connection with deflection-type and null-type instruments: 1. Null-type instruments are more accurate than the deflection-type ones. 2. Null-type of instrument can be highly sensitive compared to a deflection-type instrument. 3. Under dynamic conditions, null-type instruments are less preferred to deflection-type instruments. 4. Response is faster in null-type instruments as compared to deflection-type instruments. Which of the above statements are correct?
Consider the following statements for deflection and null type instruments: 1. Deflection type of instruments are more accurate than null type of instruments. 2. Deflection type of instruments can be highly sensitive as compared with the null type of instruments. 3. Null type of instruments are more suitable for measurements under dynamic conditions than deflection type of instruments. Which of the above statements are not correct?
Point out the error (if any) in the following C code?
#include #include int main(void){ int* p = NULL; struct S *s = NULL; void(*f)(int, double) = NULL; char *ptr = malloc(15); if (ptr == NULL) printf("Out of memory"); free(ptr);}
What one of the following is best practice to handle Null Pointer exception?
i) int noOfStudents = line.listStudents().count;
ii) int noOfStudents = getCountOfStudents(line);
public int getCountOfStudents(List line){if(line != null) {if(line.listOfStudents() != null) { return line.listOfStudents().size();}}throw new NullPointerException("List is empty");}
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?
When a particular ‘statistics’ in a research situation is evidently declared to be significant, which of the following decisions will be considered tenable ? A. Null hypothesis is rejected B. Alternative hypothesis is accepted C. Null hypothesis is accepted D. Alternative hypothesis is rejected E. Null hypothesis along with the alternate hypothesis are accepted. Choose the correct answer from the options given below:
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.
Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode {              treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) {              int value=0;              if (tree != NULL) {              if (tree->leftMostChild == NULL)              value = 1;    else               value = DoSomething(tree->leftMostChild);               value = value + DoSomething(tree->rightSibling);     }               return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the