data structure is the logical or mathematical arrangement of data in memory it considers not only the physical layout of the data items in the memory but also the relationships between these data items and the operations that can be performed on these items the choice of appropriate data structures and algorithms forms the fundamental step in the design of an efficient program thusa thorough understanding of data structure concepts is essential for students who wish to work in the design and implementation of software systems ca general-purpose programming languagehaving gained popularity in both academia and industry serves as an excellent choice for learning data structures this second edition of data structures using has been developed to provide comprehensive and consistent coverage of both the abstract concepts of data structures as well as the implementation of these concepts using language the book utilizes systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on themand the analysis of these algorithms in terms of their running times new to the second edition based on the suggestions from students and faculty membersthis edition has been updated and revised to increase the clarity of presentation where required some of the prominent changes are as followsnew sections on omega and theta notationsmulti-linked listsforestsconversion of general trees into binary trees - treesbinary heap implementation of priority queuesinterpolation searchjump searchtree sortbucket hashingcylinder surface indexing additional programs on header linked listsparentheses checkingevaluation of prefix expressionspriority queuesmultiple queuestree sortfile handling address calculation sort new appendices on dynamic memory allocationgarbage collectionbacktrackingjohnson' problem stacks and queues and multi-way search trees are now covered in separate with more comprehensive explanation of concepts and applications extended material --this has been completely restructured and reorganized so that it now provides brief recapitulation of constructs and syntax functions and pointers which were included as independent in the first edition have now been jointly included in this --new sections on primitive and non-primitive data structuresdifferent approaches to designing algorithmsomegathetaand little notations have been included number of new examples have also been added which show how to find the complexity of different functions --this now includes brief sections on unionsa data type similar to structures --this has been expanded to include topics on multi-linked listsmulti-linked list implementation of sparse matricesand program on header linked lists www allitebooks com