4.6 Boolean functions and truth-table inputs For this assignment you will implement a number of Boolean functions, such as implies, nand, etc. In this assignment you will implement several Boolean functions that will later enable you to compute their truth tables. In addition, you will implement a function that creates all combinations of Boolean values for n variables. a) Boolean functions You are provided with a set of Boolean functions to implement. You will create the bodies for these 2 parameter functions, such that they return the appropriate Boolean value (True or False). The formal parameters are always p and q (in that order). The code provides the specification of the Boolean functions that need to be implemented. b) Truth-table inputs The function make_tt_ins (n) will create all combination of Boolean values for n variables, which is the input that needs to be provided for a truth table with n variables. For example make_tt_ins (2) needs to return [[False, False], [False, True], [True, Falsel, [True, True]] Note that we do not care about the order, so [[True, True], [False, False], [False, True], [True, Falsell is also valid output. Since the input for a truth table has 2^n entries, the output for this function is a list with 2^n elements, each of which is a list of n Boolean values. We suggest to solve this problem recursively: use the list generated by makettins(n-1) and update it accordingly by appending True/False to each row. For the base case (n==1) you should return [[False], [True]] Two functions are provided: run (f) and main, so that you can test your code. 23 777 Help/FA m stv
4.6 Boolean functions and truth-table inputs For this assignment you will implement a number of Boolean functions, such as implies, nand, etc. In this assignment you will implement several Boolean functions that will later enable you to compute their truth tables. In addition, you will implement a function that creates all combinations of Boolean values for n variables. a) Boolean functions You are provided with a set of Boolean functions to implement. You will create the bodies for these 2 parameter functions, such that they return the appropriate Boolean value (True or False). The formal parameters are always p and q (in that order). The code provides the specification of the Boolean functions that need to be implemented. b) Truth-table inputs The function make_tt_ins (n) will create all combination of Boolean values for n variables, which is the input that needs to be provided for a truth table with n variables. For example make_tt_ins (2) needs to return [[False, False], [False, True], [True, Falsel, [True, True]] Note that we do not care about the order, so [[True, True], [False, False], [False, True], [True, Falsell is also valid output. Since the input for a truth table has 2^n entries, the output for this function is a list with 2^n elements, each of which is a list of n Boolean values. We suggest to solve this problem recursively: use the list generated by makettins(n-1) and update it accordingly by appending True/False to each row. For the base case (n==1) you should return [[False], [True]] Two functions are provided: run (f) and main, so that you can test your code. 23 777 Help/FA m stv
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 20PE
Related questions
Question
![inputs
Note that we do not care about the order, so
4.6 Boolean functions and truth-table inputs
For this assignment you will implement a number of Boolean functions, such as implies, nand, etc.
In this assignment you will implement several Boolean functions that will later enable you to compute their truth tables. In addition, you will
implement a function that creates all combinations of Boolean values for n variables.
a) Boolean functions
You are provided with a set of Boolean functions to implement. You will create the bodies for these 2 parameter functions, such that they
return the appropriate Boolean value (True or False). The formal parameters are always p and q (in that order). The code provides the
specification of the Boolean functions that need to be implemented.
b) Truth-table inputs
The function make_tt_ins (n) will create all combination of Boolean values for n variables, which is the input that needs to be provided
for a truth table with n variables.
For example make_tt_ins (2) needs to return
[[False, False], [False, True], [True, False], [True, True]]
zyBooks catalog
[[True, True], [False, False], [False, True], [True, False]]
is also valid output. Since the input for a truth table has 2^n entries, the output for this function is a list with 2^n elements, each of which is
a list of n Boolean values.
We suggest to solve this problem recursively: use the list generated by makettins(n-1) and update it accordingly by appending True/False to
each row. For the base case (n==1) you should return [[False], [True]]
Two functions are provided: run (f) and main, so that you can test your code.
23
m stv
Help/FAQ Farzana Fa
Aa](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe1b1d143-3544-4565-ae01-c2b2100e15ce%2F5bcd371a-97aa-4776-9b66-97bbc2b5d476%2Fkk94jte_processed.jpeg&w=3840&q=75)
Transcribed Image Text:inputs
Note that we do not care about the order, so
4.6 Boolean functions and truth-table inputs
For this assignment you will implement a number of Boolean functions, such as implies, nand, etc.
In this assignment you will implement several Boolean functions that will later enable you to compute their truth tables. In addition, you will
implement a function that creates all combinations of Boolean values for n variables.
a) Boolean functions
You are provided with a set of Boolean functions to implement. You will create the bodies for these 2 parameter functions, such that they
return the appropriate Boolean value (True or False). The formal parameters are always p and q (in that order). The code provides the
specification of the Boolean functions that need to be implemented.
b) Truth-table inputs
The function make_tt_ins (n) will create all combination of Boolean values for n variables, which is the input that needs to be provided
for a truth table with n variables.
For example make_tt_ins (2) needs to return
[[False, False], [False, True], [True, False], [True, True]]
zyBooks catalog
[[True, True], [False, False], [False, True], [True, False]]
is also valid output. Since the input for a truth table has 2^n entries, the output for this function is a list with 2^n elements, each of which is
a list of n Boolean values.
We suggest to solve this problem recursively: use the list generated by makettins(n-1) and update it accordingly by appending True/False to
each row. For the base case (n==1) you should return [[False], [True]]
Two functions are provided: run (f) and main, so that you can test your code.
23
m stv
Help/FAQ Farzana Fa
Aa
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L