The computer was invented by <span>Tom Warburton.</span>
Answer:
Hi, for this exercise we have two laws to bear in mind:
Morgan's laws
NOT(А).NOT(В) = NOT(A) + NOT (B)
NOT(A) + NOT (B) = NOT(А).NOT(В)
And the table of the Nand
INPUT OUTPUT
A B A NAND B
0 0 1
0 1 1
1 0 1
1 1 0
Let's start!
a.
Input OUTPUT
A A A NAND A
1 1 0
0 0 1
b.
Input OUTPUT
A B (A NAND B ) NAND (A NAND B )
0 0 0
0 1 0
1 0 0
1 1 1
C.
Input OUTPUT
A B (A NAND A ) NAND (B NAND B )
0 0 0
0 1 1
1 0 1
1 1 1
Explanation:
In the first one, we only need one input in this case A and comparing with the truth table we have the not gate
In the second case, we have to negate the AND an as we know how to build a not, we only have to make a nand in the two inputs (A, B) and the make another nand with that output.
In the third case we have that the OR is A + B and we know in base of the morgan's law that:
A + B = NOT(NOT(А).NOT(В))
So, we have to negate the two inputs and after make nand with the two inputs negated.
I hope it's help you.
Answer:
Diamond pickaxe with efficiency 3
Explanation: It will mine quicker and you can just get unbreaking
You may do all of the given options.
Thank You!
Answer:
The correct answer for the given question is " The Code fragment A runs fastly than the code fragment of B".
Explanation:
In this question there are some information is missing i. e options. The question does not give any options. The options for the given question is given below
(A.) The Code fragment A runs fastly than the code fragment of B.
(B.) The Code fragment B runs fastly than code fragment of A.
(C) The Code fragment A runs as fastly as code fragment of B.
So we conclude the answer i.e option(A) because As given in the question list1 is a MyArrayList and list2 is a MyLinkedList. , in list1 we fetching the data easily and fastly means that it remove the data easily as compare to list2 As MyArrayList is storing the list only and also we can fetch the data easily manner.
The list2 is an object of MyLinkedList means that it manipulating the data fastly as compared to MyArrayList but if we compared the fetching of data then MyArrayList is a better option so the code fragment runs fastly then code fragmented B.