Messages
The grades are available and have been sent to all that so far have requested their grade.
Reminder: the grade is a weighted average of:
- Home Exam 1 25%
- Home Exam 2 25%
- Oral Exam 50%
Each has been given a grade A - F but with small or larger plusses or minuses as to avoid unfair rounding errors.
So the published grade has been determined as to keep rounding errors to a minimum.
Distribution:
A 2
B 5
C 3
D 1
E 0
F 0
Thanks for taking the course - it has been fun :)
Sincerely, Eric
Here is the schedule. Now updated with room number and when you should show up.
The exam will be in room OJD 2269 Seminarrom Python.
Good luck.
Eric
Use the Doodle below for choosing which exam slots that you prefer. There are 12 students taking the oral exam. If you have submitted Home Exam 2 AND not heard from me (or MN) then you have been approved for the exam in that we have gone thru the submission and in the first pass approved those that are to pass. Detailed feedback will come later.
Pick as many or as few time slots that you want. You can add comments, e.g., please before lunch or please after lunch. Note that the date is June 11th, 2019.
I will close the poll June 5th 2019 shortly after noon.
Title: 2019-05-23 IN5570
Description:
Duration: {f:Duration[5089466,000]}
Also available for download here: Lecture Recording F13 2019-05-23
Type | Size | Link |
---|---|---|
MP4 with Smart Player (480p) | 74,3 MB | View... |
MP4 with Smart Player (720p) | 105 MB | View... |
MP4 with Smart Player (1080p) | 166 MB... |
Recording:
Title: F12 IN5570 2019-05-09
Description:
Duration: {f:Duration[6239666,000]}
Type | Size | Link |
---|---|---|
MP4 with Smart Player (480p) | 102 MB | View... |
MP4 with Smart Player (720p) | 149 MB... |
Dear students,
At the previous Exercise Session (April 29), I went over the PCRType in Home Exam 2, as well as how to emulate temporary unavailability using Docker. This is now fully covered by the associated notes and sample Emerald files.
--
Oleks
Dear students,
There will be a Q&A Session this afternoon. As usual, at Postscript, 14:15-16:00.
--
Oleks
Dear students,
I seem to have forgotten about the Easter break! I will post some notes on the topics I mentioned earlier, but I don't expect you to show up :-) If you do, see you there.
--
Oleks
Dear students,
The subject matter for today's exercise session is:
- Parametric polymorphism in Emerald, or debunking PCRType from Home Exam 2.
- How to emulate unavailability using Docker.
--
Oleks
The final three lectures in 2019 will be: 25/4, 9/5, 23/5
Eric
Home Exam 2 published, see the files in this folder
Home Exam 1 in Devilry now open.
(Thanx to the student that prodded me - I had forgotten...)
Eric
The material from today's lecture F9 has been uploaded:
- slides: OOPSLA 2000n GC intro, Emerald Spring Cleaning Garbage Collector
- summary
- recording, see also below.
Eric
Title: IN5570 F9v19 lecture...
There is no IN5570 lecture in week 14, i.e., no lecture on April 4th, 2019.
Eric
Dear students,
Due to mild illness, there will be no exercise session today.
Please post any questions you have on Piazza.
--
Oleks
The F8 v19 lecture material has been uploaded.
Note that the first few minutes (before the fire alarm) did not record correctly :-( So the first 8 minutes are lost.
Title: IN5570 F8 v19
Description:
Duration: {f:Duration[4142000,000]}
Type | Size | Link |
---|---|---|
MP4 with Smart Player (480p) | 54,4 MB | View... |
MP4 with Smart Player (720p) | 75,0 MB | View... |
MP4 with Smart Player (1080p) | 117 MB... |
Dear students,
Emerald does not have bitwise xor and negation built-in. You might want these operators for implementing a hash function in Home Exam 1. Luckily, bitwise negation can be simulated using integer negation and subtraction, and xor can be simulated using bitwsise or, and, and negation.
Here is a sample program that
- implements both bitwise negation and xor,
- shows that the (bitwise) negation of 0 is (-1), and vice-versa (recall two's complement arithmetic), and
- prints out the truth-table for xor.
const xorneg <- object xorneg function neg[x : Integer] -> [y : Integer] y <- -x - 1 end neg function xor[x : Integer, y : Integer] -> [z : Integer] z <- (x | y) & self.neg[(x & y)] end xor initially stdout.putstring["(neg) 0 ~> " || (self...
Dear students,
I have made my Emerald language definition for the LaTeX listings package available alongside other Emerald syntax-highlighting offerings.
See https://github.com/emerald/syntax-highlighting/tree/master/envs/listings.
You can use this to include syntax-highlighted Emerald source code in your report.
--
Oleks
Dear IN5570 students,
The agenda for today's exercise session is:
- Feedback on Oblig1
- Help with Oblig2
- Make sure you can run your code on PlanetLab
--
Oleks
Oblig2, exercise 1 - recommended read:
I recommend reading section 7.4.1 of my Ph.D. dissertations.
Eric
Call-by-visit emulation:
X.f[visit b]
emulated by:
home <- locate self
move b to X
X.f[b, home]
And modifying f:
op f[arg: T, home: Node]
...
move arg to home
end f