CPSC 221 Cram Pack

Hi there! These are my notes from when I took the course CPSC 221 at the University of British Columbia in WT2 2022 with Professor Steve Wolfman. This particular document has 3-5 pages. Below is a list of the topics covered:

• Big Oh Notation
• Selection, Insertion, Merge Sort
• Linked List
• Stack
• Queue
• Tree, Traversal
• Dictionary
• BST, AVL
• BTree
• Hash Table
• Priority Queue
• Heap
• Disjoint Set
• Graph
• Kruskal’s, Prim’s, & Dijkstra’s Algorithms

Here’s a quick legend for what I’ve named my products:

• Cram Pack: contains the notes I take from the professor’s slides, class tutorials, and some available readings. summarized and broken down to include the most relevant examples and definitions. helps me avoid scrolling through 100+ lecture slides just to find the one concept or definition i’m looking for.
• Study Sheet: a 1-2 page document that further condenses the notes from the cram pack^ that I make for that course. typically contains important formulas and definitions that I would have trouble memorizing. great for last minute reviews before an exam!

disclaimer: With these products, I adapt the content from course resources (prof’s slides, textbook readings, etc.) and place it into my own formatted notes — I do not own the content! These are just the notes that I took down from when I took the course previously and I want to be able to share them with you to aid with your assignments & exams!

good luck & godspeed ⚡