Simply Easy Learning
Analysis of Algorithm
Analysis of Algorithm is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem. These estimates provide an insight into reasonable directions of search for efficient algorithms. This video tutorial will give you a great understanding on Analysis of Algorithm needed to understand the complexity of enterprise level applications and need of algorithms, and data structures.
This video tutorial is designed for students interested in learning Analysis of Algorithm and its applications. Enthusiastic readers who would like to know more about algorithms and those who wish to implement algorithms themselves may start from here. These video classes have been developed based on the latest GATE syllabus and will be useful for undergraduate students of Computer Science and Information Technology as well as those preparing for GATE exams. It will also be helpful for students in preparing them for their Engineering Syllabus.
Prof. Arnab Chakraborty is a Calcutta University alumnus with B.Sc. in Physics Hons with Gold medalist, B. Tech and M. Tech in Computer Science and Engineering has twenty-three+ years of academic teaching experience in different universities, colleges and eleven+ years of corporate training experiences for 150+ companies and trained 50,000+ professionals. He has also completed MBA from Vidyasagar University with dual specialization in Human Resource Management and Marketing Management. He is NLP and PMP trained, Global DMAIC Six Sigma Master Black Belt certified by IQF, USA. He is certified by ISA, USA on "Control and Automation System". He is also Global ITIL V3 Foundation certified as awarded by APMG, UK. Qualified for Accredited Management Teacher by AIMA. He is also empaneled trainer for HP, Accenture, IBM etc.