Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
Which of the following statements is/are true: Let * be a binary operation on a non-empty set A such that a * b = a - b - ab If A = Z then * is a binary operation on Z. If A = N then * is a binary operation on N.
Which of the following statements is/are true: Let * be a binary operation on a non-empty set A such that a * b = ab 1. If A = {1/2, 0, -2} then * is a binary operation on A. 2. If A = {-1, 0, 1} then * is a binary operation on A.
Which of the following statements is/are true: Let * be a binary operation on a non-empty set A such that a * b = |a - b| 1. If A = Z then * is a binary operation on Z. 2. If A = R then * is a binary operation on R.
Which of the following statements is/are true: Let * be a binary operation on a non-empty set A such that a * b = a/b If A = Z then * is a binary operation on Z. If A = N then * is a binary operation on N.
Which of the following statements is/are true: Let * be a binary operation on a non-empty set A such that a * b = ab/2 1. If A = Z then * is a binary operation on Z. 2. If A = R then * is a binary operation on R.
Which of the following statements is/are true: Let * be a binary operation on a non-empty set A such that a * b = ab ∀ a, b ∈ A. 1. If A = N then * is a binary operation on N. 2. If A = Z then * is a binary operation on Z.
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?
A source produces binary data at the rate of 10 kbps. The binary symbols are represented as shown in the figure.
Digital Communication mcq question image
The source output is transmitted using two modulation schemes, namely Binary PSK (BPSK) and Quadrature PSK (QPSK). Let and B2 be the bandwidth requirements of BPSK and QPSK respectively. Assuming that the bandwidth of the above rectangular pulses is 10 kHz, B1 and B2 are