Created it, 06/02/20

Last update it, 06/02/20

Return to the site          To contact the author

Answers 1         Answers 2        Answers 3 


Haut de page Answers to the test N° 1

1st series :

Table_de_verite_test.gif

2nd series :

1 - a)      X = a_et_b_complementation.gif       Þ         X = A_barre1.gif + B_barre.gif

1 - b)      X = a_ou_b_complementation.gif       Þ          X = A_barre1.gif . B_barre.gif

2 - a)      L = (a + b) . (c + d)

Schema_test.gif

2 - b)       L = A_barre1.gif . b . c

Schema1_test.gif

2 - c)         L = (A_barre1.gif . a) + (B_barre.gif . c) + (a . c)

Schema2_test.gif

It is noted that this diagram is simplified :

1)  A_barre1.gif . a = 0

2) In the two branches of the lower part, the contact “c” is common. Only one contact “c” would thus be enough, provided that it is put in series withB_barre.gif + a

That is to say : L = c . (B_barre.gif + a)

The diagram becomes :

 Schema3_test.gif

3rd series :

1)  X = a . B_barre.gif . C_barre.gif + a . b . C_barre.gif + a . B_barre.gif . c + a . b . c

Let us put “a” in factor

X = a (B_barre.gif . C_barre.gif + b . C_barre.gif + B_barre.gif . c + b . c)

Let us put “c” and C_barre.gif in factor

X = [ C_barre.gif (B_barre.gif + b) + c (B_barre.gif + b) ]

We know that B_barre.gif + b = 1

from where   X = a [ C_barre.gif . 1 + c . 1]

                  X = a [ C_barre.gif + c ]

However    C_barre.gif + c = 1

                X = a

2)  Fonction_test.gif

Let us apply the theorem of Morgan :

Fonction1_test.gif

Again let us apply the theorem of Morgan to each member :

Fonction_OU_Exclusive.gif

On reconnaît l'équation du OU Exclusif à deux entrées : a Symbole_du_OU_exclusif.gif b


Haut de page Answers to the test N° 2

1°) A sequential system can have for the same combination of the variables of entry two states different from its or its exits.

2°) To pass from a level L to a level H, one spends a certain time called time boarding which is translated on the chronograms by an oblique face.

3°) A secondary variable or intern is an additional variable function of the exit which makes it possible for an identical combination of the variables of entry of origin to discriminate two states different from the exit in a sequential system.

4°) Primitive Matrix of the states.

Matrice_primitive_des_etats_test.gif

5°) Polygon of fusion.

Polygone_de_fusion_test.gif

6°) Contracted Matrix.

Matrice_contractee_test.gif

7°) Table of Karnaugh.

Tableau_de_Karnaugh_test.gif

8°) Research of the logigramme.

Recherche_du_logigramme_test.gif

Note : It is deduced that S = a + B_barre.gif.

We see that in this example, there is no secondary variable. The problem was not a sequential problem but a combinative problem.

What we could see from the beginning: indeed, the primitive matrix does not present two stable states giving two different levels of exits.

The logigramme will be :

Logigramme_test.gif

The electric diagram would be :

Le_schema_electrique_test.gif

You can check that this assembly functions well as envisaged by deferring you to paragraph 4 of the questionnaire.

In conclusion, you can see that a combinative system is only one particular case of a sequential system for which there is no secondary variable.

We can note that here the contracted matrix, although there is no secondary variable, comprises two lines and that the combinative solution is due only to the grouping in the table of Karnaugh.

Resolution by the combinative method of the same problem.

a  - Truth table.

Table_de_verite_test1.gif

b - Table of Karnaugh.

Tableau_de_Karnaugh_test1.gif

S = a + B_barre.gif : result identical to that found previously.

9°) The chronogram is represented below.

Chronogramme_test.gif

10°) A bistable rocker constitutes an elementary memory of 1 bit. It has two stable states.

11° - a)  To obtain a rocker R.S.C., one starts from a rocker R_barre_et_S_barre.gif.

One adds two doors NAND on R_barre.gif and S_barre.gif, which gives us the entries R and S.

Lastly, one connects together an entry of each one of his doors as represented below to obtain the order C.

Schema_de_la_bascule_RSC_test.gif

11° - b) To obtain a rocker D, one gathers R and S in only one entry such as R = S_barre.gif by means of a reverser as represented below.

Bascule_de_type_D_ou_latch_test.gif 

12°) supplemented Chronogram relating to the rocker D of the latch type.

Chronogramme_de_la_bascule_D_de_type_latch.gif


Haut de page Answers to the test N° 3

1°) Chronogram supplemented for the exit Q :

Reponse_test_5_1.gif

2°) Chronogram supplemented for the exits Q1 and S.

Reponse_test_5_2.gif

T' = 4T. This assembly is a divider of frequency by 4.

3°) the role of entry PRESET is to position the exit Q of the rocker to state 1 independently of the state of the other entries of this rocker. The role of entry CLEAR is to position the exit Q of the rocker to state 0 independently of the state of the other entries of this rocker.

4°) Chronogram relating to rocker JK.

Reponse_test_5_4.gif


Return to the site         To contact the author

 

     

Daniel