Syllabus Entrance
Printer Friendly
Email Syllabus

IS 216 COBOL I
Patel, Chandrakant


KC Accelerated - Downtown Fall I 2004

PARK UNIVERSITY

Course Number: IS 216
Course Title: COBOL I
Instructor: C. H.PATEL Work: 816-435-6066
e-mail: chpatel@dstsystems.com
Term Dates: August 23rd thru October 17th
Meeting Time: 5:30 PM to 9:50 PM Tuesday
Site: Park University Downtown

I. COURSE DESCRIPTION:

The student will develop structured, modular

  •    Algorithms. The student will learn the basic features of COBOL. This course will be taught in class through series of lectures and writing application programs in Lab using COBOL syntax.
  •  

    II. GOAL OF THE COURSE:

  • To teach the most useful and widely used programming language in the industries today.
  • LEARNING OBJECTIVES:

  • Students will be able to understand the basic syntax used in coding the application programs in COBOL.
  • IV. TEXTBOOK LIST:

    Following textbook and compiler will be used.

    1. COBOL for the 21st Century 10th Edition
    By Stern-Stern-Ley; ISBN: 0-471-07321-0
    2. Net Express Micro Focus Window Compiler R4.0; ISBN: 0-471-363014

    COURSE REQUIREMENTS:

    To complete the course students are required to write all assigned programs and take quizzes as they are given in the class. The students are required to follow the Park University attendance policy.

    CLASS MEETING AND EXAMINATION SCHEDULE:

    Week 1

    . Introduction to course / Instructor; Syllabus

    . Lecture: Chapter 1 & 2

    . Introduction to Structured Program Design.

    . IDENTIFICATION & ENVIRONMENT DIVISION

    . Introduction to Lab @ Park University

    . Assignment 1 Computer listing of sample program Figure 1.10 Page 23

    Week 2

    . Lecture: Chapter 3 & 4

    . DATA DIVISION

    . PROCEDURE DIVISION

    . Lab:

    . Assignment 2 Problem 2 (Chapter 4) Page 131

     

    Week 3

    . Lecture: Chapter 5

    . DEBUGGING Programs

    . Lab:

    . Assignment 3 Problem 9 (Chapter 5) Page 182

    Week 4

    . Lecture: Chapter 6

    . FORMATTING DATA

    . Lab:

    . Assignment 4 Problem 1 (Chapter 6) Page 254

    Add PAGE:

    Week 5

    . Lecture: Chapter 7

    . COMPUTING DATA

    . Lab:

    . Assignment 5 Problem 2 (Chapter 7) Page 297

    Week 6

    . Lecture: Chapter 8

    . DECISION MAKING

    . Assignment 6 Problem 1 (Chapter 8) Page 336

    Week 7

    . Lecture: Chapter 9

    . LOOP - PERFORM UNTIL

    . Lab:

    . Assignment 7 Problem 3 (Chapter 9) Page 375

    Week 8

    . Final or Additional assignment

    Assignment FINAL Problem 3 (Chapter 8) Page 336

    CLASS POLICIES:

    Academic honesty is required of all members of a learning community. Hence, Park will not tolerate cheating or plagiarism on tests, examinations, papers or other course assignments. Students who engage in such dishonesty may be given failing grades or expelled from Park.

    Plagiarism-the appropriation or imitation of the language or ideas of another person and presenting them as one’s original work-sometimes occurs through carelessness or ignorance. Students who are uncertain about proper documentation of the sources should consult their instructors.

    VIII. GRADING POLICIES:

    A 90-100 %
    B 80-89 %
    C 70-79 %
    D 60-69 %
    F Below 60 %

    Assignments Points

    7 Programs 700
    1 Final 300

    All assignments must be completed and turn in on time for grading on printed form. Assignments may be completed on outside computers or University Lab. computer.

    Programming assignments

    Assignment 1 First Sample program Page 23

    Assignment 2 Problem 2 (Chapter 4) Page 131

    Assignment 3 Problem 9 (Chapter 5) Page 182

    Assignment 4 Problem 1 (Chapter 6) Page 254

    Assignment 5 Problem 2 (Chapter 7) Page 297

    Assignment 6 Problem 1 (Chapter 8) Page 336

    Using C0402.DAT

    Assignment 7 Problem 3 (Chapter 9) Page 375

    Assignment FINAL Problem 3 (Chapter 8) Page 336

    Assignment requirements

    Correct output 50 points

    Programming Std. 30 points

    Comment 10 points

    Input/ output Flowcharts 10 points

     

    IX. ATTENDANCE:

    All classes are mandatory and students are expected to arrive on time and attend the entire class period. Class hours are from 5:30pm to 9:50pm. Non-attendance requires a legitimate reason such as personal illness, death in the family or occupational related requirements. For each unexcused absence there will be one full letter grade deducted. In the event of two consecutive weeks of unexcused absences in a term of enrollment, the student will be administratively withdrawn resulting in a grade of F. Students missing three classes equals one third of the course and a passing grade cannot be justified because the course objectives cannot be attained. Extra credit and/or make-up work will not be substituted for attendance and class participation. In addition, an incomplete grade cannot be granted for lack of attendance and participation.