CIS 350                                   SYLLABUS                            2002 summer

 

Professor:  Dr. Fred Thulin      http://pluto.ksi.edu/~fthulin

Office:  Dean's Office                Hours:  5:00-6:00 M, T, W, F & by appt.

Phone:  847.679.3135              Fax:  847.679.3166      email:  fthulin@ksi.edu

Online course materials:            http://www.cs.pitt.edu/~chang/growbook.htm

Supplementary materials:           http://hissa.nist.gov/dads/

 

Text:  Gaddis, T.  Starting Out with C++, 3rd ed., Scott/Jones Inc., El Granada CA, 2001.  ISBN 1-57676-031-6.

 

Course requirements:  There will be 5 quizzes during the term, a comprehensive final examination and 3 programming projects.  There will be no makeup exams or quizzes.  These requirements will count approximately as follows toward the course grade:

 

quizzes:                         33%

programs:                     33%

final examination:           34%

 

Grade cutoff points are A: 90%, B: 80%, C: 65%, D: 50%.

 

Academic Integrity:  It is expected that each student submit only his or her own work for credit in the course.  A violation may result in splitting a score, expulsion or a grade of F for all parties involved.  See the handout Knowledge Systems Institute Policy on Academic Dishonesty.  Team members are to cooperate only with members of their own team.

 

Program submission:  Programs are to be executable on an IBM PC or clone, such as are available in the computing labs, and compiled using Turbo or Visual C++.  A diskette containing the source program and executable file is to be submitted for each program.  The student should keep a backup copy of each program.

 

Schedule:  Note:  A quiz may include any material covered before the day of the quiz.

 

May 13:     Chapters 9, 11, 13                         Review of pointers, structs and classes

May 20:     Quiz 1, Chapter 17                         Linked Lists

June 3:        Chapter 18                                     Stack ADT and Implementations

June 10:      Quiz 2, Chapter 18                         Queue ADT and Implementations

June 17:      Chapter 19, Project 1 due              Recursion

June 24:      Quiz 3, Chapter 8                           Searching, Elementary Sorting Algorithms

July 1:         Chapter 19                                     Quicksort, Mergesort, Heapsort

July 8:         Quiz 4, Chapter 20                         Binary Search Trees

July 15:       Chapter 20, Project 2 due              Binary Search Trees

July 22:       Quiz 5                                            Hashing

July 29:       Review, Project 3 due                                                 

Aug 5:        Final Examination