Exam #1 (Apparently, I did not type the solutions to this exam. Sorry.)
Exam #2 (Sorry again.)
Assignment #1:
(Unix system callls)
Solution by Mike Camp: Code,
Script
Assignment #2. (Unix
named/unnamed pipe programming)
Solution by Evan Markensohn:Codea Codeb
Outputa Outputb
Outputc
Assignment #3 . (Concurrent algorithms with semaphores and conditional critical
region statements)
Solution: By the recitation leader Ben Karas:
algorithms
Assignment #4 . (Concurrent algorithms with monitors)
Solution: By the recitation leader Murat Tasan.
Assignment #5 .
(Unix System V IPC semaphores+shared memory programming)
Solution by Laszlo Lieszkovszky: source1
source2 Makefile,
output
Assignment #6 . (Solaris RPCs; producer-consumer problem)
Solution by Evan Markensohn: server
code producer code consumer
code prod_cons.x
Assignment #7 . Due April 21st.
(Connection Oriented (TCP/IP) Sockets--Sequential Server).
Late assignments will not be accepted.
Notes: (1) Keep a mailbox size of 15.
(2) The server, AFTER it becomes full and receives two write requests, deletes the earliest two
mail occurrences from the mailbox. This provision is to allow writers to
continue writing to the mailbox after it becomes full.
Solution by David Meeker: code
client.reader.output client.writer.output
server.output
Assignment #8 . Due April 21st.
(Connectionless (UDP/IP) sockets and Posix Threads--Concurrent Server).
Late assignments will not be accepted.
Notes: (1) Keep a mailbox size of 15.
(2) The server, AFTER it becomes full and receives two write requests, deletes the earliest two
mail occurrences from the mailbox. This provision is to allow writers to
continue writing to the mailbox after it becomes full.
Solution by Joshua Levine: server
code reader code writer
code header