## ReactJS | State in React

In the previous article on ReactJS | Components, we got to know that React Components can be broadly classified into Functional and Class Components. It… Read More »

## ReactJS | Components – Set 2

In our previous article on ReactJS | Components we had discuss about components, types of components and how to render components. In this article, we… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 70

Consider a Takagi – Sugeno – Kang (TSK) Model consisting rules of the form: If Xi is Ai1 and… and xr is Air THEN y… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 69

Consider the following LPP : Min Z = 2×1 + x2 + 3×3 Subject to : x1 − 2×2 + x3 ≥ 4 2×1 +… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 68

Consider the following LPP : Max Z = 15×1 + 10×2 Subject to the constraints 4×1 + 6×2 ≤ 360 3×1 + 0x2 ≤ 180… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 67

Which of the following is a valid reason for causing degeneracy in a transportation problem ? Here m is no. of rows and n is… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 66

For any binary (n, h) linear code with minimum distance (2t+1) or greater (A) 2t+1 (B) t+1 (C) t (D) t-1 Answer: (B) Explanation: Quiz… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 65

Entropy of a discrete random variable with possible values {x1, x2, …, xn} and probability density function P(X) is : The value of b gives… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 64

A 4×4 DFT matrix is given by : (j2 = −1) Where values of x and y are _____, _____ respectively. (A) 1, −1 (B)… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 63

Consider the following languages: L1 = {am bn │ m ≠ n} L2 = {am bn │ m = 2n+1} L3 = {am bm │… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 62

Context free grammar is not closed under: (A) Concatenation (B) Complementation (C) Kleene Star (D) Union Answer: (B) Explanation: Context free grammar are not closed… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 61

Which of the following statements is not correct? (A) Every recursive language is recursively enumerable. (B) L = {0n1n 0n │n=1, 2 , 3, ….}… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 60

Standard planning algorithms assume environment to be __________. (A) Both deterministic and fully observable (B) Neither deterministic nor fully observable (C) Deterministic but not fully… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 59

Consider the following two well-formed formulas in prepositional logic. F1 : P ⇒ ¬ P F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒… Read More »

## UGC-NET | UGC-NET CS 2017 Nov – III | Question 58

“If X, then Y unless Z” is represented by which of the following formulae in propositional logic? (A) (X ∧ Y) → ¬ Z (B)… Read More »