Python for Data Science
Material type:
TextPublication details: Delhi Wiley 2021Edition: 2nd edDescription: 808ISBN: - 9788126524938
- 005.133 J6131 P 400249
| Item type | Current library | Collection | Call number | Status | Barcode | |
|---|---|---|---|---|---|---|
Books
|
CVV Institute of Science and Technology. | BTech-Computer Science | 005.133 J6131 P (Browse shelf(Opens below)) | Available | 400249 | |
|
Books
|
CVV Institute of Science and Technology. | BTech-Computer Science | 005.133 J6131 P (Browse shelf(Opens below)) | Available | 400250 | |
|
Books
|
CVV Institute of Science and Technology. | BTech-Computer Science | 005.133 J6131 P (Browse shelf(Opens below)) | Available | 400251 | |
|
Books
|
CVV Institute of Science and Technology. | BTech-Computer Science | 005.133 J6131 P (Browse shelf(Opens below)) | Available | 400252 | |
|
Books
|
CVV Institute of Science and Technology. | BTech-Computer Science | 005.133 J6131 P (Browse shelf(Opens below)) | Available | 400253 |
Browsing CVV Institute of Science and Technology. shelves, Collection: BTech-Computer Science Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 005.133 B3962 C C Programming & Data Structures | 005.133 B3962 C C Programming & Data Structures | 005.133 J6131 P Python for Data Science | 005.133 J6131 P Python for Data Science | 005.133 J6131 P Python for Data Science | 005.133 J6131 P Python for Data Science | 005.133 J6131 P Python for Data Science |
Data Structures and Algorithms in Python offers a comprehensive, definitive introduction to data structures and algorithms, including their design, analysis, and implementation in Python. Utilizing a consistent object-oriented viewpoint throughout the book, it provides detailed algorithmic strategies for producing efficient realizations of common data structures such as arrays, stacks, queues, linked lists, trees, maps, hash tables, search trees, and graphs. The book also provides an in-depth analysis of algorithmic performance that helps readers to recognize common trade-offs between competing strategies. The book incorporates a host of pedagogical features, including illustrations, code fragments, and end-of-chapter exercises.
CONTENTS
Chapter 1 Introduction to Python
Chapter 2 Object-Oriented Programming
Chapter 3 Introduction to Data Structures and Algorithms
Chapter 4 Recursion
Chapter 5 Array-Based Sequences
Chapter 6 Stacks
Chapter 7 Queues
Chapter 8 Linked Lists
Chapter 9 Trees
Chapter 10 Priority Queues
Chapter 11 Maps, Hash Tables, and Sets
Chapter 12 Search Trees
Chapter 13 Sorting Algorithms
Chapter 14 Graph Algorithms
Chapter 15 Text Processing
Chapter 16 Memory Management and B-Trees
Illustrative Examples and Programs
Exercises
Multiple Choice Questions
Chapter Notes
Answers to Multiple Choice Questions
Appendix A Character Strings in Python
Appendix B Useful Mathematical Facts
Appendix C Additional Searching and Sorting Algorithms
Bibliography
Index
There are no comments on this title.