000			03409cam a2200397Mi 4500
001			on1085187892
003			OCoLC
005			20240726104806.0
008			190209s2019 xx o 000 0 eng d
040			_aEBLCP _beng _epn _erda _cEBLCP _dYDX _dOCLCQ _dNT
020			_a9781773616582 _q((electronic)l(electronic)ctronic)
050	0	4	_aQA76 _b.D383 2019
049			_aMAIN
100	1		_aYadav, Anil Kumar. _e1
245	1	0	_aData Structures with C Programming /Anil Kumar Yadav and Vinod Kumar Yadav.
260			_aAshland : _bArcler Press, _c(c)2019.
300			_a1 online resource (334 pages)
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_adata file _2rda
504			_a2
505	0	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	0	0	_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	0	0	_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	0	0	_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
530			_a2 _ub
650		0	_aData structures (Computer science)
650		0	_aC (Computer program language)
655		1	_aElectronic Books.
700	1		_aYadav, Vinod Kumar.
856	4	0	_zClick to access digital title | log in using your CIU ID number and my.ciu.edu password. _uhttpss://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2013939&site=eds-live&custid=s3260518
942			_cOB _D _eEB _hQA.. _m2019 _QOL _R _x _8NFIC _2LOC
994			_a92 _bNT
999			_c78403 _d78403
902			_a1 _bCynthia Snell _c1 _dCynthia Snell