MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03409cam a2200397Mi 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
on1085187892 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OCoLC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20240726104806.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
190209s2019 xx o 000 0 eng d |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
EBLCP |
| Language of cataloging |
eng |
| Description conventions |
pn |
| -- |
rda |
| Transcribing agency |
EBLCP |
| Modifying agency |
YDX |
| -- |
OCLCQ |
| -- |
NT |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781773616582 |
| Qualifying information |
|
| 050 04 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76 |
| Item number |
.D383 2019 |
| 049 ## - LOCAL HOLDINGS (OCLC) |
|---|
| Holding library |
MAIN |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Yadav, Anil Kumar. |
| Relator term |
Author |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Data Structures with C Programming /Anil Kumar Yadav and Vinod Kumar Yadav. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Ashland : |
| Name of publisher, distributor, etc. |
Arcler Press, |
| Date of publication, distribution, etc. |
(c)2019. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 online resource (334 pages) |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Content type code |
txt |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
computer |
| Media type code |
c |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
online resource |
| Carrier type code |
cr |
| Source |
rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS |
|---|
| File type |
data file |
| Source |
rda |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographies and index. |
| 505 00 - 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 |
| 505 00 - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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 |
| 505 00 - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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 |
| 505 00 - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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 |
| 530 ## - COPYRIGHT INFORMATION: |
|---|
| COPYRIGHT INFORMATION |
COPYRIGHT NOT covered - Click this link to request copyright permission: |
| Uniform Resource Identifier |
<a href="b">b</a> |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Data structures (Computer science) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
C (Computer program language) |
| 655 #1 - INDEX TERM--GENRE/FORM |
|---|
| Genre/form data or focus term |
Electronic Books. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Yadav, Vinod Kumar. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| -- |
Click to access digital title | log in using your CIU ID number and my.ciu.edu password. |
| Uniform Resource Identifier |
<a href="httpss://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2013939&site=eds-live&custid=s3260518">httpss://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2013939&site=eds-live&custid=s3260518</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Online Book (LOGIN USING YOUR MY CIU LOGIN AND PASSWORD) |
| DONATED BY: |
|
| VENDOR |
EBSCO |
| Classification part |
QA.. |
| PUBLICATION YEAR |
2019 |
| LOCATION |
ONLINE |
| REQUESTED BY: |
|
| -- |
|
| -- |
NFIC |
| Source of classification or shelving scheme |
|
| 994 ## - |
|---|
| -- |
92 |
| -- |
NT |
| 902 ## - LOCAL DATA ELEMENT B, LDB (RLIN) |
|---|
| a |
1 |
| b |
Cynthia Snell |
| c |
1 |
| d |
Cynthia Snell |