This course will examine basic choices and tradeoffs made in parallel systems, with a strong focus on concurrent programming and parallel algorithm design.

Goals of DBMS, including data independence, relationships, logical and physical organization, schema and subschema; hierarchical, network, and relational modes; examples of implementation of various models; first, second, ...

COM 2545 - Algorithms Sorts (insertion sort, merge sort, heap sort and quicksort); growth of functions and recurrences; hash tables; binary search trees and red-black trees; Huffman codes; graph algorithms including minimum ...