C311 Syllabus
Programming Languages   

powered by FreeFind

Modified: 


Class Schedule
Date Reading and Notes Tests

Exercises
Due

Homework
Due
Aug
26
Chapter 1 & Chapter 5 - ML (MetaLanguage) A First Look      
28     1 Answers  
Sep
2
Chapter 7 - ML Programming Patterns     1
4     2 Answers  
9 Chapter 6 - Types     2 Answers
11 Chapter 9 - ML Functionals   3 Answers  
16 Chapter 8 - Polymorphism       
18        
23 Chapter 11 - ML Data Constructors   4 Answers 3
25 Pseudocode Interpreters   4a Answers  
30 Chapter 2 - Syntax/Parsing   5 Answers 4
Oct
2
Test 1 Chapters 1, 5-9, 11
1
   
7 XML     5
9 Chapter 3 - Semantics   8 Answers  
14 Chapter 23 - Formal Semantics   9 Answers 9
16     10 Answers  
21 Chapter 4 - Language Systems   11 Answers  
23 Chapters 2, 3, 4, 23, XML, Pseudocode Interpreters and Notes 3 In LF 111 10 
28 Chapter 12 - Activation Records      
30 John Backus      
Nov
4
Chapter 13 - Java   6a Answers  
6 Objects

 

   
11 Chapter 15 - Java without Multiple Inheritance and Generics
Chapter 16 - Object Orientation
Chapter 17 - Third Look at Java
Exceptions
  12 Answers 6
13 Threads   7 Answers  
18 Chapter 10 - Scope   6 Answers 8
20 Chapter 18 - Parameters      
Dec
2
Chapter 14 - Memory Management     7
4 Components - JavaBeans
Networking
Last Class
  13 Answers
 
4 Last chance for late Homework - Turn in at office LF122 by 9:20P      
11 7-8:50P
Chapters 10, 12-18, Threads and Notes

2

  11
 
Frequently Asked Questions 
Instructor: Raymond F. Wisman
Office: LF122
TR 4:30-5:30P and by appointment
Class:             PS110 TR 7:30-9:20P
Phone: 941-2465
Email:
Web: www.ius.edu/rwisman
Text: Modern Programming Languages by Adam Webber
Course: C311 Programming Languages (4 cr.) P: C202 and C335. Systematic approach to programming languages. Relationships among languages, properties and features of languages, and the computer environment necessary to use languages. Lecture and laboratory.
Software:        ML and Java
Goals: See C311 Course Goals
Grade Scale:

 
Grade Book

A+ 97% - 100%    A  93% - 96%        A-  90% - 92%
B+ 87% -  89%     B  83% - 86%        B-  80% - 82%
C+ 77% -  79%     C  73% - 76%        C-  70% - 72%
D+ 67% -  69%     D  63% - 66%        D-  60% - 62%
F      0% -  59%
Course          
Evaluation:   
Homework 40%
Exercises 5% No late credit
3 Exams 55%
Ethics: All work is subject to the Indiana University Code of Student Ethics.

Learning requires a partnership between the instructor, authors, researchers and students; therefore students are encouraged to use any and all resources available to solve homework problems and complete programming assignments. However, students must:

  1. clearly cite any contributing source; a text, another student, the Internet, etc.
  2. create their own solutions

For example, students may work in groups to solve homework problems provided each student creates their own (not copies) solutions  and clearly lists all group members or other sources such as authors of texts or on the Internet. Likewise, software that performs assigned functionality may not be directly used but the source code may be consulted provided it is subsequently cited. Changing the spelling of algorithm identifiers does not constitute creating an original solution. It is absolutely essential to note that failure to cite any contributing source will be considered cheating regardless of the reason for the omission. Likewise, verbatim duplication of any source, whether from another student, a text, etc. will always be considered plagiarism.

Violation of any aspect of this policy will result in a failing grade for the course.