CS521

Home Announcements Program Course Catalog Minor Resources Faculty Contact Us FAQ

Plus/Minus Grading Important Dates

Distance Learning Getting Connected Program Requirements

Hagerty Library Bursar's Office Drexel One College of Engineering Course Evaluations

Course Descriptions

Data Structures and Algorithms I

Techniques for analyzing algorithms: asymptotic notation, recurrences, and correctness of algorithms; divide and conquer: quick sort, merger sort, median and order statistics; elementary data structures: hashing, binary heaps, binary search trees, balanced search trees; graph algorithms: Depth and Breadth first searches, connected components, minimum spanning trees, shortest paths in graphs.

Contact CS | Submit Feedback | Page Corrections

Drexel University Home page, Contents, Index, Directories and search, Contact information, Admission.

Engineering Management Program

3141 Chestnut Street, Philadelphia, PA 19104 | Phone: 215-895-2354 | Fax: 215-895-5811 | coeonl@drexel.edu

This page was last updated on: Thursday, July 30, 2009 10:01 AM.