CMSC 215:  Introduction to FORTRAN




Instructor:  Dr. R. P. Webber


Office location and hours:  East Ruffner 332; MF 2:00 – 3:30, T 1:30 – 3:00, and by appointment or coincidence


Telephone:  395-2192





Course description:  An overview of the FORTRAN programming language, with emphasis on applications to mathematics and science.


Text:  Nyhoff and Leestma:  FORTRAN 90 FOR ENGINEERS AND SCIENTISTS.  Prentice Hall, 1997.


Course objectives:


  1. Master the basic syntax of FORTRAN.
  2. Implement good program design.
  3. Make appropriate use of local and global data.
  4. Understand and use addressing techniques.
  5. Understand FORTRAN’s object oriented design features.


Course requirements and grading:


Two tests, composite quiz grade ……………...…...……..33%




90-100 A; 80-90 B;  70-80 C;  60-70 D;  below 60 F



Assignments:  Unless otherwise specified, assignments are to be done individually.  You may help each other debug work, but each person is to key in his or her own program, and each person must submit each assignment individually.  For programs, hand in


-         a printed copy of the program and output

-         a listing of any input used

-         external documentation as appropriate, including users guide, pseudocode and an account of testing


Non-programming assignments may be done in small groups, depending on the teacher’s instructions. 


Each assignment will have a due date.  It is due by the beginning 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 assignment will be accepted after the scheduled exam period for this course for any reason.


The tests, quizzes, and exams will be taken individually.  The tests and exam are closed book.  In class quizzes will be given frequently.  These will be short, given at the start of class, and are open book.  A missed quiz results in a grade of 0, and missed quizzes cannot be made up, regardless of the reason for the absence.


Tentative Schedule:




Sections and topics





Jan 15 – 18

Chapters 1, 2:  Basic syntax; unformatted I/O


Jan 22 – 25

Chapters 3, 4:  Decisions, looping


Jan 28–Feb 1

Chapter 4,5:  Looping, formatted I/O


Feb 4 – 8

Chapter 5:  External files, review


Feb 11 – 15

TEST; Chapter 6:  Functions


Feb 18 – 22

Chapter 7:  Subroutines, recursion


Feb 25 – 29

Chapter 8:  Arrays


Mar 3 – 7

Chapters 8,9:  Sorting and searching, multidimensional arrays



Spring break


Mar 17 – 21

Chapter 10:  User defined types; classes


Mar 24 – 28

Chapter 10:  Classes; review; TEST


Mar 31 – Apr 4

Chapters 11, 12:  Other data types, file processing


Apr 7 – 11

Chapter 13:  Pointers


Apr 14 – 18

Chapter 13:  Linked lists


Apr 21 – 25

Review and catchup



Final exam



Attendance Policy: Your attendance is expected at all classes.  Makeup tests will be

given reluctantly, and then only upon presentation of a doctor’s excuse.  Makeup tests are

always more difficult than regular tests, regardless of the reason of absences.


Honor Code:  The teacher subscribes to the Longwood College Honor System, which,

among other things, assumes you to not cheat and that you take responsibility to see that

others do not.  Infractions will be dealt with harshly.  A student who is convicted of an

Honor Code offense involving this class will receive a course grade of F, in addition to

penalties imposed by the Honor Board.




 If the program does not compile or does not run, if the program does not follow the instructions in the problem, if the output is incorrect, or if the submitted output did not come from the submitted program, the grade is automatically 0, and I grade no further.

 If it does compile, is the appropriate program, and the output is correct and came from the program, then the following rubric applies.