Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which three statements are true about the operation of a full-duplex Ethernet network?
1. There are no collisions in full-duplex mode.
2. A dedicated switch port is required for each full-duplex node.
3. Ethernet hub ports are preconfigured for full-duplex mode.
4. In a full-duplex environment, the host network card must check for the availability of the network media before transmitting.
5. The host network card and the switch port must be capable of operating in full-duplex mode.
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
The charges for a five-day trip by a tourist bus for one full ticket and a half-ticket are Rs. 1440 inclusive of boarding charges which are same for a full ticket and a half-ticket. The charges for the same trip for 2 full tickets and one half-ticket inclusive of boarding charges are Rs. 2220. The fare for a half-ticket is 75% of the full ticket. Find the fare and the boarding charges separately for one full ticket.
When we compare the half bridge converter and full bridge converter 1. The maximum collector current of a full bridge is only double that of the half bridge 2. Full bridge uses 4-power switches instead of 2, as in the double bridge. 3. Output power of a full bridge is twice that of a half bridge with the same input voltage and current. When of the above statements are correct?
A Concert half ticket costs half the full basic ticket and the VIP area charge is the same on half ticket as on full ticket. One VIP ticket costs Rs. 216 and one full and one half VIP tickets cost Rs. 327. What is the basic full ticket cost and what is the VIP charge?
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.