Efficient Algorithms and Intractable Problems - Concept and basic techniques in the design and analysis of algorithms; models of computation; lower bounds; algorithms for optimum search trees, balanced trees and UNION-FIND algorithms; numerical and algebraic algorithms; combinatorial algorithms. Turing machines, how to count steps, deterministic and nondeterministic Turing machines, NP-completeness. Unsolvable and intractable problems.
Ask a Question
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.