Answer:
For question a, it simplifies. If you re-express it in boolean algebra, you get:
(a + b) + (!a + b)
= a + !a + b
= b
So you can simplify that circuit to just:
x = 1 if b = 1
(edit: or rather, x = b)
For question b, let's try it:
(!a!b)(!b + c)
= !a!b + !a!bc
= !a!b(1 + c)
= !a!b
So that one can be simplified to
a = 0 and b = 0
I have no good means of drawing them here, but hopefully the simplification helped!
One advantage of Binary Search Algorithm:
Compared to Linear search it is much faster because linear search starts its searching right from the first value but binary searches for something by splitting the array in two again and again and again.
One disadvantage of Binary Search Algorithm:
Have to be sorted, unlike linear search that doesn't have to be.
Answer:
Input, output, storage.
Explanation:
Input is used to interact with, or send data to the computer (mouse, keyboards, etc.). Output provides output to the user from the computer (monitors, printers, etc.). And storage which stores data processed by the computer (hard drives, flash drives, etc.).
Answer:
import java.util.Scanner;
public class ss11{
public static void main (String[]args) {
Scanner keyboard = new Scanner (System.in)
String a1, a2, a3, a4, a5;
int i1, i2, i3, i4, i5;
System.out.println("Enter a four bit binary number:");
a1= keyboard.next();
a2= a1.substring(0,1);
a3= a1.substring(1,2);
a4= a1.substring(2,3);
a5= a1.substring(3,4);
i1 = Integer.parseInt(a2);
i2 = Integer.parseInt(a3);
i3 = Integer.parseInt(a4);
i4 = Integer.parseInt(a5);
i1= i1 * 8;
i2= i1 * 4;
i3= i1 * 2;
i4= i1 * 1;
i5= i1+i2+i3+i4;
System.out.println("The converted decimal number is: +i5);
}
}
Explanation:
