🌟 MCA Gold Medalist 🌟 Star Educator 🌟Gate Qualified 🔴UGC NET qualified🌟BOOK published on LINUX ADMINISTRATION by kalyani publish

Nisha Mittal

In this course Nisha Mittal will provide topic detail and  solutions of questions of NTA NET computer science examination related to discrete structure topic : relation and Function.

Prepare for UGC NET 2019 by watching our free online lessons covering UGC Net syllabus and also helping you solve Previous year question papers. Pursue your dream of JRF.

NTA-UGC-NET & SET Exams

Hindi

(Hindi) Relation and Function for NTA UGC NET: Computer Science

Discrete Probability

Discrete Structure & Optimization

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

In this course Nisha Mittal will provide solutions of questions of NTA NET computer science examination relared to topic relation and Function .Also you will understand topic in detail .

Overview of the Course (in Hindi)

In this lesson Nisha Mittal will teach in detail reflexive, symmetric and transitive properties in a relation of discrete structure topic for NTA UGC NET computer science examination.

Reflexivity, Symmetry, and Transitivity Property in Relation (in Hindi)

In this lesson you will learn how to check if a given relation is not reflexive,not symmetric , not antisymmetric ,not transitive for NTA UGC NET computer science examination and GATE.

Questions Related to Reflexivity, Symmetry, and Transitivity (in Hindi)

f : R →R satisfies f(x + y) = f(x) + f(y), for all x,y ∈ R and f(1) = 7, then Σf(r) for r = 1 to n, is  
 (a) 7n/2  
(b) 7(n + 1)/2 
(c) 7n(n + 1) 
(d)  7n(n + 1)/2

F(x + y) = f(x) + f(y), for all x,y ∈ R and f(1) = 7, then Σf(r) for r = 1 To n (in Hindi)

Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set  A = {1,2,3,4}. The relation R is (a) a function (b) transitive (c) not symmetric (d) reflexive

R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A = {1,2,3,4}(in Hindi)

Let R = { ( 3, 3 ) ( 6, 6 ) ( ( 9, 9 ) ( 12, 12 ), ( 6, 12 ) ( 3, 9 ) ( 3, 12 ), ( 3, 6 ) } be a relation on the set A = { 3, 6, 9, 12 }. The relation is 
 ( a ) reflexive and transitive 
 ( b ) reflexive only  
( c ) an equivalence relation  
( d ) reflexive and symmetric only

The relation R on set A then the relation is what (in Hindi )

F(x ) satisfies the funtional equation f ( x - y )=f( x)f( y ) -f(a-x)f (a+y) (in Hindi)

A  relation  R  in  {1,2,3,4,5,6}  is  given  by  {(1,2),(2,3),(3,4),(4,4),(4,5)}.  The relation  is :    
 (A) Reflexive   
(B) symmetric  
 (C)   Transitive 
  (D)   not  reflexive, not  symmetric  and  not transitive

A relation R in {1,2,3,4,5,6} is given check the property of relation (In Hindi )

If  she is my friend  and  you  are her  friend,  then  we  are friends. Given  this, the  friend  relationship  in  this context  is  …………... 
(i)  Commutative  
 (ii)  Transitive   
(iii)  Implicative   
(iv)  Equivalence   
(A)   (i)  and  (ii)   
(B)   (iii) 
(C)   (i),  (ii),  (iii)  and   
(D)   None  of these

Given this, the friend relationship in this context is …(in Hindi )

Which of the following is the appropriate representation to model this situation? (In Hindi )

P is given by the set R then Relation is of what type ? ( In Hindi)

Let A = {1, 2}. Construct the set ρ(A) × A, where ρ(A)is power set(in Hindi)

If f(x) =x+1 and g(x)=x+3 then fofofof is: (in Hindi)

Which of the following is an equivalence relation on the set of all functions from Z toZ ?(in Hindi)

Let R be the relation defined on the set of natural number N as aRb, if a divides b(in Hindi)

In this course, the educator Nisha Mittal will provide solutions of questions related to propositional logic. This topic is very important for UGC NET computer science, Gate, KVS PGT,  HTET aspirants

(Hindi) Propositional Logic-Computer Science: NTA UGC NET

In this course Nisha Mittal will provide solutions of questions of set theory for NTA NET computer science. Here you will understand all important topics of set theory with the help of questions .

(Hindi) Set Theory for NTA UGC NET Computer Science Examination

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Tricks To Solve Propositional logic in Discrete Mathematics - UGC NET CS 2019.

(Hindi) Tricks to Solve Propositional Logic in Discrete Mathematics - UGC NET CS 2019

In this course Nisha Mittal will provide solutions of Functions topic of discrete structure questions for NTA NET computer science examination. This course will be helpful to GATE computer science, KVS PGT, TGT computer science students also

(Hindi ) Function-related Important Questions: NTA-UGC NET

In this course Nisha Mittal will provide solutions of questions of graph theory.  Also you will understand  important topics with the help of these lessons .

Lessons

15 lessons • 1h 57m

Invalid Date

NaN

Overview of the Course (in Hindi)

Invalid Date

NaN

Reflexivity, Symmetry, and Transitivity Property in Relation (in Hindi)

Invalid Date

NaN

Questions Related to Reflexivity, Symmetry, and Transitivity (in Hindi)

Invalid Date

NaN

F(x + y) = f(x) + f(y), for all x,y ∈ R and f(1) = 7, then Σf(r) for r = 1 To n (in Hindi)

Invalid Date

NaN

R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A = {1,2,3,4}(in Hindi)

Invalid Date

NaN

The relation R on set A then the relation is what (in Hindi )

Invalid Date

NaN

F(x ) satisfies the funtional equation f ( x - y )=f( x)f( y ) -f(a-x)f (a+y) (in Hindi)

Invalid Date

NaN

A relation R in {1,2,3,4,5,6} is given check the property of relation (In Hindi )

Invalid Date

NaN

Given this, the friend relationship in this context is …(in Hindi )

Invalid Date

NaN

Which of the following is the appropriate representation to model this situation? (In Hindi )

+ See all lessons