Data Structures and Algorithms Flashcards

Decks in this Class (7):

• Sorting

  Sorting

  Sample Cards:

  what is a bobble sort,

  how would you sort this numbers5 4 3 2 1,

  describe the code for a bubble sort
  12 Cards
  Preview Flashcards
• Arrays

  Arrays

  Sample Cards:

  arrays how fast get sets,

  arrays how fast inserts,

  arrays how fast deletes
  8 Cards
  Preview Flashcards
• Linked List

  Linked List

  Sample Cards:

  what is the 2 killer features of a linke,

  what is the big o number of a linked lis,

  what is the disadvantage of the linked l
  4 Cards
  Preview Flashcards
• Big O Notation

  Big O notation

  Sample Cards:

  big o constant time random access in arr,

  big o linear time delete value linked li,

  what is big o notation
  31 Cards
  Preview Flashcards
• Graphs

  graphs

  Sample Cards:

  three different types of graphps,

  two most common ways to use graph data s,

  edge list b o
  23 Cards
  Preview Flashcards
• Binary Trees

  Binary Trees

  Sample Cards:

  binary tree are both,

  depth three items,

  killer feature
  28 Cards
  Preview Flashcards
• Binary Heaps

  Binary Heaps

  Sample Cards:

  binary heap max always has what at the t,

  what applications use a binary heap max
  2 Cards
  Preview Flashcards