computer science and engineering

Efficient Algorithms and Intractable Problems

Course Description

Course Objective

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

My Questions

Comment