National Institute of Technology, Kurukshetra

Able to design, implement and analyze standard searching and sorting algorithms.

Implement standard divide and conquer, Dynamic programming, Greedy and backtracking algorithms.

Able to choose between different data structures i.e., trees, heaps etc. and pick an appropriate data structure for any given design situation.

Able to implement the major graph algorithms and their analysis.

सामग्री

Able to design, implement and analyze standard searching and sorting algorithms.
Implement standard divide and conquer, dynamic programming, greedy and backtracking algorithms.
Able to choose between different data structures i.e., trees, heaps etc. for any given design situation.
Able to implement the major graph algorithms and their analysis.

Cormen, Leiserson and Rivest: Introduction to Algorithms, 3/e, PHI.
Horowitz, Sahni, and Rajasekaran: Fundamentals of Computer Algorithms, Second Edition, Universities Press, Hyderabad.
Aho, Hopcroft, and Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley.