EEN511 (Software Engineering) Spring 2008, Tue Thur 6:25-7:40

• Official Syllabus.
• Downloads: none yet.
• The Book: ???
• Examinations:
  • Mid-Term Examination: 18th March.
  • Final Examination: Due 10th May, Here it is: pdf and word.
  • Assignments:
    1. Solve shortest path problem efficiently using a heap.
  • Class History:
    • Class 1 (15-1-2008)
    • Class 2 (17-1-2008)
    • Class 3 (22-1-2008)
    • Class 4 (24-1-2008) (alleged in-place mergesort).
    • Class 5 (29-1-2008) Heaps as priority queues, making shortest path efficient.
    • Class 6 (31-1-2008) No class today.
    • Class 7 (5-2-2008)
    • Class 8 (7-2-2008)
    • Class 9 (12-2-2008) Here are the long-awaited data files. "places2.txt", the cities file, "roads2.txt", the roads file, and a detailed explanation of them both.
    • Class 10 (14-2-2008) infinity symbol
    • Class 11 (19-2-2008)
    • Class 12 (21-2-2008) Uncomputable numbers, Insoluble problems, Turing's thesis, the halting problem. Here is the cleaned up Enumerators program.
    • Class 13 (26-2-2008) Intruduction to 2-3-trees. The roads file has been scaled by a factor of 100, and no zeros.
    • Class 14 (28-2-2008)
    • Class 15 (4-3-2008)
    • Class 16 (6-3-2008) Written notes as promised:
      Infinite Numbers and Uncomputable Functions,
    • Spring Break 8-3-2008 to 16-3-2008)
    • Class 17 (18-3-2008) Mid-term.
    • Class 18 (20-3-2008)
    • Class 19 (25-3-2008)
    • Class 20 (27-3-2008)
    • Class 21 (1-4-2008)
    • Class 22 (3-4-2008)
    • Class 23 (8-4-2008)
    • Class 24 (10-4-2008)
    • Class 25 (15-4-2008)
    • Class 26 (17-4-2008) babylisp, stackylisp, goodlisp, defs.
    • Class 27 (22-4-2008)
    • Class 28 (24-4-2008)