Introduction of algorithm
Learning the concept of Exhaustive Search Algorithm in the case of the Boyer-Moore-Horspool algorithm and Rabin-Karp algorithm.
Learning Graph algorithms with Hamiltonian Cycle and Eulerian Cycle in case of DNA Sequencing.
Dynamic Programming recursion sometimes repeatedly solves the same subproblems. (recursive Fibonacci) ** Reorganize the computation of subproblems so not to solve them over and over again. compute t...
Principles of Machine Learning
Deep (Machine) Learning