Computing and Information Technology Interactive Digital Educational Library


Syllabus Collection >
Syllabus >

Please use this identifier to cite or link to this item:

Title: Data Structures and Analysis of Algorithms
Authors: WPI Computer Science
Issue Date: 
Publisher: WPI Computer Science
Abstract: next up previous CS 507 Data Structures and Analysis of Algorithms Spring Semester 2000 Wednesday, 6:00 - 9:00 pm, FL 311 Glynis Hamel Office Hours: by appointment FL 139 (508) 831-5252 fax: (508) 831-5776 Course Objectives: * to learn data structures at the introductory graduate level * to learn techniques for the design and analysis of algorithms * to develop a repertoire of algorithms from a number of areas * to become more familiar with a high-level recursive programming language (C++) Text: Shaffer, Clifford A., A Practical Introduction to Data Structures and Algorithm Analysis, (C++ version), Prentice-Hall, 1997 Grading: Homework (50%), midterm and final exam (25% each) Homework: There will be five homework assignments. Homework will consist of both written work and computer programs. Homework is due at the beginning of class on the given due date; it will not be accepted late. Computer programs are to be submitted as non-compiled source code in C++. Programs must be capable of compiling and running using the GNU gcc or g++ compilers; both compilers are available on WPI UNIX computers. Source code should be submitted via email or email attachment using plain text only. Written work may be submitted on paper or faxed to the instructor. Exams: Two exams will be given. Each exam will be one full class period long. You will be allowed to use your textbook and your notes for the exams. Tentative exam dates are March 1 and and April 12. No makeup exams will be given. Web Pages: Check out the CS 507 Web pages at Homework, handouts, and other course material can be found here. Syllabus: The class will cover the following topics in this order: * Intro to Data Structures, C++ review (Chapter 1, Appendix A) * Intro to Algorithm Analysis (Chapters 2, 3) * Linear Data Structures (Chapter 4) * Trees (Chapters 5, 6) * Graphs (Chapter 7) * Internal Sorting (Chapter 8) * Searching (Chapter 10) * Indexing (Chapter 11) * Advanced Topics Dates to note: March 1 : midterm exam April 12 : final exam April 19 : no class April 26 : project presentations (Homework 5) About this document ... This document was generated using the LaTeX2HTML translator Version 98.1p1 release (March 2nd, 1998) Copyright © 1993, 1994, 1995, 1996, 1997, Nikos Drakos, Computer Based Learning Unit, University of Leeds. The command line arguments were: latex2html -split 0 syllabus.tex. The translation was initiated by Glynis Hamel on 2000-01-14 next up previous Glynis Hamel 2000-01-14
Appears in Collections:Syllabus

Files in This Item:

File SizeFormat

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback