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
Two men and women are entrusted with a task. The second man needs three hours more to cope up with the job than the second man and the woman would need working together. The first man, working alone, would need as much time as second man and the woman working together. The first man working alone, would spend eight hours less than the double period of the time second man would spend working alone. How much time would the two men and the women need to complete the task if they all asked together?
Ms. Rose asks her class, "What would happen if humans decided to keep a single clock for the whole world, without separate time zones?" Four students respond as follows: Student 1: Longitudes would no longer be of use. Student 2: The seasons in different parts of the world would change. Student 3 : All parts of the world would have day and night together. Student 4: For some countries, morning would be at 5 'o clock, for some at 7 'o clock and so on. Arrange the 4 students in INCREASING order of conceptual clarity.
Study the following information carefully to answer the question given below. Following are the qualifications and conditions for certain posts in a "XYZ" company. The candidate must: a) be an engineering graduate with at least 70% marks. b) be not less than 21 years and not more than 26 years of age as of 01/04/2018. c) have passed the written test with at least 60% of marks. d) be willing to pay a deposit of Rs. 2.5 lakh, to be refunded on completion of probation & training. If the candidate satisfies (a)-(d) he/she would be referred to as Engineer. However, if the candidate satisfies all the above, except: (i) at (a), has appeared for final semester exam; result yet to be declared; has 75% average marks up to the seventh semester; would be referred as Project-Engineer. (ii) at (a), has done diploma in engineering with 75% of marks, would be referred as Asst. Engineer. (iii) at (d), is willing to pay Rs. 1.5 lakh as a security deposit, would be referred to as Engineer-Trainee. (iv) at (b), even if age is above 26 years as of 1/4/18, but with 3 years of experience, would be referred as a Senior-Engineer. Pranita has completed her B. E. in electronics with 71% of the marks. She also has cleared the written tests with 75% of the marks. She is 22 years old as of May 2018. She is willing to pay a security deposit of Rs. 1.5 lakh. For which position will she be referred?
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.