JOLIET JUNIOR COLLEGE
DEPARTMENT OF COMPUTER INFORMATION
AND OFFICE SYSTEMS
COURSE SYLLABUS
Course Prefix and Number CIS 227
Course Title Advanced Pascal with Data Structure
Curriculum Computer Information Systems
Lecture 4
Lab 0
Credit Hours 4
Prerequisites CIS 136 or equivalent
Catalog
Description
A study of Data
Structures using the Pascal Language.
Topics include static data structures, linked lists, stacks, queues, and
trees. External and data structures
will be examined including B-trees, B+-Trees, hashing and Indexing techniques.
Course
Objectives: See attached
Prepared by: Reviewed
by:
Patricia Sterr Ram
Raghuraman
Dept. of CIOS Updated 12/00 Department Chairperson Date
Revised 7/97
Revised 12/93
Revised 2/92
Revised 11/91
STUDENT
MATERIALS
A. Textbooks:
Title: Data Structures and Problem Solving with Turbo
Pascal
Author: Carrons, Helman, Veroff
Publisher: Addison-Wesley
B. Other
Required Materials
Other Course Requirements
Course objectives will be met using
lecture methods combined with demonstrations and Pascal programming assignments. Several programs of increasing difficulty
must be planned, coded, debugged,
test and documented.
Student Evaluation (Type of Grading)
Grading is to be based on a
meaningful combination of examinations, and the successful and timely completion
of programming assignments, complete with all relevant documentation.
Teaching Aids or
Week/Days Topic or Class Activity Special Instruction
1 Review of
Structured Programming with Pascal
2 Continue review of
Pascal
3 The record structure
in Pascal
4 Arrays and Arrays
of Records
5 Linked Lists;
Creating, deleting, adding nodes
6 Introduction to
Recursion
7 Using Recursion as
a Problem Solving Tool
8 Abstract Data
Types
Sequential
implementation of ADT Stack
Linked
Implementation of ADT Stack
9 Stacks
Solving
algebraic expressions
Graph search
problems
Stacks and
recursion
The
traversable stack
Doubly
linked lists
10 Queues
11 Introduction
to Trees
12 Management
of Binary Trees
13 Advanced
Applications of Trees
Balanced
search trees
2-3 trees
Hashing
14 External
Data Structures
Sorting in
an external file
Searching
external tables
Indexing; B-trees
15 External
Data Structures
Traversals
Multiple
indexes
B+-trees
16 Final
Exam
OBJECTIVES
1. The
student will understand the development of the Data Structures using the Pascal
programming
language.
2. The
student will be able to analyze problems in order to identify alternative
solutions and select the solution demonstrating the
greatest degree of efficiency and usability.
3. The
student will be able to use various structured techniques to provide a high
level Pascal solution
to a problem requiring the use of appropriate data structures.
4. The
student will demonstrate the use of recursion, arrays, linked lists, stacks,
queues, trees, and
external data structures including B-trees, B+-Trees, hashing and indexing.