If in a bits string of {0,1}, of length 4, such that no two ones are t – McqOptions

MCQOPTIONS

1.	If in a bits string of {0,1}, of length 4, such that no two ones are together. Then the total number of such possible strings are?
A.	1
B.	5
C.	7
D.	4
Answer» D. 4

Discussion

No Comment Found

Related MCQs

What rule of inference is used in this argument?
“Parul is out for a trip or it is not snowing” and “It is snowing or Raju is playing chess” imply that __________
Let the statement be “If n is not an odd integer then square of n is not odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “(square of n) is not odd.” For direct proof we should prove _________
Which rule of inference is used, ”Bhavika will work in an enterprise this summer. Therefore, this summer Bhavika will work in an enterprise or he will go to beach.”
The premises (p ∧ q) ∨ r and r → s imply which of the conclusion?
Which rule of inference is used in each of these arguments, “If it hailstoday, the local office will be closed. The local office is not closed today. Thus, it did not hailed today.”
Let T (x, y) mean that student x likes dish y, where the domain for x consists of all students at your school and the domain for y consists of all dishes. Express ¬T (Amit, South Indian) by a simple English sentence.
Let L(x, y) be the statement “x loves y,” where the domain for both x and y consists of all people in the world. Use quantifiers to express, “Joy is loved by everyone.”
Express, “The difference of a real number and itself is zero” using required operators.
Use quantifiers and predicates with more than one variable to express, “There is a pupil in this lecture who has taken at least one course in Discrete Maths.”