Exam (elaborations)
COP 3530 EXAM 1 QUESTIONS AND ANSWER 2024
- Course
- Institution
COP 3530 EXAM 1 QUESTIONS AND ANSWER 2024
[Show more]
Content preview
COP 3530 EXAM 1B-Tree Properties - ANSWERS-1. Each node is a block containing multiple keys
2. B-trees are n-ary with bst sorting property
3. Tree building is bottom-up
4. Order "n" tree has at most n children
5. Leaves are always at same depth
6. Non-leaf nodes can store up to n-1 keys
B+ tree properties - ANSWERS-Like B-tree, but all data is stored in leaves & all
leaves are linked
B+ tree use cases - ANSWERS-Hard drives, databases, file systems
Splay Tree - ANSWERS-a self-balancing binary tree that places recently accessed
elements near the top of the tree for fast access
Red-Black tree properties - ANSWERS-1. Every node is either red or black
2. The root is black
3. A red node can't have red children
4. All paths from root to leaves contain the same # of black nodes
, AVL tree insertion algorithm - ANSWERS-Find deepest node that breaks balance
factor rule
Start rotating & move up
B-tree insertion algorithm - ANSWERS-Add key like in binary tree
If this causes node to have > l keys:
Split node, middle key moves up, other keys become stand-alone nodes
Repeat if necessary
Binary Heap Properties - ANSWERS-1. Complete binary tree
2. Each node is less than its children for min-heap, greater than children for max-
heap
3. Root is either smallest or largest element
4. Only root can be extracted
Binary Heap array representation - ANSWERS-For a node at position p,
p.leftChild = 2p + 1
p.rightChild = 2p + 2
p.parent = floor((p - 1)/2)
Binary Heap Insertion Algorithm (Heapify up/down) - ANSWERS-1. Insert new
item in next position at bottom of heap (furthest left empty spot b/c complete
tree)
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Teacher101. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $17.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
79373 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now
