A combinational rationale circuit takes a 4-bit unsigned double…
Question Answered step-by-step A combinational rationale circuit takes a 4-bit unsigned double… A combinational rationale circuit takes a 4-bit unsigned double whole number at itsinputs named D3 , D2 , D1 and D0 , where D3 is the most signifificant bit. Fordecimal information 1, 2, 3, 5, 7, 11 and 13, the result S is to be at rationale 1, and it isto be at rationale 0 in any case.(I) Write down reality table for the necessary combinational rationale work.(ii) Using a Karnaugh map, decide the simplifified Boolean articulation for theyield S with regards to the data sources D3 to D0 in a base amount of-itemsstructure.(iii) Describe what is implied by a fundamental term in a Karnaugh map. Composedown the fundamental terms for the Karnaugh map in (ii).(iv) Using a Karnaugh map, this time decide the required simplifified Booleanarticulation for the result S in a base result of-totals structure.[10 marks](b) Provide a circuit chart which executes the accompanying Boolean capacity utilizingjust NAND doorsF = (A + D).(B + C + D).(A + B + C)that has the don’t mind states: A.B.C.D, A.B.C.D, A.B.C.D and A.B.C.D[4 marks](c) Show that(X + Y ).(X + Z) = X + Y.Z(X + Y ).(X + Z) = X.Z + X.YUtilizing these outcomes or in any case, work on the accompanying articulationP = (A + B + C).(A + B + D).(A + B + E).(A + D + E).(A + C)[6 marks]2CST.2014.2.32Advanced Electronics(a) Show how two NOR entryways might be associated with structure a RS lock. Portrayits activity and give a table relating its contributions to its results. How should youutilize this circuit to dispose of the effffect of contact bob in a solitary post twofoldtoss change providing a contribution to a computerized rationale circuit? [6 marks](b) The state grouping for a specific 4-bit paired up-counter is as per the following:Show how four negative edge set off T-type flflip-flflops (FFs) with yieldsmarked QA , QB , QC and QD can be utilized to execute a wave counter havingthe specifified state succession. Show any combinational rationale vital expectingthat the FFs have nonconcurrent reset inputs accessible. [4 marks](c) Using the standards of simultaneous plan, decide the following state combipublic rationale articulations expected to execute a counter having the statesuccession specifified to a limited extent (b ). Expect that D-type FFs are to be utilized andthat unused states don’t happen. [4 marks](d) Explain cautiously what occurs if the counter in (c ) begins in state 1 1 1 0 . Ingeneral, how could fire up issues be defeated in the plan of coordinatedstate machines? [4 marks](e) What are the benefits and detriments of the simultaneous plan partially(c ) contrasted and the elective plan to some extent (b )? [2 marks]A progression of squares is introduced as a whole number exhibit, for example, {14, 9, 12, 4, 7, 1}. These should cycle these squares in exact succession from left to right, inferring that the request in which these squares are put in the cluster is critical. Since these squares are utilized to build towers, every one should be a part of something like one pinnacle. A square should be placed on the table to start another pinnacle, or on top of a rigorously greater square that is by and by on top of a formerly shaped tower, making that tower one square taller.The objective is to downplay the general number of pinnacles. The former squares, for instance, can be set into two pinnacles, yet no more. The squares {14, 12, 7} are in the primary pinnacle, while the squares {9, 4, 1} are in the subsequent pinnacle, as per one working plan. Both of these pinnacles have their squares according to the pattern in which as they showed up in the first exhibit comparative with one another, as may be obvious. The most ideal way to squeeze the most squares into the most modest number of pinnacles isn’t a similar all the time. Thus, your technique should just return the absolute minimum of pinnacles, no genuine functional plan of squares into towers.Utilize another class Towers, and there the single strategypublic static int minimizeTowers(int[] blocks)that tracks down the most modest number of pinnacles conceivable with the gave squares and brings it back. Your answer ought to be quickly enough to run the pseudorandom fluff test for 30,000 haphazardly produced squares of pyramidally developing lengths shortly.JUnit Test:import org.junit.Test;import java.util.Arrays;import java.util.Random;import java.util.zip.CRC32;import static org.junit.Assert.assertEquals;public class TowersTest { // Change this to a bigger number to see that many outcomes printed. private static last int PRINT_FIRST_RESULTS = 0; @Test public void testTowersExplicit() { int[] t0 = {3, 1}; assertEquals(1, Towers.minimizeTowers(t0)); int[] t1 = {7, 1, 8, 4}; assertEquals(2, Towers.minimizeTowers(t1)); int[] t2 = {4, 1, 7, 8}; assertEquals(3, Towers.minimizeTowers(t2)); int[] t3 = {6, 2, 3, 1, 7, 8}; assertEquals(4, Towers.minimizeTowers(t3)); int[] t4 = {14, 9, 7, 12, 4, 1}; assertEquals(2, Towers.minimizeTowers(t4)); int[] t5 = {2, 16, 20, 7, 10, 17, 13, 14, 3, 1, 4}; assertEquals(5, Towers.minimizeTowers(t5)); int[] t6 = {18, 7, 13, 15, 12, 2, 5, 3, 14, 9, 4, 1}; assertEquals(3, Towers.minimizeTowers(t6)); int[] t7 = {1, 1, 2}; assertEquals(3, Towers.minimizeTowers(t7)); int[] t8 = {3, 1, 5, 5}; assertEquals(3, Towers.minimizeTowers(t8)); int[] t9 = {1, 1, 2, 4, 5, 1, 5, 5, 6, 8, 9}; assertEquals(10, Towers.minimizeTowers(t9)); int[] t10 = {1, 9, 5, 5, 7, 3, 6, 12, 12, 9, 9, 10, 1}; assertEquals(7, Towers.minimizeTowers(t10)); int[] t11 = {6, 3, 10, 3, 1, 8, 5}; assertEquals(3, Towers.minimizeTowers(t11)); int[] t12 = {12, 1, 13, 6, 13, 1, 4, 1, 11, 12, 9, 13, 8, 3}; assertEquals(6, Towers.minimizeTowers(t12)); int[] t13 = {4, 21, 2, 2, 7, 2, 7, 9, 11, 5, 13, 9, 12, 8, 13, 14, 14, 14, 16, 18, 19, 19, 2, 1, 22}; assertEquals(16, Towers.minimizeTowers(t13)); } @Test public void testTowersHundred() { massTestTowers(100, 960593078L); } @Test public void testTowersTenThousand() { massTestTowers(10_000, 608085326L); } @Test public void testTowersThirtyThousand() { massTestTowers(30_000, 3780361811L); } private void massTestTowers(int n, long expected) { Irregular rng = new Random(n); CRC32 check = new CRC32(); int[] blocks = {}; int count = 0, objective = 1, m = 0; for(int I = 0; I < n; i++) { if(++count == objective) { blocks = new int[++m]; int curr = 1; for(int j = 0; j < m; j++) { blocks[j] = curr; curr += rng.nextInt(3); }Image transcription textCASE STUDY 2- ANALYTICAL HIERARCHY PROCESS (AHP) Student admissions at a University ofTechnology Jim Mathebula, an undergraduate student in the University of Johannesburg, is trying to decidewhich microcomputer to purchase with the money his parents gave him for Christmas. He has red... Show more... Show more Computer Science Engineering & Technology Java Programming COMP 202 Share QuestionEmailCopy link Comments (0)
