Answer:
z = a.c' + a.b.d' + b.c'.d'
Explanation:
The truth table for this question is provided in the attachment to this question.
N.B - a' = not a!
The rows with output of 1 come from the following relations: 01 > 00, 10 > 00, 10 > 01, 11 > 00, 11 > 01, 11 > 10
This means that the Boolean expression is a sum of all the rows with output of 1.
z = a'bc'd' + ab'c'd' + ab'c'd + abc'd' + abc'd + abcd'
On simplification,
z = bc'd' + ab'c' + ac'd' + ac'd + abc' + abd'
z = ac' + abd' + bc'd'
Hope this helps!
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
Computer Chips. / SILICON. This is just an educated guess
B. A generated report will include all records that a query fetches.
Keratin is found in both hair and nails.
Hope this helps!
