Search Results
CS 521 Data Structures and Algorithms I 3.0 Credits
Techniques for analyzing algorithms: asymptotic notation, recurrences, and correctness of algorithms; divide and conquer: quick sort, merge sort, median and order statistics; elementary data structures: hashing, binary heaps, binary search trees, balanced search trees; graph algorithms: Depth and Breadth first searches, connected components, minimum spanning trees, shortest paths in graphs.
Repeat Status: Not repeatable for credit
Prerequisites: CS 502 [Min Grade: C]
Robotics and Autonomy MS
https://catalog.drexel.edu/graduate/collegeofengineering/roboticsandautonomy/
...include MATH 510 , MATH 521 , MATH 631 , and...CHE, CHEM, CIVE, CMGT, CS, EGMT, ENGR, ENTP...