Fundamentals of data structures in C (Record no. 200017)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01897nam a22002777a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20260602151636.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 260602b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9788173716058 |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.73 HOR-F |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Horowitz, Ellis. |
| 245 ## - TITLE STATEMENT | |
| Title | Fundamentals of data structures in C |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Hyderabad |
| Name of publisher | Universities Press (India) Pvt. Ltd. |
| Year of publication | 2023 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xvii, 617p. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This new edition provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and graphs and techniques such as sorting hashing that form the basis of all software. In addition, this text presents advanced or specialized data structures such as priority queues, efficient binary search trees, multiway search trees and digital search structures. The book now discusses topics such as weight biased leftist trees, pairing heaps, symmetric min–max heaps, interval heaps, top-down splay trees, B+ trees and suffix trees. Red-black trees have been made more accessible. The section on multiway tries has been significantly expanded and discusses several trie variations and their application to Internet packet forwarding. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Introduces the fundamental concepts of data structures and their implementation using the C programming language. Covers arrays, linked lists, stacks, queues, trees, graphs, sorting and searching techniques, recursion, memory management, and algorithm analysis, providing a foundation for the design and development of efficient computer programs. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Data structures |
| General subdivision | Computer science |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | C |
| General subdivision | Computer program language |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Programming language |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Sahni, Sartaj. |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Anderson-Freed, Susan. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Books and Monographs |
| Full call number | Accession Number | Koha item type | Lost status | Damaged status | Permanent Location | Current Location | Date acquired | Source of acquisition |
|---|---|---|---|---|---|---|---|---|
| 005.73 HOR-F | 102832 | Books and Monographs | Central Library, NIT Jalandhar | Central Library, NIT Jalandhar | 20.05.2026 | Mumbai, TV Enterprises | ||
| 005.73 HOR-F | 102833 | Books and Monographs | Central Library, NIT Jalandhar | Central Library, NIT Jalandhar | 20.05.2026 | Mumbai, TV Enterprises | ||
| 005.73 HOR-F | 102834 | Books and Monographs | Central Library, NIT Jalandhar | Central Library, NIT Jalandhar | 20.05.2026 | Mumbai, TV Enterprises | ||
| 005.73 HOR-F | 102835 | Books and Monographs | Central Library, NIT Jalandhar | Central Library, NIT Jalandhar | 20.05.2026 | Mumbai, TV Enterprises | ||
| 005.73 HOR-F | 102836 | Books and Monographs | Central Library, NIT Jalandhar | Central Library, NIT Jalandhar | 20.05.2026 | Mumbai, TV Enterprises |