LE/EECS 2101 (3.00)

Fundamentals of Data Structures

Description

The course discusses the fundamental data structures commonly used in the design of algorithms. Abstract operations on data structures are specified using pre- and post-conditions and/or system invariants. Trade-offs between a number of different implementations of each abstract data types (ADT) are analyzed. Each algorithm operating on data structures is proved correct using loop invariants or induction. Both formal and informal proofs are introduced, but most of the reasoning is done informally. Data structures are coded and unit tested in an object oriented language. Selecting the appropriate ADT and a suitable implementation depending on the application is covered. Prerequisites: Cumulative GPA of 4.50 or better over all major EECS courses (without second digit "5"); LE/EECS1019 3.00 or LE/EECS1028 3.00 or SC/MATH1019 3.00 or SC/MATH1028 3.00; LE/EECS1030 3.00 or LE/EECS2030 3.00. Course Credit Exclusion and previously offered as: LE/EECS 2011 3.00 and LE/DIGT 2102 8.00.

Tips: you can drag and drop the boxes to clone them to different sections or groups within a prerequisite equation.

Thank you for your edit suggestion!
Our staff will review and approve it soon.
You can close this page now.

There might have been an error with the server or your input. Please check your entry and/or try again later.