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 501 [Min Grade: C] or CS 570 [Min Grade: C]) and (CS 502 [Min Grade: C] or CS 520 [Min Grade: C]) and (CS 503 [Min Grade: C] or CS 571 [Min Grade: C]) and CS 504 [Min Grade: C]
Mechanical Engineering BSME / Peace Engineering MS
...Software Development : CS 502 , CS 575 , CS 576...Interactivity: DIGM 520 , DIGM 521 WASH: CIVE 564...
Environmental Engineering BSENE / Peace Engineering MS
...Software Development : CS 502 CS 575 , CS 576...Interactivity: DIGM 520 , DIGM 521 WASH: CIVE 564...
Peace Engineering
http://catalog.drexel.edu/graduate/collegeofengineering/peaceengineering/
...Software Development : CS 502 CS 575 , CS 576...Interactivity: DIGM 520 , DIGM 521 WASH: CIVE 564...