Department of Artificial Intelligence
Assignment Submission Details
AY-2023- 24
Subject: CORE /Open Elective / Discipline Elective / SOC
Subject Code: 20MAT112
Subject Name: DISCRETE MATHEMATICS STRUCTURE
Name of the Student B.Meghana
Roll. No. 22691A3191
Year /Sec II – CAI – B Sec
Assignment No. I // II
Marks( **Max 5 Mark)
Uploaded // Drafted - __________
Assignment Moodleuploaded Date
Faculty Sign with name & Date
1.
A) Explain NOT, AND, OR, NAND and NOR gates
with suitable illustrations.
AND gate:
An AND gate is a basic digital logic gate that
performs a logical conjunction. It takes two binary inputs
(usually denoted as A and B) and produces an output (usually
denoted as p or q) based on the AND operation produces a true
output only if both inputs are true; otherwise, it produces a
false output.
A P
B
Input Output
A B P/q
1 1 1
1 0 0
0 1 0
0 0 0
OR gate:
An OR gate is a basic digital gate that performs a logical
disjunction. It takes two binary inputs and produces an output
based on the OR operation. The OR operation produces a true
output if at least one of the input is true; otherwise, it produces
a false output.
A P
B
Input Output
A B p
1 1 1
1 0 1
0 1 1
0 0 0
NOT gate:
A NOT gate, also known as an inverter, is a fundamental
digital logic operation of negation. It takes a single binary input
and produces the opposite output. In other words, if the input
is true, the output will be false, and vice versa.
A A'
Input Output
A A'
0 1
1 0
NOR gate:
A NOR gate is a digital logic gate that performs the logical
NOR operation. It takes multiple binary inputs and produces a
single binary output. The output of a NOR gate is true only
when all of its inputs are false; otherwise, the output is false. In
otherwise, a NOR gate is the negation of the OR operation.
A
P
B
Input Output
A B P
0 0 1
0 1 0
1 0 0
1 1 0
NAND gate:
A NAND gate is a digital logic gate that performs the
logical NAND operation. It takes multiple binary inputs and
produces a single binary output. The output of a NAND gate is
true unless of all its inputs are true; in that case, the output is
false. In other words, a NAND gate is the negation of the AND
operation.
A P
Input Output
A B P
0 1 1
1 0 1
1 1 0
0 0 1
B) Show that the following
(a) ¬(𝑃 ↑ 𝑄) ⇔ ¬𝑃 ↓ ¬𝑄 (b) ¬(𝑃 ↓ 𝑄) ⇔ ¬𝑃 ↑ ¬𝑄.
⇔ ¬(¬(P ۸ Q))
⇔ ¬(¬P ۷⇔¬Q)
⇔ ¬P↓¬Q
(b) ¬(𝑃 ↓ 𝑄) ⇔ ¬𝑃 ↑ ¬𝑄.
⇔ ¬(¬(P ۷ Q))
⇔ ¬( ¬P ۸¬Q)
⇔ ¬P↑¬Q
2.Explain the properties of generalized permutations
and combinations.
A. Generalized permutations and combinations refer to
arrangements and selections of objects where repetition is
allowed. Here are the properties of each:
Generalized Permutations:
1. Order Matters:
The arrangement of objects matters in permutations.
Changing the order of selection results in a different
permutation.
2. Repetition Allowed:
The same object can be chosen multiple times in a
permutation. For example, in selecting a password with
repeated characters.
3. Formula:
The formula to calculate permutations with repetition
is \(n^r \), where \(n \) is the total number of objects to
choose from, and \(r \) is the number of objects to be
selected.
Generalized Combinations:
1. Order Doesn’t Matter:
Unlike permutations, the order of selection
doesn’t matter in combinations. Selecting the same
objects in a different order yields the same
combination.
2. Repetition Allowed:
Similar to permutations, repetition is allowed in
combinations. For instance, selecting multiple items
from a set where duplicates are permissible.
3. Formula:
The formula to calculate combinations with repetition
is \( \binom{n/+r-1}{r} \), where \( n \) is the total number
of objects to choose from, and \( \ r \) is the number of
objects to be selected.