Class Time:          6:30 - 9:00 p.m. Tuesday

 

Class Location:     WVGC Room GC136

 

Instructor:             Wayne Morris          Phone:  767-6357  (work) or 965-6274  (home)

                                                            e-mail:  JWMorris@worldnet.att.net

                                                            FAX (work):  767-6640

 

I.          Purpose and objectives

 

This course is a continuation of IS621 and expands upon the study of the representation of numeric and non-numeric information as information structures used in programming languages.  In this semester, emphasis will be placed on multi-way search trees and graphs and related data structures.  In addition, applicable aspects of discrete mathmatics will be covered.  There will also be some coverage of file structures and operation on them.  The emphasis throughout the course will be on the general data structures, although programming examples will be given primarily in Visual Basic.

 

 

II.         Course requirements and grades

 

Grades for this course will be based on programs, examinations, and homework, weighted as follows:

 

                        Item                                         Points

                        2 Exams                                   100 each

                        2 Programs                               100 each

                        2 Homework Assignments          100 each

 

                                                           Total      600

 

Letter grades will be assigned approximately as follows:

            90 - 100:           A

            80 -  89:            B

            70 -  79:            C

            60 -  69:            D

            Below 60           F

 

III.        Texts

 

            Abstract Data Types – Specifications, Implementations, and Applications

            Nell Dale and Henry M. Walker

            D. C. Heath and Company, 1996

 

            Visual Basic Algorithms

            Rod Stephens

            Wiley Computer Publishing, 1998

 

            Supplemental materials may also be provided for some topics.

 

 

IV.        Tentative course outline

 

Date

Topics

Reading

Assignments

9 Jan

Introduction, Administration, Review of IS621

 

 

16 Jan

Weighted Binary Search Trees and Huffman code

Ch. 8 (pg. 325 to end)

 

23 Jan

Multi-way Search Trees

Ch. 9

HW 1

Program 1

30 Jan

Continuation of Multi-way Search Trees

 

 

6 Feb

Misc. Discrete Mathmatics

None

 

13 Feb

File Types and File Operations

None

HW 1 Due

20 Feb

Review for Exam 1

 

 

27 Feb

Exam 1

 

 

6 Mar

Graphs

Ch. 10

Program 2

13 Mar

Continuation of Graphs

 

HW 2

20 Mar

Spring Break – No Class

 

 

27 Mar

Undirected Graphs

Ch. 11

 

3 Apr

Generalized Lists

Ch. 12

 

10 Apr

Memory Management (if time permits)

Ch. 13

HW 2 Due

17 Apr

Review and Catch-up

 

 

24 Apr

Exam 2

 

 

1 May

Review Exam and Programs

 

 

 

Note:  This schedule is subject to change.