Search Results

CS 457 Data Structures and Algorithms I 4.0 Credits

This course covers techniques for analyzing algorithms, including: asymptotic analysis, recurrence relations, and probabilistic analysis; data structures such as hash tables and binary trees; algorithm design techniques such as dynamic programming, greedy methods, and divide & conquer, as well as graph algorithms for graph traversal, minimum spanning trees, and shortest paths.

College/Department: College of Computing and Informatics
Repeat Status: Not repeatable for credit
Prerequisites: CS 260 [Min Grade: C] and CS 270 [Min Grade: C] and CS 277 [Min Grade: C] and (MATH 221 [Min Grade: C] or MATH 222 [Min Grade: C])

Environmental Engineering BSENE

https://catalog.drexel.edu/undergraduate/collegeofengineering/environmentalengineering/

...BMES, CHE, CHEM, CIVE, CS, ECE, ECEP, ECEE...321 , PBHL 350 , PBHL 457 or courses approved...

Environmental Engineering BS/MS

https://catalog.drexel.edu/undergraduate/collegeofengineering/environmentalengineering-bsms/

...BMES, CHE, CHEM, CIVE, CS, ECE, ECEP, ECEE...321, PBHL 350, PBHL 457 or courses approved...