Aspire Faculty ID #14532 · Topic: UGC NET Computer Science 26 June 2025 (Paper II) · Just now
UGC NET Computer Science 26 June 2025 (Paper II)

Which of the following is not a valid property over two fuzzy relations $\tilde R$ and $\tilde S$ for performing $\lambda$-cut defuzzifications?

1. $(\tilde R \cup \tilde S)\lambda=\tilde R\lambda\cup \tilde S_\lambda$ 
2. $(\tilde R \cap \tilde S)\lambda=\tilde R\lambda\cap \tilde S_\lambda$ 
3. $(\overline{\tilde R})\lambda\neq \tilde R\lambda\ \text{except when }\lambda=1$
4. For any $\lambda\le \beta$, where $0\le \beta\le1$, it is true that $R_\beta\subseteq R_\lambda$

Solution

For a fuzzy set $A$, the $\lambda$-cut is defined as: $$A_\lambda = \{x \mid \mu_A(x) \ge \lambda\}$$

  • Union Property: $(A \cup B)_\lambda = A_\lambda \cup B_\lambda$ ✅
  • Intersection Property: $(A \cap B)_\lambda = A_\lambda \cap B_\lambda$ ✅
  • Monotonicity: If $\lambda \le \beta$, then $A_\beta \subseteq A_\lambda$ ✅
  • Complement: $\mu_{\overline{A}}(x) = 1 - \mu_A(x)$ ⇒ $(\overline{A})_\lambda = \{x \mid 1 - \mu_A(x) \ge \lambda\} = \{x \mid \mu_A(x) \le 1 - \lambda\}$ ❌

Hence, $(\overline{A})_\lambda$ is not equal to $A_\lambda$, even when $\lambda = 1$. Therefore, the statement “except when $\lambda = 1$” is incorrect.

✅ Final Answer: Option 3 is not valid.

Previous 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Nearest first

Next 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Ascending by ID
1
Which of the following belongs to McCall’s Quality Factors? A. Maintainability B. Usability C. Integrity…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
Match List I with List II List I List II A. Count to infinity problem I. Mobile Adhoc Networ…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Match List I with List II List I List II A. Digital Signature I. Asymmetric encryption algor…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Arrange the following parsers in increasing order of their power (least → most): LR(0) LR(1) LALR(1) LL(0) S…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Maintaining a graph in memory by means of its adjacency matrix is known as
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Consider the following interrupt protection levels in Linux, and arrange them in the increasing order of their prioriti…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Consider relation R(A, B, C, D, E) with the following functional dependencies: C → F, E → A, EC → D, A → B. Wh…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Which of the following trees are height balanced? A. Binary Search Tree B. AVL Tree C. Red-Black Tree D…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Let P denote “She is intelligent” and Q denote “She is happy.” Given statements: (a) If she is intelligent, the…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
The process followed in order to find difficult, unknown and hidden information about a software system is called:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...