Phd analysis of algorithms in Singapore university of technology and design
This course will cover the techniques for algorithm analysis, with examples from various sorting and search algorithms. Then the course will introduce advanced design and analysis techniques including dynamic programming, greedy algorithms, amortized analysis, B-trees and Fibonacci Heaps. Finally, some graph algorithms such as minimum spanning trees, shortest path algorithms will be discussed.
At least a Bachelor s degree or above with excellent academic standing, Transcripts and certificates for any academic degrees earned or currently in progress, Test of English as a Foreign Language (TOEFL) or International English Language Testing System (IELTS) score report, Graduate Record Examinations (GRE) score report (highly recommended), Letters of recommendation from at least 3 references, A photocopy of a government issued identity card with a photograph, A Statement of Objectives
Data Scientist, Proteomics Data Scientist, Healthcare Data Analytic Specialist