1) A2) B3) BA 4) 2. A Relation R on a Set A is called a partial order, if (A, R) is1) Reflexive relation2) Symmetric relation3) Reflexive, Anti-Symmetric and Transitive relation4) Reflexive, Symmetric and Transitive relation3. If A and B are two independent events such that P(A) =0.5 and 8.0 BAP thenP(B) is1) 0.62) 0.53) 0.84) 0.054. A Context – free grammar G is ambiguous if there is some string w belongs to L(G)that has two distinct1) Graph only2) Parse trees3) Grammars4) Ordered
Question
- A2) B3) BA 4) 2. A Relation R on a Set A is called a partial order, if (A, R) is1) Reflexive relation2) Symmetric relation3) Reflexive, Anti-Symmetric and Transitive relation4) Reflexive, Symmetric and Transitive relation3. If A and B are two independent events such that P(A) =0.5 and 8.0 BAP thenP(B) is1) 0.62) 0.53) 0.84) 0.054. A Context – free grammar G is ambiguous if there is some string w belongs to L(G)that has two distinct1) Graph only2) Parse trees3) Grammars4) Ordered
Solution
The text you provided seems to be a set of multiple choice questions from a computer science or mathematics exam. Here are the answers:
-
A relation R on a set A is called a partial order if (A, R) is a Reflexive, Anti-Symmetric and Transitive relation. So, the answer is 3) Reflexive, Anti-Symmetric and Transitive relation.
-
If A and B are two independent events such that P(A) =0.5 and P(A U B) = 0.8, then P(B) can be calculated using the formula P(A U B) = P(A) + P(B) - P(A ∩ B). Since A and B are independent, P(A ∩ B) = P(A)P(B). Substituting the given values, we get 0.8 = 0.5 + P(B) - 0.5*P(B). Solving this equation gives P(B) = 0.6. However, this option is not available in the choices given. There might be a mistake in the question or the options provided.
-
A Context – free grammar G is ambiguous if there is some string w belongs to L(G) that has two distinct parse trees. So, the answer is 2) Parse trees.
Similar Questions
1. Let A = { a , b , c ,d , e } and B={ a , b , c , d , e , f , g , h }then A - B is1) A2) B3) BA 4) 2. A Relation R on a Set A is called a partial order, if (A, R) is1) Reflexive relation2) Symmetric relation3) Reflexive, Anti-Symmetric and Transitive relation4) Reflexive, Symmetric and Transitive relation3. If A and B are two independent events such that P(A) =0.5 and 8.0 BAP thenP(B) is1) 0.62) 0.53) 0.84) 0.054. A Context – free grammar G is ambiguous if there is some string w belongs to L(G)that has two distinct1) Graph only2) Parse trees3) Grammars4) Ordered
Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________ ans. symmetric transitive reflexive reflexive and transitive
Let R and S be two non-void relations on a set A. Which of the following statements is false R and S are transitive Þ R È S is transitive R and S are transitive Þ R Ç S is transitive R and S are symmetric Þ R È S is symmetric R and S are reflexive Þ R Ç S is reflexive
A grammar that produces more than one parse tree for some sentence iscalled ____ a) Ambiguous b) Unambiguous c) Regular d) None of the mentioned
Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________ans.reflexive and transitivetransitivereflexivesymmetric Previous Marked for Review Next
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.