2.4.2.1. MB101: Theory of algorithms
Learning outcome:
-
Basics of Algorithms,
-
Analysis of Algorithms,
-
NP-complete problems,
-
Models of computation,
-
Merging, Sorting Searching,
-
Generating permutation,
-
Matrix Operation,
-
Graph-Theory problems,
-
Decision and Optimization problems,
-
Selected applications are also covered,
-
Case study.
Bibliography:
-
R. Sedgewick, "Algorithms in Java, part 1-4: Fundamentals Data Structure, Sorting, Searching", Addison-Wesley, 2002
-
T.H. Cormen et al., "Introduction to algorithms", The MIT Press, 2001
-
A.V. Aho, J.D. Ullman, J.E. Hopcroft, "Data Structures and Algorithms", Addison-Wesley, 1983
Dostları ilə paylaş: |