Typically offered during the spring semester.

Catalog description:

The Structure and syntax of COBOL. Built-in data structures in COBOL. Sequential file processing and direct access file processing; hashing, overflow handling. Implementation of a variety of logical file organization techniques using COBOL file access methods. Standard data processing techniques.

Prerequisite: CSA174 or equivalent

Course Objectives:

• Master COBOL syntax and structure.
• Write COBOL programs in a clear, concise, correct, efficient and well-structured format.
• Understand and use required programming practices vis-a-vis design, coding, and documentation.
• Understand and write programs for the variety of file organizations discussed.
• Understand and write programs for the common COBOL applications discussed.
• Work as part of a team to produce documentation and programs for a small-scale system.

Required Topics (approximate week allocation):

• Introductory topics (1.5)
  • advantages and disadvantages of COBOL
  • local computing environment
  • COBOL program structure
  • COBOL language syntax
  • data names, statement structure
  • overview of elements of a complete program
• Data division (1)
• Fundamental topics to produce a COBOL program (2)
  • procedure division statements
  • basics of structured programming in COBOL
  • use of decision, iteration structures and related statements
• Sequential file processing (2)
  • characteristics and uses of sequential files
  • sorting and merging
  • common applications (control-break subtotals; master file update)
• Software engineering topics (1)
  • program structure
  • module design considerations
  • tools in support of structured programming
  • program testing and debugging
• Simple data structures (1.5)
  • simple arrays
  • various types and applications of tables
  • multi-dimensional tables
• Fundamental string processing (1)
  • processes using INSPECT, STRING, UNSTRING
• Other COBOL file organizations (3)
  • indexed file organizations (ISAM and VSAM) indexing concepts (indexed sequential organization, multiple-level indexing, b-tree indexing)
  • relative file organization hashing techniques for static structures, overflow handling
  • creation, update and use of indexed and relative files
• Linear and non-linear structures (1)
  • linked lists
  • trees
• Exams/Review (1)