edited by
483 views
0 votes
0 votes

Let $\text{P}(x)$ be “$x$ is perfect”, $\text{F}(x)$ be “$x$ is your friend” and the domain be all people. The statement, “At least one of your friends is perfect” is :

  1. $ \forall x \; \text{(F}(x) \rightarrow \text{P}(x)) $
  2. $ \forall x \; \text{(F}(x) \land \text{P}(x)) $
  3. $ \exists x \; \text{(F}(x) \land \text{P}(x)) $
  4. $ \exists x \; \text{(F}(x) \rightarrow \text{P}(x)) $
edited by

1 Answer

0 votes
0 votes

C. ∃x(F(x)∧P(x))…

 

For some x, x is friend and funny...

Related questions

0 votes
0 votes
1 answer
1
soujanyareddy13 asked Dec 7, 2021
909 views
Write Recurrence of Quick Sort in worst case.$ \text{T(n)} = \text{T (n-1)} + 1 $$ \text{T(n)} = \text{T (n-1) + n} $$ \text{T(n)} = 2 \text{T (n-1) + n} $$ \text{T(n)} =...
0 votes
0 votes
0 answers
2
soujanyareddy13 asked Dec 7, 2021
523 views
$y = 10 \cos (1800 \; \pi t) + 20 \cos (2000 \; \pi t) + 10 \cos (220 \; \pi t).$ Find the modulation index $(\mu)$ of the given wave. $0.3$$0.5$$0.7$$1$
0 votes
0 votes
1 answer
3
soujanyareddy13 asked Dec 7, 2021
581 views
Match the following:$$\begin{array} {llll} & \textbf{List-I} & & \textbf{List-II} \\ \text{W.} & \text{Condition coverage} & 1. & \text{Black-box testing} \\ \text{X.} ...
0 votes
0 votes
2 answers
4
soujanyareddy13 asked Dec 7, 2021
3,111 views
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.$\text{NP}$$\text{P}$HardComplete