Algorithms & Data Structures Flashcards

Decks in this Class (11):

• Graphs

  Graphs

  Sample Cards:

  weakly connected,

  greedy algorithm,

  simple path
  56 Cards
  Preview Flashcards
• Complexity

  Complexity

  Sample Cards:

  big o,

  big omega,

  little o
  29 Cards
  Preview Flashcards
• Union Find

  Union Find

  Sample Cards:

  union find,

  union find make set,

  union find find
  6 Cards
  Preview Flashcards
• Tries

  Tries

  Sample Cards:

  trie,

  trie implementation,

  trie remove
  5 Cards
  Preview Flashcards
• Bit Manipulation

  Bit Manipulation

  Sample Cards:

  one s compliment,

  two s compliment,

  bitwise operations
  14 Cards
  Preview Flashcards
• Sorting

  Sorting

  Sample Cards:

  selection sort,

  bubble sort,

  insertion sort pairwise swaps
  12 Cards
  Preview Flashcards
• Binary Search Tree

  Binary Search Tree

  Sample Cards:

  binary search tree,

  bst insert,

  bst find min max
  11 Cards
  Preview Flashcards
• Heaps

  Heaps

  Sample Cards:

  heap,

  binary heap,

  heapify
  9 Cards
  Preview Flashcards
• Hashing

  Hashing

  Sample Cards:

  hash table,

  collissions,

  clustering
  13 Cards
  Preview Flashcards
• Avl Trees

  AVL Trees

  Sample Cards:

  avl trees,

  rotation,

  avl balancing tree
  6 Cards
  Preview Flashcards
• Dynamic Programming Greedy

  Dynamic Programming/Greedy

  Sample Cards:

  dynamic programming,

  subproblem,

  overlapping subproblems
  10 Cards
  Preview Flashcards