Course Description
This course covers topics on motivation,Asymptotic complexity,binary search,Sorting,Graphs,Dijkstra algorithm,Priority queues, heaps,Search Trees,Dynamic Programming & Intractability.
Course Objective
This course covers topics on motivation-Asymptotic complexity-binary search-Sorting-Graphs-Dijkstra algorithm-Priority queues- heaps-Search Trees-Dynamic Programming and Intractability.
Ask a Question
My Questions
e-book enables you to access interactive reading material to strengthen the skills learned in the sessions.
Online Lab enables you to practice the application of concepts you have learnt in the sessions in the virtual environment.
Tutorials enables you to get easy learning with clear, crisp, and to-the-point content on a wide range of technical and non-technical subjects without any preconditions and impediments.