Data structures using C /

"This second edition of "Data structures using C" is designed to serve as a textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications. It provides a comprehensive coverage of the concepts of data structures and their...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Thareja, Reema
Formato: Libro
Lenguaje:Inglés
Publicado: New Delhi : Oxford University Press, 2014.
Edición:2nd ed.
Colección:Oxford higher education
Materias:
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 02568cam a2200325Ia 4500
001 99946934004151
005 20241030105346.0
008 141016s2014 ii a 001 0 eng d
020 |a 9780198099307  |q (pbk) 
020 |a 0198099304  |q (pbk) 
035 |a (OCoLC)893630334 
035 |a (OCoLC)ocn893630334 
040 |a UKMGB  |c UKMGB  |d OCLCO  |d U@S 
049 |a U@SA 
050 4 |a QA76.9.D35  |b T53 2014 
082 0 4 |a 005.73  |2 23 
100 1 |a Thareja, Reema. 
245 1 0 |a Data structures using C /  |c Reema Thareja. 
250 |a 2nd ed. 
260 |a New Delhi :  |b Oxford University Press,  |c 2014. 
300 |a xvi, 531 p. :  |b il. ;  |c 25 cm. 
490 1 |a Oxford higher education 
500 |a Incluye índice. 
505 0 |a Preface to the second edition -- Preface to the first edition -- 1. Introduction to C -- 2. Introduction to Data Structures and Algorithms -- 3. Arrays -- 4. Strings -- 5. Structures and Unions -- 6. Linked Lists -- 7. Stacks -- 8. Queues -- 9. Trees -- 10. Efficient Binary Trees -- 11. Multi-way Search Trees -- 12. Heaps -- 13. Graphs -- 14. Searching and Sorting -- 15. Hashing and Collision -- 16. Files and Their Organization -- Appendix A: Memory Allocation in C Programs -- Appendix B: Garbage Collection -- Appendix C: Backtracking -- Appendix D: Josephus Problem -- Appendix E: File Handling in C -- Appendix F: Address Calculation Sort -- Appendix G: Answers. 
520 |a "This second edition of "Data structures using C" is designed to serve as a textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications. It provides a comprehensive coverage of the concepts of data structures and their implementation using C language. Beginning with an overview of the concepts of C programming the book provides an introduction to different data structures and methods to analyse the complexity of different algorithms. It goes onto connect these concepts and apply them to the study of various data structures such as arrays, strings, linked lists, stacks, queues, trees, heaps, and graphs. In addition, the book includes detailed description of searching and sorting techniques and hashing, and an exclusive chapter on the attributes and organization of files." --Descripción del editor. 
650 0 |a Data structures (Computer science) 
650 0 |a C (Computer program language) 
650 7 |a Estructuras de datos (Computación)  |2 UDESA 
650 7 |a C (Lenguaje de programación (Computadoras))  |2 UDESA 
830 0 |a Oxford higher education