000			04109cam a2200553Mi 4500
001			on1085187892
003			OCoLC
005			20241121072733.0
006			m d
007			cr |n|---|||||
008			190209s2019 xx o 000 0 eng d
040			_aEBLCP _beng _epn _cEBLCP _dYDX _dOCLCQ _dN$T _dOCLCQ _dUKAHL _dOCLCF _dOCLCO _dOCLCQ _dOCLCO _dTMA
019			_a1084564601 _a1084685751
020			_a1773616587
020			_a9781773616582 _q(electronic bk.)
035			_a2013939 _b(N$T)
035			_a(OCoLC)1085187892 _z(OCoLC)1084564601 _z(OCoLC)1084685751
050		4	_aQA76.9.D35
082	0	4	_a005.7/3 _223
049			_aMAIN
100	1		_aYadav, Anil Kumar. _910904
245	1	0	_aData Structures with C Programming / _cAnil Kumar Yadav and Vinod Kumar Yadav.
260			_aAshland : _bArcler Press, _c2019.
300			_a1 online resource (334 pages)
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
588	0		_aPrint version record.
505	0		_aCover; Half Title Page; Title Page; Copyright Page; About the Authors; Table of Contents; List of Figures; Preface; Chapter 1 Data Structures; 1.1. Introduction; 1.2. Data Structure Basic Terminology; 1.3. Data Structure; 1.4. Introduction To Algorithm; 1.5. Basic Concept of Function; 1.6. Basic Concept of Pointers; 1.7. Introduction To Structure; 1.8. Dynamic Memory Allocation In Data Structure; Chapter 2 Array; 2.1. Introduction; 2.2. Application of Array; 2.3. Definition of Array; 2.4. Representation of Array; 2.5. Ordered List; 2.6. Sparse Matrices; 2.7. Garbage Collection
505	8		_aChapter 3 Recursion3.1. Introduction; 3.2. Recursion; 3.3. Tower of Hanoi; 3.4. Backtracking; Chapter 4 Stack; 4.1. Introduction; 4.2. Definition of Stack; 4.3. Operations on Stack; 4.4. Disadvantages of Stack; 4.5. Applications of Stack; 4.6. Expressions (Polish Notation); 4.7. Evaluation of Postfix Expression; 4.8. Decimal To Binary Conversion; 4.9. Reversing The String; Chapter 5 Queue; 5.1. Introduction; 5.2. Definition And Structure of Queue; 5.3. Operations on Queue; 5.4. Circular Queue; 5.5. D-Queue (Double Ended Queue); 5.6. Priority Queues; 5.7. Application of Queue
505	8		_aChapter 6 Linked List6.1. Introduction; 6.2. Definition And Structure of Linked List; 6.3. Characteristics of Linked List; 6.4. Types of Linked List; 6.5 Polynomial Representation of Linked List; Chapter 7 Tree; 7.1. Introduction; 7.2. Definition of Trees; 7.3. Binary Tree; 7.4. Binary Tree Representation; 7.5. Binary Tree Traversal; 7.6. Binary Search Tree (BST); 7.7. Height Balanced (AVL) Tree; Chapter 8 Graph; 8.1. Introduction; 8.2. Definition of Graph; 8.3. Representation of Graphs; 8.4. Graph Traversal; 8.5. Spanning Tree; 8.6. Shortest Path Problem; 8.7. Application Of Graph
505	8		_aChapter 9 Sorting9.1. Introduction; 9.2. Types of Sorting; 9.3. Basic Terms of Sorting; 9.4. Sorting Techniques; Chapter 10 Searching and Hashing; 10.1. Introduction; 10.2. Searching; 10.3. Hashing; 10.4. Collision; 10.5. Collision Handling Method; 10.6. Rehashing; 10.7. Application of Hashing; Index
590			_aAdded to collection customer.56279.3
650		0	_aData structures (Computer science) _91589
650		0	_aC (Computer program language) _9115
650		6	_aStructures de donn�ees (Informatique) _910905
650		6	_aC (Langage de programmation) _910906
650		7	_aC (Computer program language) _2fast _9115
650		7	_aData structures (Computer science) _2fast _91589
655	0	4	_aElectronic books. _93907
700	1		_aYadav, Vinod Kumar. _910907
776	0	8	_iPrint version: _aYadav, Anil Kumar. _tData Structures with C Programming. _dAshland : Arcler Press, �2019
856	4	0	_3EBSCOhost _uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2013939
938			_aAskews and Holts Library Services _bASKH _nBDZ0044473316
938			_aProQuest Ebook Central _bEBLB _nEBL5655545
938			_aEBSCOhost _bEBSC _n2013939
938			_aYBP Library Services _bYANK _n16023380
994			_a92 _bN$T
999			_c7001 _d7001