CSc 520 — Principles of Programming Languages0 : AdministriviaChristian CollbergDepartment of Computer ScienceUniversity of [email protected] 2008 Christian CollbergJanuary 16, 20081 Contact InformationClass : 520 PRINCIPLES OF PROGRAMMING LANGUAGESLecturer :Christian CollbergEmail : [email protected] : http://www.cs.arizona.edu/∼collbergOffice : 758Office Hours : Open door policyPhone : 621-6612Lectures : 15:00–16:15, MW, GLD-S 701Bo ok : Programming Language Pragmatics. Michael ScottTA : TBA2 Course Outline (Subject to change)• This course will define, analyze and evaluate important concepts found in current programming lan-guages.• Its goals are to build an ability to evaluate and compare programming languages.• We will evaluate and compare languages both from the user’s and implementor’s view.• We will develop precise mechanisms for specifying the semantics of programming languages.3 Course Outline (Subject to change). . .In particular, we will cover the following topics:1. scope of objects and time of binding2. module mechanisms (e.g., blocks, procedures, coroutines)3. data abstraction, datatypes4. control structures15. storage management and runtime support6. operational, denotational, and axiomatic semantic specification; attribute grammars7. applicative and object-oriented languages4 Grading (Subject to change)1. One final exam (50%) .(a) The exam is closed book.(b) Without prior arrangement, missed exam ⇒ grade of zero.(c) Fail the exam ⇒ you will fail the course.2. “Several” homework assignments (50%) . Homeworks may require programming, theoretical work, orpaper presentations.5 Prerequisites, Required Knowledge• Prerequisites: C Sc 453, or equivalent background in Compilers.• You need to be a competent programmer in a procedural/object-oriented language, such as Java or C.6 SyllabusYou are responsible for readingand unders tanding this syllabus.If you have any concerns or issuesabout the information in this documentyou should bring them up during thefirst week of class.7 Required extracurricular activities• Programming assignments.• Homework assignments.• Reading the textbook.• Working programming exercises on your own.8 Special materials required for the class• None.29 Assignment Format• Assignments will be mostly in the form of programming problems.• You may work the assignments on any machine you want, but before you hand them in you shouldtest the code on lectura! I will grade the assignments on lectura, and if they don’t work there, I won’tdebug them for you!• There can be subtle problems with code that’s developed on a Windows machine, for example, whenit is run on a Unix machine. For example, the two systems use different newline characters.Assessment Scheme10 Tests, Quizzes, and AssignmentsThere will be1. one comprehensive final exam, worth a total of 50%;2. assignments, worth a total of 50%.11 Late Assignments• Assignments handed in no more than 24 hours late will incur a 10% penalty.• Assignments handed in more than 24 but no more than 48 hours late will incur a 20% p enalty.• Assignments handed more than 48 hours after the deadline will receive a grade of 0.12 Making up TestsYou cannot make up the midterm or final exam unless1. you have notified the instructor in writing (email is fine) or by phone prior to the test that you will beabsent, and2. you receive permission from the instructor to take the test at a later date.13 Curving• All grades (for exams, quizzes, and assignments) will be curved up by throwing away the highest gradein the class and scaling up such that the second highest grade is 100.• The curving is done to adjust for particularly difficult tests/assignments, and to prevent an outlierfrom skewing the grade distribution.• You cannot, after scaling, receive more than 100 on any exam, quiz, or assignment.314 Grade Assignment• You will fail the class if you get less than 50 (after curving) on the final exam.• Otherwise, a curved total grade of [90,100] gives you an A, [80,89] a B, [70,79] a C, [60,69] a D, and 59and below an E.15 Incomplete work policy• Except under exceptional circumstances I will not assign incomplete grades.• I decide what is an exceptional circumstance.16 Detailed Grading Scheme• To avoid any ambiguities, I have formalized the informal rules given above.• The rules below should be considered minimum requirements to achieve a particular grade. Theinstructor reserves the right to do additional adjustments, as necessary.• Any contradictions, omissions, errors, or ambiguities in the grading scheme will be resolved by theinstructor.• Any issues or concerns regarding the grading scheme should be brought to the attention of the instructorwithin the first week of class.17 Details — Curving• All raw scores range from 0 to 100.• Each individual score (final, midterm, quizzes, assignments) will be curved using the functioncurve(x, s) = min(100, (100.0/ max(x − max(x)))xs)where x is a set of scores (for an assignment, a test, etc.) and s is a student.• Note: − is set subtraction.• curve(x, s) returns s’s score, curved up by 100.0/2nd highest class score.18 Details — Curving. . .• For example, assume the following final exam scores:34 45 66 88 98After the curve has been applied, the scores will be38.6 51.1 75 100 100419 Details — Examsfinal exam:• Let f be the set of final exam scores.• Let fsbe the final exam score for student s.• Let Wfbe the weight of the final exam (50%).• tsf= curve(f, s)Wfis the curved final score for s.20 Details — Assignments• Let aibe the set of scores for the i:th assignment.• Let asibe the score for student s on the i:th assignment.• Let Waibe the weight of the i:th assignment (PiWai= 50%).• Let αsibe the assignment score after late penalties have been applied:αsi=asiif the assignment is handed in on time0.9asiif the assignment is > 0 and ≤ 24 hours late0.8asiif the assignment is > 24 and ≤ 48 hours late0 if the assignment is > 48 hours late21 Details — Assignments. . .• tsa=Pi(curve(αi, s)Wai) is the total curved assignment score for student s.• If, for whatever reason, the actual number of assignments is less than the planned number, the Wai’swill be scaled up uniformly.22 Details — Total Scores• The raw total score for student s ists= tsf+ tsa• We round up to the nearest integer:totals= dtse23 Details — Grade
View Full Document
Unlocking...