03216nam a22002657a 450000500170000000800410001702000180005804000070007604100080008308200170009110000460010824500450015426000270019930000280022636500940025452024350034865000140278365000260279765000230282365000110284665000220285770000220287970000260290170000230292720260327143541.0260327b        |||||||| |||| 00| 0 eng d  a9789354247866  cAL  aeng  a005.73bGOOD  aMichael T Goodrich and others ...[Et al.]  aData structures and algorithms in python  aNew DelhibWileyc2025  axxiii,782pbPBc24x18cm  2Information Science and EngineeringaVBI-2645b₹659.25c₹d₹879.00e25%f20-02-2026  aProduct DescriptionData 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.About the AuthorMichael T. Goodrich is a Chancellor?s Professor in the Department of Computer Science at University of California, Irvine. Previously, he was a professor at Johns Hopkins University. His research interests include analysis, design, and implementation of algorithms, data security, cloud computing, graph drawing, and computational geometry. He is a Fulbright scholar and a fellow of the American Association for the Advancement of Science (AAAS), Association for Computing Machinery (ACM), and Institute of Electrical and Electronics Engineers (IEEE). Roberto Tamassia is the Plastech Professor of Computer Science in the Department of Computer Science at Brown University. He is also the Director of Brown?s Center for Geometric Computing. His research interests include data security, applied cryptography, cloud computing, analysis, design, and implementation of algorithms, graph drawing, and computational geometry. He is a fellow of the American Association for the Advancement of Science (AAAS), Association for Computing Machinery (ACM), and Institute of Electrical and Electronics Engineers (IEEE). Michael Goldwasser is currently a Professor in the Department of Mathematics and Computer Science at Saint Louis University and the Director of their Computer Science program. Previously, he was a faculty member in the Department of Computer Science at Loyola University Chicago. His research interests focus on the design and implementation of algorithms, having published work involving approximation algorithms, online computation, computational biology, and computational geometry. He is also active in the computer science education community.
  aRecursion  aArray Based Sequences  aSorting Algorithms  aStacks  aIndian Adaptation  aTamassia, Roberto  aGoldwasser, Michael H  aPanda, Subhrakanta