C hope that helps have a good day and I feel you good for big hugs
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:
A.O(1)
Explanation:
In the implementation of queue by using linked chain the performance of the enqueue operation is O(1).We have to maintain two pointers one head and the other tailand for enqueue operation we have to insert element to the next of the tail and then make that element tail.Which takes O(1) time.