Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following statements about Regular Expression is/are incorrect? A. The union of two regular expressions is also a regular expression B. The concatenation of two regular expressions is also a regular expression C. The iteration of a regular expression is also a regular expression
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 
A quadratic expression in x, when divided by (x – 2) and (x + 3), leaves remainders 13 and 8 respectively. If the expression is divisible by (x – 1), find the quadratic expression.
Consider evaluating the following expression tree on a machine with load-store Architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
Consider the following expression 1. Y = f (A,B,C,D) = ∑(1,2,4,7,8,11,13,14) 2.Y = f (A,B,C,D ) = ∑(3,5,7,10,11,12,13,14) 3.Y = f(A,B,C,D) = π(0,3,5,6,9,10,12,15) 4.Y = f(A,B,C,D) = π(0,1,2,4,6,8,9,15) which of these expression are equivalent of the expression Y = A⊕B⊕C⊕D
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
To convert the postfix expression into the infix expression we use stack and scan the postfix expression from left to right.
The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?
Which one of the following is the right syntax for DECODE? … ) b) DECODE (expression, result … , search) c) DECODE (search, result … , expression) d) DECODE (expression, search, result … )
A recombinant protein is to be expressed under the control of the lac promoter and operator in a strain of E. coli having the genotype lacI+ crp+. Even in the absence of inducer IPTG, low levels of expression of the recombinant protein are seen (leaky expression). Which one of the following should be done to minimize such leaky expression?