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

Nisha Mittal

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

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) Propositional Logic-Computer Science: NTA UGC NET

Discrete Probability

Discrete Structure & Optimization

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson Nisha Mittal will provide detail of the Course related to propositional logic of discrete structure .

Overview of Course (in Hindi)

Which  of the  following propositions  is a tautology? A.(p  ∨  q) → p   B.p  ∨  (q  → p) C.p  ∨  (p  → q) D.p → (p  → q)

Which of the Following Propositions is a Tautology (in Hindi)

Propositional Logic: Semantics 
  p  --> q   =    ~p v q

Propositional Logic About Implication (in Hindi)

Propositional Logic about Biconditional (in Hindi)

The proposition p ∧  (∼ p ∨ q)  is:    A. a tautology  
B.logically equivalent to p ∧ q 
C. logically equivalent to p ∨  q 
D. a contradiction  
E. none of the above

The Proposition p ∧ (∼ p ∨ q) is Equivalent to (in Hindi)

Integer value that satisfies ¬((p → q) ∧ (¬r ∨ ¬s)) (in Hindi)

Consider the statement “Not all that glitters is gold” (in Hindi )

Let P, Q and R be three atomic prepositional assertions. Let X denote (P v Q) → R and Y denote (P → R) v (Q → R). Which one of the following is a tautology?
 (A) X ≡ Y 
(B) X → Y
 (C) Y → X
 (D) ¬ Y → X

X denote (P v Q) → R and Y denote (P → R) v (Q → R) (in Hindi)

What is the first order predicate calculus statement equivalent to the following? Every teacher is liked by some student
 (A) ∀(x) [teacher (x) → ∃ (y) [student (y) → likes (y, x)]] 
(B) ∀ (x) [teacher (x) → ∃ (y) [student (y) ^ likes (y, x)]]
 (C) ∃ (y) ∀ (x) [teacher (x) → [student (y) ^ likes (y, x)]]
 (D) ∀ (x) [teacher (x) ^ ∃ (y) [student (y) → likes (y, x)]]

Every teacher is liked by some student propositional logic (in Hindi)

Consider  the following  statements:   
 P: Good mobile  phones  are not  cheap  
  Q: Cheap mobile  phones  are  not  good  
 L:  P  implies Q   
M: Q  implies  P 
  N:  P  is equivalent  to Q  
 Which  one of the  following  about  L,  M,  and  N  is CORRECT?   A. Only  L  is TRUE.   
B. Only  M  is TRUE.  
 C.  Only  N  is TRUE.  
 D.   L, M and  N are TRU

Which statement is correct (in Hindi)

Consider  the following  propositional  statements: P1:((A∧B)→C))≡((A→C)∧(B→C)) P2:((A∨B)→C))≡((A→C)∨(B→C)) Which  one  of the  following  is  true? 
A. P1 is  a tautology,  but  not  P2 B. P2 is  a tautology,  but  not  P1 C. P1 and P2 are both  tautologies D. Both  P1 and  P2 are not  tautologie

Find the tautology (in Hindi)

P and Q are two propositions.Which of the logical expressions are equivalent? (In Hindi)

Which of the following is TRUE?satisfiable and not satisfiable(in Hindi )

Show that (p → q) ∧ (q → r) → (p → r) is a tautology(in Hindi)

Show that (p → q) ∨ (p → r) and (p → (q ∨ r)) are logically equivalent(in Hindi)

Which of the following is the negation of [∀x, α →(∃y, β →(∀u, ∃v, y))]( in Hindi)

The CORRECT formula for the sentence, “not all rainy days are cold” (in Hindi )

Integer number divisonal by a number (in Hindi )

How many multiples of 6 are there between the following pairs of numbers?( In Hindi )

Convert this argument into logical notations( in Hindi )

Find the solution of the expression (in Hindi )

Correct inference of the expression( in Hindi )

Well formed formula related to quantifier (in Hindi )

Show this is tautology( in Hindi )

Solve for tautology with Boolean laws( in Hindi )

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 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

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.

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

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

25 lessons • 1h 59m