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 correct If A and B are two symmetric matrices of order n then 1. A + B is also a symmetric matrix. 2. AB is a symmetric matrix
Which of the following statements is/are true If A and B are two skew-symmetric matrices of order n then 1. A ⋅ B is a skew symmetric matrix when AB = - BA 2. A ⋅ B is a symmetric matrix when AB = BA
Which of the following statements is/are true  If A is a symmetric matrix of order n then 1. k ⋅ A is a symmetric matrix where k is any real number. 2. Am is a symmetric matrix where m ∈ N
Which of the following statements is/are true: If A is a skew-symmetric matrix of order n then 1. A2m is a symmetric matrix where m is a positive integer. 2. A2m + 1 is a skew - symmetric matrix where m is a positive integer.
Statement (I): An alluvial channel is defined as a channel in which the flow transports sediment of the same physical characteristic as the material in the wetted surface of the channel. Statement (II): This ensures that the channel cross-section and the channel slope do not change.
The Secure Shell Connection Protocol Message exchange has the fist phase as “Opening a Channel” and it sends a message with parameters- SSH_MSG_CHANNEL_OPEN channel type sender channel innitial window size maximum packet size What is the data type sender channel/innitial window size/ channel type?
A binary symmetric channel (BSC) has a transition probability of $$\frac{1}{8}.$$  If the binary transmit symbol X is such that $$P\left( {X = 0} \right) = \frac{9}{{10}},$$    then the probability of error for an optimum receiver will be
Binary symmetric channel is hard decision channel.
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?