Diseño 1: NACHO Rambo:

 

 

 

Diseño 2: NACHO Boxeador

 

A continuación se listan los proyectos que los Elemental Geeks se encuentran trabajando:

- Sitio Elemental Geeks:

Las tortugas estan comiendo ensalada, los lapiceros siguen sin aparecer, y el maestro aullador todavia no ha emitido comentario alguno sobre activar o no el sitio... o en otras palabras... Sitio en construccion!

- ImagineCup

El equipo de la Universidad Galileo que esta participando en la categoria de Ingenieria de Software  ha logrado clasificar a la final nacional, donde competiran contra un equipo de la Universidad Rafeal Landivar y uno de la Universidad San Carlos.

• 1.3 (10%, 40 lines) Complete the implementation of the Alarm class, by implementing the waitUntil(long x) method. A thread calls waitUntil to suspend its own execution until time has advanced to at least now + x. This is useful for threads that operate in real-time, for example, for blinking the cursor once per second. There is no requirement that threads start running immediately after waking up; just put them on the ready queue in the timer interrupt handler after they have waited for at least the right amount of time. Do not fork any additional threads to implement waitUntil(); you need only modify waitUntil() and the timer interrupt handler. waitUntil is not limited to one thread; any number of threads may call it and be suspended at any one time.
  

   

• 1.4 (20%, 40 lines) Implement synchronous send and receive of one word messages (also known as Ada-style rendezvous), using condition variables (don't use semaphores!). Implement the Communicator class with operations, void speak(int word) and int listen().
  

  speak() atomically waits until listen() is called on the same Communicator object, and then transfers the word over to listen(). Once the transfer is made, both can return. Similarly, listen() waits until speak() is called, at which point the transfer is made, and both can return (listen() returns the word). Your solution should work even if there are multiple speakers and listeners for the same Communicator (note: this is equivalent to a zero-length bounded buffer; since the buffer has no room, the producer and consumer must interact directly, requiring that they wait for one another). Each communicator should only use exactly one lock. If you're using more than one lock, you're making things too complicated.

   

Ciencias de la computación III - Estructuras de máquinas

Laboratorio #03 - Allegre Allegro

Adrián Catalán

Propósito

 

• Familiárizarse con la libreria Allegro
• Iniciar en el game developing en C

 

En esta sección se mostrarán las presentaciones o artículos realizados por los Elemental Geeks.

- Introducción a la Teoría de Juegos :

Entramos a la sala de cine y de pronto nos vemos en una situación en la cual con 3 cajas de poporopos, 4 vasos de gaseosa extra grande debemos correr hacia las butacas de nuestra elección, y...

More...