

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Notes; Class: Programming Languages; Subject: Computer Science; University: Longwood University; Term: Fall 2000;
Typology: Study notes
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Instructor: Dr. R. P. Webber Office location and hours: Ruffner 332. MF 2:00 – 3:30, T 1:30 - 3, and by appointment or coincidence. Telephone and email: 395-2192; webberrp@longwood.edu Course description: Topics include language and definition structure, data types and structures, control structures and data flow, run-time characteristics and lexical analysis, and parsing. Programming assignments will involved the use of several different languages. Prerequisite: CMSC 162. Text : Sebesta, Concepts of Programming Languages, Eighth edition. Addison Wesley,
Course objectives : Be able to compare and contrast the major programming paradigms. Construct a parse tree for a statement in a given grammar. Understand the basic concepts in data types, as demonstrated by the ability to explain binding, type checking, scope, primitive data types, user defined data types, and data abstraction. Understand the basic concepts in control, as demonstrated by the ability to explain control structure and subprograms. Be able to write and execute programs in at least two nonimperative programming languages. Tentative class schedule : Week 1 Aug 25 - 29 Ch.1 – 3: Introduction; history; syntax vs. semantics Week 2 Sep 3 - 5 Ch. 3: Grammars Week 3 Sep 8 – 12 Ch. 3: Parsing Week 4 Sep 15 – 19 Ch. 3, 5: Primitive data types Week 5 Sep 22 – 26 Ch 5: Binding; scope
Week 6 Sep 29 – Oct 3 Ch. 6 – 7: Data types; expressions; assignment statements Week 7 Oct 6 – 10 Ch. 7: Review; TEST Fall Break Week 8 Oct 15 – 17 Ch. 8: Control structures Week 9 Oct 20 – 24 Ch 8 – 9: Invariants; subprograms Week 10 Oct 27 – 31 Ch. 10 – 11: Data abstraction Week 11 Nov 3 – 7 Ch. 15 and notes: LISP Week 12 Nov 10 – 14 Ch. 15 and notes: LISP Week 13 Nov 17 - 21 Ch. 16 and notes: Prolog Week 14 Nov 24 Ch 16 and notes: Prolog Thanksgiving Week 15 Dec 1 – 5 Ch. 16 and notes: Prolog; review Thursday, Dec 11 EXAM 8:00 a.m. – 10:30 a.m. Course requirements and grading: Homework and programming assignments …………………………………..60% Midterm test .………………………………………………………………… 20% Final exam …………………………………………………………………… 20% The grade scale is as follows. 90-100 A; 80-90 B; 70-80 C; 60-70 D; below 60 F Assignments and working with others: Assignments will consist of nonprogramming and programming exercises. They will count equally. Each assignment will have a due date. It is due by the start of class on that date. Failure to hand it in on time will result in a penalty of 25% for each class day it is late. No excuses will be accepted for late programs. I’m sorry, but such things as computer failure, sickness, etc., are not excuses! No assignment will be accepted after the last day of the term for any reason. It is OK to work with others on the assignments. Everyone should contribute approximately equally to the work. If somebody tries to freeload, don’t work with him or her, and tell me if the person persists. Furthermore, everyone is to write up his or her own solutions. I don’t want to see duplicate code or solutions. In general, it’s all right to brainstorm about how to do an assignment, but the details of carrying it out are to be done individually. Click here to see the rubric for grading programs. Nonprogramming exercises will be graded on a partial credit basis.