Answer:
Explanation:
Well here you only have to add 2 new horses .... so simply what you can do is find 2 slots where the gap is maximum ... lets take the given example in detail to understand the same.... here 10001001000010 here you can observe that the difference between the first two filled slots is 3 then 2 then 4 then 1....... make it a separate array ...... now as i said that we just need to place two new horses so we just need two of the biggest numbers from this array and place the new horses at the center of the corresponding slots ... like here 3 and 4 are greatest ... so one horse is placed in between the gap corresponding to 3 while other at 4 ..... after making the new array answer can be find in linear time itself... I hope this makes sense ....
Now lets understand how to program it easily so firstly after scanning all stuff ..... we will make a gap array .... then just think now what we will do is find the greatest two numbers then again putting the horses and then find our answers .... so now an easy approach is that instead of making the string again and again searching for answer .... what we do is just do half of the two greatest ones and again find the greatest one in array....
B. To organize information using shapes.
Explanation:
the process of displaying the information from the table is called query
<h2>hey friend </h2><h2>your answer is here </h2><h2>I hope it will be helpful you </h2><h2>please mark as brainiest answer </h2><h2>thank you </h2>
Thank you for being the rare question where you actually provide what language you want your answer in; I approve, and encourage this.
In Java, the following will work.
I made it a bit more versatile to work with others numbers, other than 99, if you so please (if not, just hardcode the 99 in yourself).
// Example list - fill this with numbers yourself.
ArrayList<Integer> nums = new ArrayList<>();
int n = 99;
int count = (int)nums.stream().filter(i -> i == n).count();
System.out.println(n + " occurences.");
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!