Suggest an Edit for LE/EECS 4101 (3.00)

LE/EECS 4101 (3.00)

Advanced Data Structures

Description

Amortized and worst-case analysis of data structures. Data structuring paradigms: self-adjustment and persistence. Lists: self-adjustment with the move-to-front heuristic. Search trees: splay trees, finger search trees. Heaps: skew heaps, Fibonacci heaps. Union-find trees. Link-and-cut trees. Multidimensional data structures and dynamization. Integrated with: GS/CSE 5101 3.00. Prerequisites: cumulative GPA of 4.50 or better over all major EECS courses (without second digit "5"); LE/EECS 2030 3.00 or LE/EECS 1030 3.00; LE/EECS 2001 3.00, LE/EECS 3101 3.00. Previously offered as: LE/CSE 4101 3.00. PRIOR TO SUMMER 2013: SC/CSE 4101 3.00.

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

Prerequisite Equation

Edit the prerequisite equation to this course:
note: adding data in this section will override data in the Prerequisite List.

+ add prereq equation

Prerequisite List (Overridden by Prerequisite Equation)

Edit the list of prerequisites to this course:
note: data in this section will be override by the Prerequisite Equation if it exists.

+ add new course

Exclusion List

Edit the list of course cerdit exclusions to this course:

+ add new course

Your name (optional):

Any additional comment (optional):

CourseDelta for Yorku

Suggest an Edit for LE/EECS 4101 (3.00)