Which of the following are slide layouts in
1 answer:
You might be interested in
Answer:
Explanation:
The following code is written in Python. It is a recursive function that tests the first and last character of the word and keeps checking to see if each change would create the palindrome. Finally, printing out the minimum number needed to create the palindrome.
import sys
def numOfSwitches(word, start, end):
if (start > end):
return sys.maxsize
if (start == end):
return 0
if (start == end - 1):
if (word[start] == word[end]):
return 0
else:
return 1
if (word[start] == word[end]):
return numOfSwitches(word, start + 1, end - 1)
else:
return (min(numOfSwitches(word, start, end - 1),
numOfSwitches(word, start + 1, end)) + 1)
word = input("Enter a Word: ")
start = 0
end = len(word)-1
print("Number of switches required for palindrome: " + str(numOfSwitches(word, start, end)))
The logical expressions are
- (X NOR Y ) OR Z ⇒
- (A NAND B) AND NOT C ⇒
<u>Logical expression 1</u>
X and Y are linked by the NOR gate.
So, we have:
X NOR Y
The X NOR Y is linked to Z by the OR gate.
So, we have:
(X NOR Y) OR Z
Hence, the logical expression is (X NOR Y ) OR Z ⇒
<u>Logical expression 2</u>
A and B are linked by the NAND gate.
So, we have:
A NAND B
The A NAND B is linked to C by the AND gate.
So, we have:
(A NAND B) AND C
Hence, the logical expression is (A NAND B) AND NOT C ⇒
See attachment for the truth tables
Read more about truth tables at:
#SPJ1
