Week 6 - CST 370

 This week we learned about two balanced binary search tree algorithms: AVL tree and 2-3 tree. AVL tree balances via rotations and each node has at most two children while a 2-3 tree has two or three nodes per children and one or two keys per node. We also learned about heaps which are data structures They can be either max heaps or min heaps, where the largest or smallest element is a the root. Children in max heaps less than or equal to their parent node and greater than or equal to their parent node in min heaps. We also learned about hashing, which is an efficient way of finding, adding and removing data. It involves keys, hash function and hash table to store the data using a modular hashing, for example. 

Comments

Post a Comment

Popular posts from this blog

Week 1 - CST 370

 This week we learned how to define graphs, how to calculate the greatest common divisor (GCD) using Euclid's algorithm, and algorithm analysis. Graphs are part of the data structure in computer science, defined by a set of vertices and a set of edges. Algorithm analysis helps determine the efficiency of an algorithm. This will indicate how fast an algorithm rune and the amount of memory is required by the algorithm.  One question I asked in discord was about resubmission for hw assignments that were graded before the due date. I asked if we had to notify the TA or professor when we resubmitted the assignment. 
Read more

Week 1 - CST 438

 When the class was about to begin, I was expecting to learn some new coding concepts and methods using a particular language. I was expecting this to be one of the most difficult classes of the program. Although I am not saying this class is going to be a walk in the park, I am now seeing that Software Engineering is concerned more so with the overall complexities of creating and maintaining code, including how to work together with colleagues, how to plan what needs to be accomplished and the resources needed to reach those goals. I believe we will learn a lot more of the project management aspect of creating and maintaining code that will help us create expectations for our future endeavors. 
Read more

Week 4

I hope to gain a better understanding of how programmers use logic to create software from the ground up. It will be exciting to see what I can create as the I move through the program and hope I will be able to help my peers if needed. My primary goal is to retain the information I learn as it will be crucial to entering the job market. I would also like to further my education beyond my bachelor's degree. This may be in Cyber Security or another area that can transfer into the criminal justice field.  For as long as I can remember, I have had a desire to work in law enforcement in a role that helps investigate crimes. Taking into account my limitations, I knew I had to be realistic of what role I could have investigating crimes. I would like to become a digital forensics analyst where I could have an exciting career with new challenges every day. I hope to work for a federal agency and with task forces that handle major crime investigations.  The ETS computer science sample ...
Read more