Course URL: https://softuni.bg/trainings/1147/data-structures-june-2015

• .NET
• Windows 7
• C#

The course covers the most used data structures in the programming. It gives a deep knowledge about lists, queues, stackes, hashtables, trees, graphs and some algorithms like DFS and BFS. It shows not only how to use libraries, but also how to implement own data structures and to be able to choose the best data structure for a given problem by analyze the algorithm complexity of every operation.

• Data Structures, Algorithms and Complexity
  • Abstract data structures (ATD) and implementations
  • Algorithm complexity
  • The "big o" notation – O(g(x))
  • The "big theta" notation – Θ(g(x))
  • Analyzing algorithms complexity
• Linear Data Structures – Lists
  • Linear data structures – lists, stacks, queues
  • Lists: linked list and array-based implementations
• Linear Data Structures – Stacks and Queues
  • Queues: linked and circular array-based implementations
  • Stacks: linked and array-based implementations
• Trees and Tree-Like Structures
  • Trees and implementations
  • Binary tree traversals: preorder, in-order, post order
• Tree Traversal Algorithms – BFS and DFS
  • Depth-first-search (DFS)
  • Breadth-first search (BFS)
• Dictionaries and Hash Tables
  • Dictionary / map / associative array ADT
  • Hashing and hash functions
  • Hash-tables and collision resolutions
• Collection Data Structures and Libraries
  • Collection data structures: lists, dictionaries, ordered dictionaries, multi-dictionaries, ordered multi-dictionaries, sets, ordered sets, bags, ordered bags
  • Wintellect Power Collections and C5 Collections data structure libraries
• Advanced Tree Structures
  • Priority queue, heap, rope, trie, suffix tree, interval tree, index tree
  • BSP-trees (binary space partitioning)
  • K-d trees (k-dimensional trees)
• Data Structure Efficiency
  • Comparison of data structures and their computational complexity
  • Compare efficiency of arrays, lists, trees, hash-tables, sets, bags, etc.