CST 370 Week 6

 

WELCOME TO WEEK 6

Learning Journal - CST 370

This week, we learned a lot of new material. However, the topics I found most interesting and fun to work on in the exercise problems were AVL and 2-3 Trees.

First, we started by learning about two types of balanced binary search trees: AVL Trees and 2-3 Trees. These balanced BSTs make search operations more efficient compared to unbalanced BSTs. For a BST to be classified as an AVL or 2-3 Tree, it must meet certain qualifications.

For example, an AVL Tree must have a balance factor of -1, 0, or 1 for each node. They can become unbalanced when an insertion or deletion occurs. We learned how to rebalance them by applying rotations, including right rotation (R rotation), left rotation (L rotation), left-right rotation (LR rotation), and right-left rotation (RL rotation).

For 2-3 Trees, the qualifications are as follows: each non-leaf node can have 2 or 3 children, each node can have 1 or 2 keys, and all leaves must be at the same level of the tree. Unlike AVL Trees, 2-3 Trees do not use rotations. Instead, they maintain balance through promotion and swapping.

I really enjoyed the material this week!

Comments

Post a Comment

Popular posts from this blog

CST 370 Week 3

Image
  WELCOME TO WEEK 3 Learning Journal - CST 370  This week, we learned a lot. We started with Brute-Force String Matching , an algorithm that aligns the pattern against the first characters of the text and begins to match pairs of characters from left to right. It continues this process until there is either a match or, in the worst case, the pattern is not found in the text at all. The best case occurs when the first characters in the text immediately match the pattern. Next, we learned about Exhaustive Search and its application to three important problems. Exhaustive Search is simply a brute-force approach to combinatorial problems such as permutations, combinations, and subsets of a given set. The first problem we covered was the Traveling Salesman Problem , which involves finding the shortest path through a set of cities (visiting each city exactly once) and returning to the starting city. It is also described as the problem of finding the shortest Hamiltonian cycle. The...
Read more

CST 311 Week 1

Image
  WELCOME TO WEEK 1 Learning Journal This week has been really good so far. I learned a lot of new things that I found very interesting. To begin with, this week's chapter started with an introduction to what the internet is and how it is viewed. It is first described as the "nuts and bolts," where it talks about all the hardware and software that is involved. For example, there are billions of computing devices such as hosts (or end systems) running network applications. Hosts can be a PC, server, laptop, smartphone, etc. In order to carry signals across from one end system to another, there are communication links such as wired or wireless links. There are also intermediate devices called packet switches, which forward packets. There are also protocols that control the sending and receiving of messages sent from one end system to another. Some examples of these protocols are TCP and IP. Protocols are used to define the format and order of the messages that are being sen...
Read more

CST 370 Week 2

Image
  WELCOME TO WEEK 2 Learning Journal - CST 370  This week, I learned about the Analysis of Algorithms . First, we reviewed the topic of time efficiency notations , focusing on three key types: Big O Notation , Big-Theta Notation , and Big-Omega Notation . Big O Notation represents the upper bound, meaning it describes all functions with the same or lower order of growth as f(n). Big-Theta Notation represents the exact bound, meaning it includes all functions with the same order of growth as f(n). Big-Omega Notation represents the lower bound, meaning it captures all functions with the same or higher order of growth as f(n).      We also revisited the orders of growth , which, to be honest, I had forgotten about. Luckily, we reviewed them this week to help us better analyze algorithms and identify their time complexity or order of growth. The eight most common categories we covered were: 1, log n, n, n log n, n², n³, 2ⁿ, and n!. To figure out the order of gro...
Read more