Data Structures and Program Design Using Python
Autor Neha Malhotra, Dheeraj Malhotraen Limba Engleză Paperback – 24 noi 2020
- Covers data structure fundamentals using Python
- Numerous tips, analogies, and practical applications enhance understanding of subjects under discussion
- "Frequently Asked Questions" integrated throughout the text clarify and explain concepts
- Includes a variety of end-of-chapter exercises, e.g., programming, theoretical, and multiple choice.
Preț: 361.16 lei
Preț vechi: 451.45 lei
-20%
Puncte Express: 542
Preț estimativ în valută:
63.94€ • 74.45$ • 55.54£
63.94€ • 74.45$ • 55.54£
Carte disponibilă
Livrare economică 02-16 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781683926399
ISBN-10: 1683926390
Pagini: 394
Dimensiuni: 178 x 229 x 22 mm
Greutate: 0.67 kg
Ediția:1. Auflage
Editura: Mercury Learning and Information
ISBN-10: 1683926390
Pagini: 394
Dimensiuni: 178 x 229 x 22 mm
Greutate: 0.67 kg
Ediția:1. Auflage
Editura: Mercury Learning and Information
Notă biografică
Malhotra D. : D. Malhotra, PhD is a professor in information technology and has published numerous research articles with international publishers such as ACM, Springer, Elsevier, and IEEE.Malhotra N. :
N. Malhotra's teaching and research interests include data structures, big data analytics, business intelligence, Java, and distributed programming.
N. Malhotra's teaching and research interests include data structures, big data analytics, business intelligence, Java, and distributed programming.
Cuprins
1: Introduction to Data Structures
2: Introduction to Python
3: Arrays
4: Linked Lists
5: Queues
6: Searching & Sorting
7: Stacks
8: Trees
9: Multi-Way Search Trees
10: Hashing
11: Files
12: Graphs
Appendix: Answers to Selected Exercises
Index
2: Introduction to Python
3: Arrays
4: Linked Lists
5: Queues
6: Searching & Sorting
7: Stacks
8: Trees
9: Multi-Way Search Trees
10: Hashing
11: Files
12: Graphs
Appendix: Answers to Selected Exercises
Index