CSIS_2617_Lazar: Data Structures and Objects
  Syllabus

Course Information

Course Title:

Data Structures and Objects

Course Number:

CSIS 2617

Course Discipline:

Software and Programming

Course Description:

Advanced computer programming design, implementation and testing, with a primary focus on data structures and abstraction.

Course Dates:

Jan 12, 2004 through May 9, 2004 Spring 2004

Credit Hours: 

4 hours (3 hours lecture and 2 hours lab)

Prerequisite(s):

CSIS 2610 (CSIS 610) with a grade of C or better.

Section Number:

0621

Classroom Location:

338, 304 Meshel Hall

Meeting day(s) 

and Hours:

12:00-14:10, Tuesday and Thursday, Lecture and Lab, 304 Meshel Hall

Department Location: 

339B, Meshel Hall

Web Page: 

WebCT

Instructor Information

Name:

Dr Alina Lazar

Office Location:

322 Meshel Hall

Office Phone Number:

941-2981

Office Hours:

Tuesday, Thursday: 10:45-12:00 and 14:15-15:00 and by appointment

E-mail Address:

alazar@cis.ysu.edu

Department Phone Number:

941-3134

Textbooks & Course Materials

Required Reading:

Data Structures - A Pseudocode Approach with C++, R. F. Gilberg & B. A. Forouzan, Brooks/Cole Thompson Learning, 2001, 0-534-95216-X

Recommended Reading:

Data Structures with C++ Using STL, second edition, W. Ford & W. Toop, Prentice Hall, 2002, 0-13-085850-1

Any additional C++ Data Structures text.

Required Software:

· Although programming assignments may be developed on any C++ platform, the submitted code must conform to the current (1998) C++ ANSI Standard.

· A browser supported by WebCT: Netscape Communicator (version 3.0 or higher) or Microsoft Internet Explorer (version 4.0 or higher).

Recommended Software:

A C++ software with an integrated environment that provides an effective interactive debugger.

Course Description/Objectives

Catalog Description:

Program design, style and expression, testing and debugging for larger programs. Introductory concepts of object-oriented programming, including classes, methods, encapsulation, and abstract data types. Theory and application of data structures, including linked structures, trees, networks, and graphs. Three hours lecture and two hours lab.

Course Objectives:

1) To continue developing a disciplined approach to the specification, design, coding and testing of programs written in a block-structured, high-level language.

2) To tech the use of data abstraction, using as examples the data structures string, vector, list, stack, queue and binary search tree.

3) To provide a complete understanding of different implementations of these data structures, and to understand the importance of separating the specification of a data structure from its particular implementation.

Course Calendar/Schedule

Readings:

Reading assignments in the Gilbert text will cover chapters 1-7, 11, and 12 but not necessarily in that order. The reading assignment in preparation for the January 15th lecture is Chapter 1, Sections 1, 2 and 4 in the text. Other specific readings and their timing will be assigned as the course progresses.

Assignments:

You will be given 15 homework assignments. These assignments will be mostly programming problems (such as writing some functions with a test driver). These assignments are to be submitted on WebCT, along with a hard-copy printout of the source code, and are due Thursdays at the beginning of the lecture (lab) indicated in the syllabus.

Exam Dates:

Exam 1 - 02/19, Exam 2 - 03/30, 

Final Exam - 

0621 - 05/04 Tuesday 13:00 - 15:00

Course Policies

Attendance:

Attendance and participation in class is very important. In addition to the normal lecture material, information will be given regarding assignments, due dates, explanation and clarification of assignments, and material that is not covered in the assigned text. If you miss a class for any reason, it is your responsibility to become familiar with the material covered. It is also your responsibility to check the course website on a regular basis. Expect to spend about 12 hours per week outside of the classroom lecture and lab period on reading assignments, homework problems, and programming projects. All students should keep the instructor informed about their difficulties with the course.

Missed Exam:

There is no make-up for midterm exams. Missing an exam will greatly affect your grade since they carry a lot of weight. In case of illness or abnormal circumstances, please consult with the instructor in advance if possible to make alternate arrangements. You must formally inform the instructor in writing and present proper supporting documents within a week from the midterm. All students are required to write and pass the final exam in order to pass the course.

Missed Assignments:

An assignment is late if it is not submitted at the beginning of class on the due date. Late assignments ARE NOT ACCEPTED. You must allocate enough time to complete the assignment on time. 

Lab Rules:

You are not allowed to eat or drink in the lab.

Academic Honesty:

You are required to do your own work on all homework. There are no group assignments, and since these assignments count toward your grade, the work must be yours. If you need help with an assignment, your primary source of help should be the instructor. You are, however, permitted to discuss an assignment with others, but are not allowed to share source code, pseudocode, or design charts in any way, shape or form. Identical assignments will get zero grades and will result in failure of the course.

Grading:

Grading will be based on the weighted average scores as follows:

          Lab & Programming assignments (15):   30%  

          Mid-Term Examination (2):                   40%

          Final Examination (comprehensive):       30%

Each exam is closed books and notes.

Letter grades will be based on the weighted average score according to the following:

Weighted Average	Letter Grade
90% -100%	A
80% - 89%	B
70% - 79%	C
60% - 69%	D
< 59%	F

Others

Changes in the Syllabus:

Instructor reserves the right to change syllabus, dates, test dates and procedures, class procedures, etc., as necessary.

Disability Services:

In accordance with University procedure, if you have a documented disability and require accommodations to obtain equal access in this course, please contact me privately to discuss your specific needs. You must be registered with the Disability Services Office in Beeghly Hall, Room 3310 and provide a letter of accommodations to verify your eligibility. You can reach the Office of Disability Services at 330-941-1372.

Center for Student Progress

The Center for Student Progress is a resource on Campus established to help students successfully complete their university experience. Please phone (313)941-3538 or visit the Center for help “working the system for tutoring, or for individualized assistance with academic and social concerns. It is located in Kilcawley West under the bookstore.

Week	Week  beginning	Topics	Readings	Comments
1	01/12	Introduction to Algorithms and Pseudocode,  Testing and Debugging	Chapter 1; Sections 1.1, 1.2, 1.4
2	01/19	Introduction Abstract Data Types,  Arrays and Matrices	Chapter 1; Sections 1.2, 1.3, 1.5	University Closed  - Martin Luther King Jr.   Day 01/19
3	01/26	Searching	Chapter 2; Sections 2.1- 2.5.
4	02/02	Introduction to Classes and User  Defined ADT's
5	02/09	Classes and Pointers
6	02/16	Lists	Chapter 3; Sections 3.1- 3.5.	Exam 1 - 02/19
7	02/23	Lists	Chapter 3; Sections 3.6- 3.8.
8	03/01	Stacks	Chapter 4; Sections 4.1- 4.3, 4.5, 4.6.	03/08-15 Spring Break
9	03/15	Queues	Chapter 5; Sections 5.1- 5.4, 5.5- 5.7.
10	03/22	Recursion	Chapter 6; Sections 6.1- 6.7.	Exam 2 – 03/26
11	03/29	Introduction to Trees	Chapter 7; Sections 7.1- 7.5.
12	04/05	Sorting	Chapter 11; Sections 11.1- 11.3.
13	04/12	Sorting	Chapter 11; Sections 11.4.
14	04/19	Graphs	Chapter 12; Sections 12.1- 12.6.
15	04/26	Review
16	05/03	Final Exam