You must know:
1. Algorithms (asymptotic notation of running time complexity, space and time complexity, order of growth of functions etc).
2. Mergesort, quicksort, heapsort, heapification etc.
3. DP: Knapsack, matrix chain, longest common subsequence, transitive closure of a graph, Floyd-Warshall algorithm.
5 freelances font une offre moyenne de 51 $ pour ce travail
Hello. I have gone through the description of the project carefully. If given an opportunity, I am confident of completing this task. We can discuss further about this project over the chat. Looking forward to talk to Plus
Hello! I am very interested in your post project. While I read your description carefully, I was excited with feeling that I would be able to satisfy for your requirements in this job. We can negotiate on price/Budget, Plus
-previous experience in such topics; -eager to discuss a lot in this chat stream; -degree stats / maths;
Algorithm, Mathematics, Python, Excel skilled professional with over 9 years of experience. Can build a solution as needed and deliver on the expected lines .Thanks
Hello, I have completed MS in Computer Science with specialization in Data Science and Machine Learning. I can help you with all CS courses.