000 -LEADER |
fixed length control field |
04030nam a22003257a 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20220917105111.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
ta |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
220304b2019 onc||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781773613376 (hbk) |
040 ## - CATALOGING SOURCE |
Language of cataloging |
eng |
Transcribing agency |
HNU |
Description conventions |
rda |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Edition number |
23 |
Placement Code |
GC |
Classification number |
005.73 Y10 2019 |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Yadav, Anil Kumar, |
Relator term |
author. |
245 ## - TITLE STATEMENT |
Title |
Data structures with C programming / |
Statement of responsibility, etc. |
Dr. Anil Kumar Yadav and Vinod Kumar Yadav. |
264 ## - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
Place of production, publication, distribution, manufacture |
Oakville, ON : |
Name of producer, publisher, distributor, manufacturer |
Arcler Press, |
Date of production, publication, distribution, manufacture, or copyright notice |
©2019. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xvi, 314 pages : |
Other physical details |
illustrations ; |
Dimensions |
24 cm. |
500 ## - GENERAL NOTE |
General note |
Includes index. |
505 ## - FORMATTED CONTENTS NOTE |
Formatted contents note |
Cover; 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 Chapter 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 Chapter 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 Chapter 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 |
520 ## - SUMMARY, ETC. |
Summary, etc. |
"In the computer programming or software development, data structures is one of the most valuable roles for computer engineers. Use of appropriate data structures enables a computer system to perform its task more efficiently, by influencing the ability of computers to store and retrieve data from any location in its memory. This book is about the structure, actions and the principle of a different data type that help improve the ability to write an efficient algorithm, program and Analysis algorithm and programm complexity." |
520 ## - SUMMARY, ETC. |
Summary, etc. |
Examines various concepts related to structuring of data. The book starts with and explanation of data structures that are utilized to store data in a computer in an organised form. It includes different types of data structure using the C language. |
521 ## - TARGET AUDIENCE NOTE |
Target audience note |
College of Engineering and Computer Studies |
Source |
Bachelor of Science in Computer Engineering |
521 ## - TARGET AUDIENCE NOTE |
Target audience note |
College of Engineering and Computer Studies |
Source |
Bachelor of Science in Information Technology |
521 ## - TARGET AUDIENCE NOTE |
Target audience note |
College of Engineering and Computer Studies |
Source |
Bachelor of Science in Computer Science |
546 ## - LANGUAGE NOTE |
Language note |
Text in English |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Data structures (Computer science). |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
C (Computer program language). |
700 ## - ADDED ENTRY--PERSONAL NAME |
Personal name |
Yadav, Vinod Kumar, |
Relator term |
author. |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Koha item type |
Books |
Classification part |
000-099 |