LECTURE NOTES/SUBJECT NOTES,QUESTION BANK,QUESTION PAPER,2 MARKS AND 16 MARKS ALL IN ONE PAGE
AIM:
To master the design and applications of linear, tree, and graph structures. To understand various
algorithm design and analysis techniques.
UNIT I LINEAR STRUCTURES
UNIT II TREE STRUCTURES
UNIT III BALANCED SEARCH TREES AND INDEXING
UNIT IV GRAPHS
UNIT V ALGORITHM DESIGN AND ANALYSIS
TEXT BOOKS
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education Asia, 2002.
2. ISRD Group, “Data Structures using C”, Tata McGraw-Hill Publishing Company Ltd., 2006.
REFERENCES
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson
Education, 1983.
2. R. F. Gilberg, B. A. Forouzan, “Data Structures: A Pseudocode approach with C”, Second
Edition, Thomson India Edition, 2005.
3. Sara Baase and A. Van Gelder, “Computer Algorithms”, Third Edition, Pearson Education, 2000.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", Second
Edition, Prentice Hall of India Ltd, 2001.
---------------------------------------------------------------------------------
EE2204 2 MARKS QUESTIONS WITH ANSWERS : cLICKhERE
EE2204 SUBJECT NOTES/LECTURE NOTES : cLICKhERE
EE2204 Anna university Question Bank: cLICKhERE
EE2204 Anna university Question paper: | Nov/Dec 2009 | April/May 2010 |Nov/Dec 2011 | Nov/Dec 2010 | April/May 2012 |
0 comments:
Post a Comment