Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > The dual of a Boolean function written as is...
Start Learning for Free
The dual of a Boolean function
written as 
is the same expression as that of F with + and swapped. F is said to be self-dual if 
. The number of self-dual functions with Boolean variables is
written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables is- a)
- b)
- c)
- d)
Correct answer is option 'D'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
The dual of a Boolean function written as is the same expression as t...
A function is self dual if it is equal to its dual (A dual function is obtained by interchanging. and +).
For self-dual functions,
1. Number of min terms equals number of max terms
2. Function should not contain two complementary minterms - whose sum equals 2n - 1, where n is the number of variables.
so here (0,7) (1,6) (2,5) (3,4) are complementary terms so in self-dual we can select any one of them but not both.
possibility because say from 
we can pick anyone in minterm but not both.
NOTE:here i have taken only one of the complementary term for min term from the sets.
so remaining numbers will go to MAXTERMS
For above example, 24 = 16 self dual functions are possible
so if we have N variables, total Minterms possible is 2n
then half of them we selected so.
and now we have 2 choices for every pair for being selected.
so total such choices
For self-dual functions,
1. Number of min terms equals number of max terms
2. Function should not contain two complementary minterms - whose sum equals 2n - 1, where n is the number of variables.
so here (0,7) (1,6) (2,5) (3,4) are complementary terms so in self-dual we can select any one of them but not both.
possibility because say from we can pick anyone in minterm but not both.NOTE:here i have taken only one of the complementary term for min term from the sets.
so remaining numbers will go to MAXTERMS
For above example, 24 = 16 self dual functions are possible
so if we have N variables, total Minterms possible is 2n
then half of them we selected so
.and now we have 2 choices for every pair for being selected.
so total such choices
Most Upvoted Answer
The dual of a Boolean function written as is the same expression as t...
A function is self dual if it is equal to its dual (A dual function is obtained by interchanging. and +).
For self-dual functions,
1. Number of min terms equals number of max terms
2. Function should not contain two complementary minterms - whose sum equals 2n - 1, where n is the number of variables.
so here (0,7) (1,6) (2,5) (3,4) are complementary terms so in self-dual we can select any one of them but not both.possibility because say from we can pick anyone in minterm but not both.
NOTE:here i have taken only one of the complementary term for min term from the sets.
so remaining numbers will go to MAXTERMS
For above example, 24 = 16 self dual functions are possible
so if we have N variables, total Minterms possible is 2n
then half of them we selected so.
and now we have 2 choices for every pair for being selected.
so total such choices
For self-dual functions,
1. Number of min terms equals number of max terms
2. Function should not contain two complementary minterms - whose sum equals 2n - 1, where n is the number of variables.
so here (0,7) (1,6) (2,5) (3,4) are complementary terms so in self-dual we can select any one of them but not both.
possibility because say from we can pick anyone in minterm but not both.NOTE:here i have taken only one of the complementary term for min term from the sets.
so remaining numbers will go to MAXTERMS
For above example, 24 = 16 self dual functions are possible
so if we have N variables, total Minterms possible is 2n
then half of them we selected so
.and now we have 2 choices for every pair for being selected.
so total such choices
Free Test
FREE
| Start Free Test |
Community Answer
The dual of a Boolean function written as is the same expression as t...
A function is self dual if it is equal to its dual (A dual function is obtained by interchanging. and +).
For self-dual functions,
1. Number of min terms equals number of max terms
2. Function should not contain two complementary minterms - whose sum equals 2n - 1, where n is the number of variables.
so here (0,7) (1,6) (2,5) (3,4) are complementary terms so in self-dual we can select any one of them but not both.possibility because say from we can pick anyone in minterm but not both.
NOTE:here i have taken only one of the complementary term for min term from the sets.
so remaining numbers will go to MAXTERMS
For above example, 24 = 16 self dual functions are possible
so if we have N variables, total Minterms possible is 2n
then half of them we selected so.
and now we have 2 choices for every pair for being selected.
so total such choices
For self-dual functions,
1. Number of min terms equals number of max terms
2. Function should not contain two complementary minterms - whose sum equals 2n - 1, where n is the number of variables.
so here (0,7) (1,6) (2,5) (3,4) are complementary terms so in self-dual we can select any one of them but not both.
possibility because say from we can pick anyone in minterm but not both.NOTE:here i have taken only one of the complementary term for min term from the sets.
so remaining numbers will go to MAXTERMS
For above example, 24 = 16 self dual functions are possible
so if we have N variables, total Minterms possible is 2n
then half of them we selected so
.and now we have 2 choices for every pair for being selected.
so total such choices
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer?
Question Description
The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer?.
The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer?.
Solutions for The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer?, a detailed solution for The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? has been provided alongside types of The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice The dual of a Boolean function written as is the same expression as that of F with + and swapped. F is said to be self-dual if . The number of self-dual functions with Boolean variables isa)b)c)d)Correct answer is option 'D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup