University of Cincinnati Logo
 

20-CS-228 - Data Structures
Electrical Engineering & Computing Systems

   
Lecture Material and Notes Week
Graphs    
    What are graphs     XX XXX
    A possible C++ graph class     XX XXX
A Graph class in C++     XX XXX
    Shortest Path Problem     XX XXX
Shortest Path Solution in C++     XX XXX
    3 coloring a graph     XX XXX
Solution to 3 coloring a graph in C++     XX XXX
    Biconnected Components of a Graph     XX XXX
Solution to Biconnected Components in C++     XX XXX
Minimum Cost Network problem     XX XXX
Solution to Minimum Cost Network in C++     XX XXX
Solution to Clique problem in C++     XX XXX
 
Trees
    Splay trees XX XXX
Implementation of Splay trees XX XXX
    AVL trees XX XXX
Implementation of AVL trees XX XXX
    Tree rotation operation XX XXX
    Red Black trees XX XXX
    Binary Search Trees XX XXX
Implementation of Binary Search Trees XX XXX
    Heap structure XX XXX
Implementation of Binary Trees XX XXX
    BTree structure XX XXX
Implementation of BTrees XX XXX
    General trees XX XXX
Implementation of General Trees XX XXX
Inverted Trees XX XXX
Implementation of inverted trees XX XXX
 
Basic Data Structures    
Code for implementing Lists     XX XXX
    Fibonacci Heaps     XX XXX
Code for implementing Fibonacci Heaps     XX XXX
Code for implementing Stacks     XX XXX
Queues     XX XXX
Code for implementing Queues     XX XXX
Priority Queue     XX XXX
Code for implementing Priority Queues     XX XXX
 
Problems    
The shortest number of intermediary points from source to destination XX XXX
Matroids XX XXX
Integer Deadline Scheduling - one solution XX XXX
Integer Deadline Scheduling - second solution XX XXX
Sudoku XX XXX
Code to implement a solution Sudoku XX XXX
The Partition problem XX XXX
Code to implement a solution to the Partition problem XX XXX
 
Sorting    
    Quicksort     XX XXX
    Quicksort on array of integers     XX XXX
    Radix sort     XX XXX
    Shell sort XX XXX
    Merge sort XX XXX
    Heap sort XX XXX
    Topological sort XX XXX
    Coding considerations for Topological sort XX XXX
Code for implementing a solution to Topological sort XX XXX
Code for implementing an 'if-free' solution to Topological sort XX XXX
    Impractical sorting algorithms XX XXX
    Code for implementing sorting algorithms above XX XXX
 
Complexity    
Complexity     XX XXX
 

ERC
MainStreet
Paul Erdos
NIT
Ladies on Campus
Oscar Robinson