This Course is Offered and Certified by uLektz Academy
About the Course:
This course provides students with concepts of Pseudo code for expressing algorithms, Asymptotic Notation, Probabilistic analysis, Amortized analysis, Divide and conquer: General method, Greedy method General method and Single source shortest path problem
Objectives
1.Will familiarize about Optimal binary search trees
2.Will demonstrate All pairs shortest path problem
3.Will develop knowledge in Travelling sales person problem
Topics Covered:
1. Introduction to algorithms
2. Divide and conquer algorithm
3. Greedy method
4. Dynamic Programming
5. Backtracking
6. Branch and Bound
Learning Content – 90 hours
Language – English
Certification – Learners will get the Certification after successful completion of the course.
Recommended Jobs:
Algorithm Developer, RTL (VHDL/Verilog) Design Engineer, Analysis & design of Algorithm, etc.,