This is an advanced course in computer science, studying computational methods of processing big data using various structures and algorithms. This course covers data structures such as sets, maps, heaps, trees, graphs as well as their applications in the construction of efficient algorithms for select, sort, balance, match, etc. Advanced topics such as data compression, dynamic programming, linear programming, and network flow are also discussed. Homework assignments require sufficient skills in Java programming, Git version control, Gradle software project management, and AWS Lambda serverless computing. Prerequisites: CS171.
gaussianprince / cs253 Goto Github PK
View Code? Open in Web Editor NEWThis project forked from emory-courses/dsa-java
CS253: Data Structures and Algorithms