WHO WANTS TO PLAY AMONG US
2 answers:
You might be interested in
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:
Explanation:
The following code is written in Java. It creates the method as requested which takes in a parameter of type Scanner and opens the passed file, reads all the elements, and prints the lowest-priced element in the file. A test case was done and the output can be seen in the attached picture below.
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
class Brainly{
public static void main(String[] args) throws FileNotFoundException {
Scanner console = new Scanner(System.in);
System.out.print("file location: ");
String inputLocation = console.next();
File inputFile = new File(inputLocation);
Scanner in = new Scanner(inputFile);
lowestPrice(in);
}
public static void lowestPrice(Scanner in) {
double smallest = in.nextDouble();
while(in.hasNextDouble()){
double number = in.nextDouble();
if (number < smallest) {
smallest = number;
}
}
System.out.println(smallest);
in.close();
}
}
