data structure

Slide 1 Operating Systems Hubertus Franke .edu CSCI-GA.2250-001 Process/Thread Scheduling Scheduling • Whether scheduling is based on processes or threads depends on whether the OS is multi-threading capable. • In this deck/lab2 we use process as the assumption, just be aware that it applies to threads in a multi-threading capable OS. • Given a group

COMP2521 Data Structures & Algorithms Week 7.4 Shortest Path   1 In this lecture Why? Finding the shortest path through a graph is one of the most common use cases What? Shortest Path Edge Relaxation Dijkstra’s Algorithm 2 Shortest Path We’re going to search for the shortest path between two vertices on a weighted graph

COMP2521 Data Structures & Algorithms Week 8.3 Merge Sort   1 In this lecture Why? We need some algorithms better than O(n^2) for large data sets. What? Merge sort 2 Mergesort Overview The key of this approach is that it’s recursive. 1. Split the array into two roughly equal sized partitions 2. Recursively sort each

COMP2521 Data Structures & Algorithms Week 5.1 Graph ADT 1 In this lecture Why? Graphs are one of the most general and fundamental data types in software, so let’s understand it from an abstract point of view What? 2-3-4 Trees Data Structure Insertion Pseudocode   2 Graph A graph G = (V, E) is a

COMP2521 Data Structures & Algorithms Week 3.2 Balancing Binary Search Trees 1 In this lecture Why? Binary Search Trees will often slowly lead to more imbalanced trees, so we need to develop strategies to prevent that. What? Tree Rotations Insertions at root Tree partitioning   2 BST balance as it grows When you insert into