quartz/content/notes/cosc-201.md

title: "cosc-201" alias year: 2022 semester: 1 tags: - course - cosc201

Assignments

• notes/assignment-02

Analysis

• aymptotic-notation
• induction
• analysis-of-recursive-algorithms

Paradigms

• divide-and-conquer
  • unite-and-conquer
• dynamic-programming
  • memoization

Data Structues

• union-find
• priority-queue
• dynamic-linear-datatype
  • Stack
  • Queue
• heap
• treap
• hash-map
  • linear-probing
• set
• tree
  • binary-search-tree
  • balancing-binary-search-trees
  • red-black-tree
  • avl-tree
  • bst-operations
  • tree-traversal
• graphs

Algorithms

• mergesort
• heapsort
• [quicksort]

Lectures

• 07-mergesort-1
• 08-mergesort-2
• 09-stacks-queues-heaps
• 10-heaps-and-heapsort
• 11-sets-maps-trees
• 12-binary-search-tree-operations
• 13-bst-traversals-and-balance
• 14-balancing-bsts
• 15-dynamic-programming
• 16-hasing-maps-sets
• 17-collision-resolution-probing
• 18-hash-examples
• 19-graphs
• 20-graphs-2

Archive

• 16-c201-archive