Information Systems Program
IS 622 – Information Structures II
Spring 2002
Class
Time:
Class
Location:
Instructor: Cynthia Bode Work Phone: 347-7748 M-F
Work Fax: 347-7716
Email: cbode@citynet.net
I. Purpose and Objectives
This course is a continued study of the structures used for information storage in computers. In this course, we will study a variety of data structure and their implementations. Some discrete mathematical principles on which these storage structures are based will also be studied. We will finish the course by discussing file structure design, file organization, and file access concepts.
II. Course Requirements and Grades
Grades for this course will be weighted as follows:
Item Percentage Grading Scale
2 Exams 70 A 90-100
Assignments 30 B 80-89
(homework and programming) C 70-79
All assignments and exams are required parts of this course and must be satisfactorily completed to pass this course. Late or make up exams will not be given, except upon prior arrangement with the instructor. Assignments and programs handed in after the due date will be penalized 10% each day it is overdue. Assignments handed in after the solution to the assignment is given will not receive any grade.
All exams will be open
book and open notes, no other resources are acceptable to include other
textbooks, online libraries, or any other Internet accessible information. The test will be administered during class
with a 2 ˝ - hour time limit. Exams will
be handed out beginning at
Programming assignments can be done in any language in which data structures can be implemented, such as C, Pascal, etc. All programs will be turned in on a 3 ˝” diskette with both the source code and executable module (where applicable). A printed listing of all program output must accompany the diskette. Individual assistance with programming assignments can be obtained from the graduate assistant(s) and/or Information Systems staff from MUGC.
III. Textbook
Data Structures, Algorithms, and Applications in JAVA – Sahni
All students need to have a copy of the text. Students will be required to
read the appropriate chapters in the text prior to the class in which they are covered.
IV. Student Expectations
You are expected to abide by the honor code at all times. During in-class exams and on all programs and assignments, no collaboration with members of the class or outside will be tolerated, unless otherwise stated by the instructor. All assignments are individual effort.
Students are expected to arrive in class on or before time and to participate in class discussions. Students should attend all classes excluding emergencies. Students who miss a class will be responsible for obtaining information about the material presented in that class from another student or, when possible, from the instructor.
V. Tentative Course Outline
Date Reading Topic
01-16 Introduction, Searching Algorithms
01-23 Sorting Techniques and Algorithms
01-30 Chapter 12 Trees, Binary Trees
02-06 Chapter 13 Priority Queues, Heaps, Huffman Code
02-13 Chapter 14 Tournament Trees
02-20 Chapter 15 Binary Search Trees
02-27 Chapter 16 Balanced Binary Search Trees
03-06 Balanced Binary Search Trees –continued
03-13 Mid-term Exam
03-20 Graphs – mathematical concepts
03-27 Chapter 17 Graphs – data structure
04-03 *** Spring Break – No Class ***
04-10 Intro to File Structure Design
04-17 File Organization, File Access
04-24 File Organization, File Access - continued
05-01 Review and Catch up
05-08 Final Exam
NOTE: This schedule is subject to change