Content-Length: 256215 | pFad | http://github.com/DeweiYu/CSC-226

07 GitHub - DeweiYu/CSC-226: network flow #dynamic-programming
Skip to content

DeweiYu/CSC-226

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

35 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CSC226 - Algorithms and Data Structures II

Description

This course emphasis on varierty of importance oif data structure, alogorithnm and technice assiciated with it. There is a lot of abstract and theoratical aspect of mathmatical concepts mostly in java

This Course includes:

  • Advanced design technique, analysis, and implementation of algorithms and data structures
  • Algorithmic design paradigms: greedy, divide-and-conquer, dynamic programming, randomization
  • Advanced Analysis techniques: amortization and expected running time
  • Advanced data structures: random hash families, disjoint sets
  • Advanced graph algorithms: network flow, connectivity, minimum spanning trees, shortest paths
  • Mathematical tools: graphs and digraphs, graph properties, planar graphs, networks
  • String search
  • Data compression

Releases

No releases published

Packages

No packages published

Languages









ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: http://github.com/DeweiYu/CSC-226

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy