---
title: "cosc-201"
year: 2022
semester: 1
tags: 
- course
- cosc201
---
links: [_index](_index.md)

# Assignments
- [[notes/assignment-01]]
- [[notes/assignment-02]]

# Analysis
- [aymptotic-notation](notes/aymptotic-notation.md)
- [induction](notes/induction.md)
- [analysis-of-recursive-algorithms](notes/analysis-of-recursive-algorithms.md)

# Paradigms
- [divide-and-conquer](notes/divide-and-conquer.md)
	- [unite-and-conquer](notes/unite-and-conquer.md)
- [dynamic-programming](notes/dynamic-programming.md)
- [memoization](notes/memoization.md)

# Data Structues
- [union-find](notes/union-find.md)
- [priority-queue](notes/priority-queue.md)
- [stacks-and-queues](notes/stacks-and-queues.md)
- [heap](notes/heap.md)
- [treap](notes/treap.md)
- [hash-map](notes/hash-map.md)
- [set](notes/set.md)
- [tree](notes/tree.md)
	- [avl-tree](notes/avl-tree.md)
	- [red-black-tree](notes/red-black-tree.md)

# Algorithms
- [mergesort](notes/mergesort.md)
- [heapsort](notes/heapsort.md)
- [[quicksort](notes/quicksort.md)]
- [balancing-binary-search-trees](notes/balancing-binary-search-trees.md)

# Lectures
- [07-mergesort-1](notes/07-mergesort-1.md)
- [08-mergesort-2](notes/08-mergesort-2.md)
- [09-stacks-queues-heaps](notes/09-stacks-queues-heaps.md)
- [10-heaps-and-heapsort](notes/10-heaps-and-heapsort.md)
- [11-sets-maps-trees](notes/11-sets-maps-trees.md)
- [12-binary-search-tree-operations](notes/12-binary-search-tree-operations.md)
- [13-bst-traversals-and-balance](notes/13-bst-traversals-and-balance.md)
- [14-balancing-bsts](notes/14-balancing-bsts.md)
- [15-dynamic-programming](notes/15-dynamic-programming.md)
- [16-hasing-maps-sets](notes/16-hasing-maps-sets.md)
- [17-collision-resolution-probing](notes/17-collision-resolution-probing.md)
- [18-hash-examples](notes/18-hash-examples.md)