English

HSC Arts (English Medium) 12th Standard Board Exam - Maharashtra State Board Question Bank Solutions

Advertisements
[object Object]
[object Object]
Subjects
Popular subjects
Topics

Please select a subject first

Advertisements
Advertisements
< prev  8261 to 8280 of 9693  next > 

Using the rules in logic, write the negation of the following:

(p ∨ q) ∧ (q ∨ ∼r)

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Using the rules in logic, write the negation of the following:

p ∧ (q ∨ r)

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Advertisements

Using the rules in logic, write the negation of the following:

(p → q) ∧ r

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Using the rules in logic, write the negation of the following:

(∼p ∧ q) ∨ (p ∧ ∼q)

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Without using truth table prove that (p ∧ q) ∨ (∼ p ∧ q) v (p∧ ∼ q) ≡ p ∨ q

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Without using truth table prove that

[(p ∧ q ∧ ∼ p) ∨ (∼ p ∧ q ∧ r) ∨ (p ∧ q ∧ r) ∨ (p ∧ ∼ q ∧ r) ≡ (p ∨ q) ∧ r

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

The statement p → (q → p) is equivalent to ______.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Construct the switching circuit for the following statement : [p v (~ p ∧ q)] v [(- q ∧ r) v ~ p]

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Construct the simplified circuit for the following circuit:

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Find the symbolic form of the following switching circuit, construct its switching table and interpret it.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Construct the switching circuit for the statement (p ∧ q) ∨ (~ p) ∨ (p ∧ ~ q).

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Simplify the following circuit so that the new circuit has minimum number of switches. Also, draw the simplified circuit.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Construct the new switching circuit for the following circuit with only one switch by simplifying the given circuit:

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Find the symbolic form of the given switching circuit. Construct its switching table and interpret your result.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Express the following circuit in the symbolic form of logic and writ the input-output table.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Express the following circuit in the symbolic form of logic and write the input-output table.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined

Express the following circuit in the symbolic form of logic and write the input-output table.

[1] Mathematical Logic
Chapter: [1] Mathematical Logic
Concept: undefined >> undefined
< prev  8261 to 8280 of 9693  next > 
Advertisements
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×