Unordered Data Structures
University of Illinois Urbana-Champaign
The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. These fundamental data structures are useful for unordered data. For example, a hash table provides immediate access to data indexed by an arbitrary key value, that could be a number (such as a memory address for cached memory), a URL (such as for a web cache) or a dictionary. Graphs are used to represent relationships between items, and this course covers sev
About this Course
The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. These fundamental data structures are useful for unordered data. For example, a hash table provides immediate access to data indexed by an arbitrary key value, that could be a number (such as a memory address for cached memory), a URL (such as for a web cache) or a dictionary. Graphs are used to represent relationships between items, and this course covers sev
What You'll Learn
- تنفيذ جدول هاش واختيار استراتيجية تصادم مناسبة
- استخدام المجموعات المنفصلة لحل مشكلات الترابط
- نمذجة العلاقات برسوم بيانية وتطبيق خوارزميات الاستكشاف
Instructors
Wade Fagen-Ulmschneider
Computer Science