X hits on this document

104 views

0 shares

0 downloads

0 comments

8 / 32

sort, Selection sort, Insertion sort, Shell, Radix and Merge sort.(Hrs 8)

UNIT VI: Algorithmic strategies

Introduction, Types of algorithms: Divide and conquer, backtracking, greedy, dynamic programming and randomized algorithm, example algorithm for each strategy.        (Hrs 8)

Text Books:

1.

E. Horowitz, S. Sahni, D. Mehta “Fundamentals of Data Structures in C++”, Galgotia Book Source, New Delhi 1995 ISBN 16782928

2.

A. Aho, J. Hopcroft, J. Ulman, “Data Structures and Algorithms”, Pearson Education, 1998, ISBN-0-201-43578-0

Reference Books:

1.

R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with C++”, Thomson Brookes /COLE Books, 2002, ISBN 981 – 240 – 644 – 1

2.

Y. Langsam, M. Augenstin and A. Tannenbaum, “Data Structures using C and C++”, 2nd Edition, Prentice Hall of India, 2002, ISBN-81-203-1177-9

3.

G. Heileman, “Data Structures, Algorithms and Object oriented Programming”, Tata-McGraw-Hill, 2002, ISBN 0 – 07 –048641 – 7.

4.

J. Tremblay, P. Soresan, “An introduction to data structures with Applications”, 2nd edition, Tata McGraw-Hill International Editions, 1984, ISBN-0-07-462471-7.

Document info
Document views104
Page views109
Page last viewedSat Dec 03 05:12:08 UTC 2016
Pages32
Paragraphs1002
Words9463

Comments