X hits on this document

118 views

0 shares

0 downloads

0 comments

21 / 32

Indexing Techniques: hashed indexes, Tree indexing- B-trees, B+ Trees and Trie Indexing. Introduction of Top-down Splay Trees, Red – black trees, AA trees, k-d trees (Implementation not expected)      (Hrs 8)

UNIT VI:

Files

External storage devices, Files: Definition and concepts, File organization: Sequential files, random, linked, inverted and cellular partitions. Processing of sequential, Index-sequential and direct files.

Introduction to Generic Programming

Introduction to Standard Template Library (STL), containers, iterators and algorithms, study of container template classes for vectors and stacks and related algorithms                    (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.

M. Weiss, “Data Structures and Algorithm Analysis in C++”, 2nd edition, Pearson Education, 2002, ISBN-81-7808-670-0

Reference Books:

1.

A. Drozdek, “Data Structures in C++”, 2nd Edition, Thomson Brookes /COLE Books, 2002, ISBN 981 – 240 – 079 – 6.

2.

A. Michael Berman, “Data structures via C++”, Oxford University Press, 2002, ISBN-0-19-510843-4.

3.

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.

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.

5.

M. Folk, B. Zoellick, G. Riccardi, “File Structure An Object oriented approach with C++”, Pearson Education, 2002, ISBN 81 – 7808 – 131 – 8.

Document info
Document views118
Page views123
Page last viewedFri Dec 09 10:13:47 UTC 2016
Pages32
Paragraphs1002
Words9463

Comments