CS221, Data Structures

Spring 2008, (3 credits)

Tuesday, Thursday 2:30-3:45pm, PHYS1

_____________________________________________________________________________

INSTRUCTOR: Dr. Cynthia J. Martincic OFFICE HOURS: Mon.&Wed. 10am-12:00pm

OFFICE: 202 Physics Building Tues. & Thurs. 10-11am

PHONE: 724-805-2418 or x2418 And by appointment

EMAIL: cynthia.martincic@email.stvincent.edu and “drop-in”

_____________________________________________________________________________

PREREQUISITES: CS111

COURSE DESCRIPTION: This course continues the objected oriented study of data structures and their associated algorithms begun in CS111. Various implementations of data structures and the efficiency of the implementations of data structures and the efficiency of the associated algorithms are discussed. Topics to be covered include stacks, queues, keyed tables, recursions, linked lists, binary trees, B-trees, and other types of trees, sorting, searching, hash functions, and external sorting. The Standard Template Library and GUI’s in the .NET environment will be introduced and utilized.

LEARNING OBJECTIVES AND ASSESSMENT:

Upon completion of this course the student should:

• Describe some aspects of Software Engineering and how they apply to producing better software.
• Be able to write programs using good programming style and practices.
• Be familiar with a variety of complex data structures in C++, such as linked lists, binary trees, heaps, hash tables, B-trees, and AVL trees.
• Be familiar with a number of algorithms for operating on those data structures.
• Be familiar with the Standard Template Library of Visual C++.
• Have obtained more significant programming practice.

These objectives will be assessed mainly through the use of homework assignments, small projects and exams.

TEXT: C++ Classes and Data Structures. J.S. Childs Pearson/Prentice-Hall ISBN 0-13-514123-0. We will also use Brother David Carlson’s webpages at http://cis.stvincent.edu/swd/index.html. Other texts on the C++ programming language and data structures may be referenced as necessary.

ADDITIONAL READINGS:

Additional readings may be assigned and will be available from the instructor.

GRADING:

Assignments, Projects, In-class work and participation: 50%

Quizzes and Exams: 50%

GRADING SCALE:

The final grading scale may be curved at the discretion of the instructor, but in order to monitor your progress during the term, you should assume the SVC grading scale as printed in the College Bulletin. Curved grades will result in a higher letter grade than that achieved solely by the percentages above. For example, an earned ‘B’ may become a ‘B+’. The curve depends upon the performance of the class as a whole as well as individual class participation and perceived effort.

EXAMS:

There will be three exams, which, in total, will account for fifty percent of the final grade. Exams may cover any topics discussed in class, in the text, in any additional readings and in the assignments. Exams must be taken when scheduled. No books, notes, electronic devices or other assistance (including other people) are to be used during exams. Cell phones, pagers, PDAs, calculators, beeping watches and computers must be turned off during exams. Once an exam has begun, you are not permitted to leave the room until you hand in the exam.