https://1984.lsi.us.es/wiki-ssoo/api.php?action=feedcontributions&feedformat=atom&user=Edubermar 2026-05-13T10:24:48Z Contribuciones del usuario MediaWiki 1.29.0 https://1984.lsi.us.es/wiki-ssoo/index.php?title=Soluci%C3%B3n_ejercicio_7&diff=2055 2011-12-06T10:19:03Z

<p>Edubermar: </p> <hr /> <div>Hilo h1<br /> &lt;source lang=&quot;c&quot;&gt;<br /> for (int i = 0; i&lt;2; i++){ //#1<br /> while(cerrojo_p2); //#2<br /> cerrojo_p1 = 1; //#3<br /> f(); //#4<br /> cerrojo_p1 = 0; //#5<br /> <br /> }<br /> &lt;/source&gt;<br /> <br /> Hilo h2<br /> <br /> &lt;source lang=&quot;c&quot;&gt;<br /> for (int i = 0; i&lt;2; i++){ //#1<br /> while(cerrojo_p1); //#2<br /> cerrojo_p2 = 1; //#3<br /> f(); //#4<br /> cerrojo_p2 = 0; //#5<br /> <br /> }<br /> &lt;/source&gt;<br /> <br /> &gt; = Fin de su ejecucion<br /> <br /> <br /> | #1| #2| #3| | | | #4| #5| #1| | | | #2| #2| #2| | | | #2| #3| #4| | | | #5| #1| |<br /> h1|---|---|---| | | |---|---|---| | | |---|---|---| | | |---|---|---| | | |---|---&gt; |<br /> | | | | | | | | | | | | | | | | | | | | | | | | | | | |<br /> | | | | #1| #2| #2| | | | #2| #3| #4| | | | #5| #1| #2| | | | #3| #4| #5| | | #1|<br /> h2| | | |---|---|---| | | |---|---|---| | | |---|---|---| | | |---|---|---| | |---&gt;<br /> | | | | | | | | | | | | | | | | | | | | | | | | | | | |<br /> |___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|<br /> 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27<br /> <br /> Nota: La solución que estaba antes propuesta no tenia relación con el ejercicio 7.Esta solucion todavía no ha sido revisada por Pablo.</div>

Edubermar https://1984.lsi.us.es/wiki-ssoo/index.php?title=Soluci%C3%B3n_ejercicio_7&diff=2054 2011-12-06T10:18:44Z

<p>Edubermar: </p> <hr /> <div>Hilo h1<br /> &lt;source lang=&quot;c&quot;&gt;<br /> for (int i = 0; i&lt;2; i++){ //#1<br /> while(cerrojo_p2); //#2<br /> cerrojo_p1 = 1; //#3<br /> f(); //#4<br /> cerrojo_p1 = 0; //#5<br /> <br /> }<br /> &lt;/source&gt;<br /> <br /> Hilo h2<br /> <br /> &lt;source lang=&quot;c&quot;&gt;<br /> for (int i = 0; i&lt;2; i++){ //#1<br /> while(cerrojo_p1); //#2<br /> cerrojo_p2 = 1; //#3<br /> f(); //#4<br /> cerrojo_p2 = 0; //#5<br /> <br /> }<br /> &lt;/source&gt;<br /> <br /> &gt; = Fin de su ejecucion<br /> <br /> <br /> &gt; = Fin de su ejecucion<br /> <br /> <br /> | #1| #2| #3| | | | #4| #5| #1| | | | #2| #2| #2| | | | #2| #3| #4| | | | #5| #1| |<br /> h1|---|---|---| | | |---|---|---| | | |---|---|---| | | |---|---|---| | | |---|---&gt; |<br /> | | | | | | | | | | | | | | | | | | | | | | | | | | | |<br /> | | | | #1| #2| #2| | | | #2| #3| #4| | | | #5| #1| #2| | | | #3| #4| #5| | | #1|<br /> h2| | | |---|---|---| | | |---|---|---| | | |---|---|---| | | |---|---|---| | |---&gt;<br /> | | | | | | | | | | | | | | | | | | | | | | | | | | | |<br /> |___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|<br /> 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27<br /> <br /> Nota: La solución que estaba antes propuesta no tenia relación con el ejercicio 7.Esta solucion todavía no ha sido revisada por Pablo.</div>

Edubermar