Bibliotex, 2019. — 290 p. Algorithms are very important in computer Science. The best criteria of the algorithm make sure that the computer will perform in the best possible manner of a given task. In cases where efficiency matters a proper algorithm is important to be used. An algorithm is important in optimizing a computer program according to the available resources....
Poorav Publications, 2025. — 228 p. Welcome to “Mastering Algorithms and Data Structures”, a comprehensive guide designed to bridge the gap between theoretical concepts and practical application in the realm of Computer Science. This book is crafted for students, professionals, and enthusiasts who aspire to understand and master the intricacies of algorithms and Data Structures...
Steven J. Rosenberg, 2024. — 121 p. Algorithms: Beginnings. Algorithm: a definition. Time- and Space-Complexity. The Counting Principle. Stacks and Queues. The Stack ADT. The Queue ADT. Big-O and Asymptotic Complexity. Big-O Notation. Asymptotic Complexity. Asymptotic Complexity and Limits. State Analysis. State Analysis. Example: Sudoku Solver. Graphs. The Graph Data Type....
Leanpub, 2024. — 139 p. A concise, illustrated guide to algorithms and data structures, perfect for coding interviews, classes, or self-study. Covers key concepts, from fundamentals to graphs, trees, sorting, and search techniques. This book is a concise and illustrated guide for anyone who wants to brush up on their fundamentals in the context of coding interviews, Computer...
Red Globe Press, 2003. — 287 p. What will be the next revolution in software technology to follow XML and generics? Whatever it may be, it is likely to come from functional programming, where many of the key ideas of the last decade originated. In this textbook, the leading researchers of the field take you on a tour of the current hot topics in functional programming, with...
De Gruyter, 2020. — 450 p. — ISBN: 9783110595574. The systematic description starts with basic theory and applications of different kinds of data structures, including storage structures and models. It also explores data processing methods such as sorting, indexing, and search technologies. Due to its numerous exercises, the book is a helpful reference for graduate students,...
CompreQuest Books, 2024. — 372 p. — (Programming Models). Unlock the Future of Software Development: Declarative Programming. Are you tired of wrestling with complex, error-prone code? Ready to revolutionize your approach to software development? Dive into the world of declarative programming and discover a simpler, more efficient way to build robust, logic-based programs....
CompreQuest Books, 2024. — 328 p. — (Programming Models). Discover the Algorithmic Revolution: Procedural Programming Unveiled. Unearth the Essence of Algorithmic Mastery. Embark on a transformative journey into the heart of procedural programming with "Procedural Programming: Unleashing Algorithmic Power." This book commands your attention as it unravels the foundational...
Massachusetts Institute of Technology (MIT), 2009. — 171 p. This course covers a collection of geometric techniques that apply broadly in modern algorithm design. Spectral Graph Theory. Linear algebra review, adjacency, and Laplacian matrices associated with a graph, for example, Laplacians. Properties of the Laplacian, positive semidefinite matrices, spectra of common graphs,...
Universita di Pisa, 2020. — 259 p. Prologo. A warm-up! A cubic-time algorithm. A quadratic-time algorithm. A linear-time algorithm. Another linear-time algorithm. Few interesting variants. Random Sampling. Disk model and known sequence length. Streaming model and known sequence length. Streaming model and unknown sequence length. List Ranking. The pointer-jumping technique....
Singapore: World Scientific Publishing Company, 2022. — 399 p. — (Lecture Notes Series On Computing, 16). — ISBN: 9811252971. This book is an introduction to the field of parallel algorithms and the underpinning techniques to realize parallelization. The emphasis is on designing algorithms within the timeless and abstract context of a high-level programming language. The focus...
Cs.illinois.edu, 2015. — 514 p. These are lecture notes that I wrote for various algorithms classes at the University of Illinois at Urbana-Champaign, which I have taught on average once a year since January 1999. The most recent revision of these notes (or nearly so) is available online, along with a near-complete archive of all my past homework and exams. Whenever I teach an...
5th Edition. — Jones & Bartlett Learning, 2015. — 676 p. — ISBN: 1284049191, 9781284049190. Foundations of Algorithms, Fifth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. Ideal for any computer science student with a background in college algebra and discrete structures, the text presents...
Wiley-ISTE, 2022. — 304 p. — ISBN: 978-1-78630-891-7. Data structures and algorithms is a fundamental course in Computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem-solving in their respective disciplines. Most of the well-known textbooks/monographs on this subject have discussed...
Wiley-ISTE, 2022. — 304 p. — ISBN: 978-1-78630-891-7. Data structures and algorithms is a fundamental course in Computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem-solving in their respective disciplines. Most of the well-known textbooks/monographs on this subject have discussed...
London: Wiley-ISTE, 2023. — 356 p. Hash Tables. Dictionaries. Hash table structure. Hash functions. Building hash functions. Linear open addressing. Operations on linear open-addressed hash tables. Performance analysis. Other collision resolution techniques with open addressing. Chaining. Operations on chained hash tables. Performance analysis. Applications. Representation of a...
London: Wiley-ISTE, 2023. — 284 p. History of algorithms. Definition, structure, and properties of algorithms. Definition. Structure and properties. Development of an algorithm. Data structures and algorithms. Data structures – definition and classification. Abstract data types. Classification. Algorithm design techniques. Organization of the book. Analysis of Algorithms. The...
Springer Cham, 2022. — 513 p. — eBook ISBN: 978-3-031-17043-0. With approximately 2500 problems, this book provides a collection of practical problems on the basic and advanced data structures, design, and analysis of algorithms. To make this book suitable for self-instruction, about one-third of the algorithms are supported by solutions, and hints and comments support some...
Leanpub, 2022-08-01. — 305 p. This book powers our MicroMasters program on edX and specialization in Coursera, one of the ten most popular computer science courses on Coursera. Over half a million students have tried to solve many programming challenges and algorithmic puzzles described in this book There are many excellent books on Algorithms — why in the world we would write...
New York: Cengage Learning, 1989. — 472 p. For junior/senior computer science majors. Presents the concept of the algorithm as a product of design techniques that students are able to master.
Sung-Hyuk Cha, 2020. — 1400 p. The intended readership includes both undergraduate and graduate students majoring in computer science as well as researchers in the computer science area. The book is suitable either as a textbook or as a supplementary book in algorithm courses. Over 400 computational problems are covered with various algorithms to tackle them. Rather than...
New York: Springer, 2010. — 286 p. Algorithms and Programming is primarily intended for a first-year undergraduate course in programming. It is structured in a problem-solution format that requires the student to think through the programming process, thus developing an understanding of the underlying theory. Although the author assumes some moderate familiarity with...
New York: Prentice-Hall, 2000. — 196 p. Although projects are a major component of today's courses until now there has been no single resource to help students acquire the skills they need to complete them successfully. The Essence of Computing Projects - A Student's Guide will fill this gap for both undergraduate and postgraduate students. It covers all the fundamental skills...
De Gruyter, 2020. — 372 p. — ISBN: 978-3-11-067605-1. The systematic description starts with basic theory and applications of different kinds of data structures, including storage structures and models. It also explores on data processing methods such as sorting, index and search technologies. Due to its numerous exercises the book is a helpful reference for graduate students,...
Cognella, 2020. — 179 p. — ISBN13: 978-1516535064. Algorithms in Action effectively introduces students to a variety of techniques for designing algorithms with a focus on developing intuitive understanding. Readers learn how to successfully construct foundational algorithms, preparing them for more advanced courses in the discipline, as well as professional application. Over...
New York: Cognella, 2020. — 179 p. Algorithms in Action effectively introduces students to a variety of techniques for designing algorithms with a focus on developing intuitive understanding. Readers learn how to successfully construct foundational algorithms, preparing them for more advanced courses in the discipline, as well as professional application. Over the course of...
Cambridge: Cambridge University Press, 2021. — 345 p. String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text...
New York: Manning Publications, 2021. — 769 p. Advanced Algorithms and Data Structures introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. As a software engineer, you’ll encounter countless programming challenges that initially seem confusing, difficult, or even impossible. Don’t despair! Many of...
Walter de Gruyter GmbH, 2021. — 178 p. — ISBN: 978-3110693416. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important...
Plural Publishing, Inc, 2020. — 314 p. An accessible introduction to algorithms, explaining not just what they are but how they work, with examples from a wide range of application areas.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to tournament scheduling, DNA sequencing,...
Boca Raton: CRC Press, 2019. — 260 p. — ISBN: 9781138592605. Advanced data structures is a core course in Computer Science which most graduate program in Computer Science, Computer Science and Engineering , and other allied engineering disciplines, offer during the first year or first semester of the curriculum. The objective of this course is to enable students to have the...
Winnipeg: University of Manitoba, 2011. — 428 p. Courses such as COMP 1010 and COMP 1012 focus on developing algorithms using primitive data types (ints, doubles, etc.), conditions, loops, arrays, and methods. These are the basic building blocks of computer programming and this style of programming is referred to as “procedural programming”. In COMP 1020, we examine how these...
Soundlikeyourself Publishing, LLC, 2019. — 229 p. — ISBN: 978-0-9992829-4-6. Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman...
Nielsen, 2019. — 72 p. This book is designed to help those learning and teaching Computer Science. The aim of the book is to help students build fluency in their Python programming. The book would suit students who have already been introduced to the three basic programming constructs of structured programming, namely sequence, selection and iteration. The learning curve for...
Nielsen, 2019. — 72 p. This book is designed to help those learning and teaching Computer Science. The aim of the book is to help students build fluency in their Python programming. The book would suit students who have already been introduced to the three basic programming constructs of structured programming, namely sequence, selection and iteration. The learning curve for...
Second edition. — O’Reilly, 2016. — 389 p. — ISBN: 978-1-4919-4892-7. Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right...
O’Reilly Media, 2015. — 360 p. — ISBN13: 063-6-920-03288-5. Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm...
O’Reilly Media, 2015. — 360 p. — ISBN13: 063-6-920-03288-5. Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm...
O’Reilly Media, 2015. — 435 p. — ISBN13: 063-6-920-03288-5. Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm...
New York: Leanpub, 2018. — 131 p. This book powers our popular Data Structures and Algorithms online specialization on Coursera and the online MicroMasters program on edX. Since the launch of our online courses in 2016, hundreds of thousands students tried to solve many programming challenges and algorithmic puzzles described in this book. We invite you to join them! Problem...
Springer, 2019. — 515 p. — ISBN: 3030252086. This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between...
Amazon Digital Services LLC, 2019. — 387 p. This book was written to fill the gap that exists when Computer Science students, and programmers, attempt to learn and analyze the different algorithms that currently exist. I took a course on Algorithms and was disappointed in the type of material that’s currently available. There are two types of books that I kept running into: 1)...
University of Chicago Press, 2019. — 224 p. — ISBN: 978-0226627564. Computerized processes are everywhere in our society. They are the automated phone messaging systems that businesses use to screen calls; the link between student standardized test scores and public schools’ access to resources; the algorithms that regulate patient diagnoses and reimbursements to doctors. The...
2nd edition. — Wiley, 2019. — 800 p. — ISBN: 978-1-119-57596-2. A friendly introduction to the most useful algorithms written in simple, intuitive English The revised and updated second edition of Essential Algorithms, offers an accessible introduction to computer algorithms. The book contains a description of important classical algorithms and explains when each is...
University of Illinois, 2018. — 448 p. This textbook grew out of a collection of lecture notes that I wrote for various algorithms classes at the University of Illinois at Urbana-Champaign, which I have been teaching about once a year since January 1999. Spurred by changes of our undergraduate theory curriculum, I undertook a major revision of my notes in 2016; this book...
Felleisen, Flatt, Findler, Gray, Krishnamurthi, Proulx, 2008. — 666 p. Diagrams. Draw them by hand. Diagrams are the programmer’s doodling language. Using a tool that draws them for you from the existing code defeats the purpose. Assigning students to do so defeats the purpose of learning to doodle. Stuff. Conventional text books at this level present object-oriented...
Tariq Rashid, 2019. — 575 p. — ISBN: 1999655702. A Gentle Introduction to Creative Coding with P5js. A fun step-by-step gentle introduction to creating digital art with computers, designed especially for: artists new to coding art, design and digital media students, technologists wanted to explore their creativity teachers and parents seeking more visual and exciting approaches...
New York: Leanpub, 2018. — 131 p. This book powers our popular Data Structures and Algorithms online specialization on Coursera and the online MicroMasters program on edX. Since the launch of our online courses in 2016, hundreds of thousands students tried to solve many programming challenges and algorithmic puzzles described in this book. We invite you to join them! Problem...
Wiley, 2015. — 816 p. Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected...
Computer Science Press, 1992. — 553 p. — ISBN: 0-7167-8243-X. Compared to what? covers all the basics of algorithm analysis but it does not just supply algorithms to memorize - it lets you guide your students through the process of breaking down and solving aigolithmic problems. The invaluable analytic skills developed through this innovative approach will appiv to anj,...
Independently published, 2018. — 335 p. — ISBN: 1981017232, 9781981017232. This is a print companion to the Massive Open Online Course (MOOC), Data Structures: An Active Learning Approach, which utilizes the Active Learning approach to instruction, meaning it has various activities embedded throughout to help stimulate your learning and improve your understanding of the...
Wiley, 1984. — 239 p. This book provides an introduction to the analysis of particular algorithms. It has its origin in lecture courses given at the Universitat des Saarlandes, Saarbrucken in 1980 and attheJohann Wolfgang Goethe-Universitat Frankfurta.M. in 1982. The material can be covered in a one-semester course. In preparing the notes for publication as a book, I have added...
Charles River Media, 2004. — 620 p. — ISBN: 9781584502500. Focusing on three core topics: design (the architecture of algorithms), theory (mathematical modeling and analysis), and the scientific method (experimental confirmation of theoretical results), the book helps students see that computer science is about problem solving, not simply the memorization and recitation of...
Springer, 2018. — 376 p. This accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on...
Springer, 2018. — 376 p. This accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on...
Springer International Publishing AG, 2017. — 159 p. — (Advanced Courses in Mathematics CRM Barcelona) — ISBN: 978-3-319-60939-3. This volume presents the lecture notes from the authors’ three summer courses offered during the program “Automorphisms of Free Groups: Geometry, Topology, and Dynamics,” held at the Centre de Recerca Matemàtica (CRM) in Bellaterra, Spain. The first...
3rd edition. — A K Peters, 2005. — 803 p. Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that...
Chicago: Department of Computer Science University of Illinois at Urbana-Champaign, 2009. — 765 p. This course packet includes lecture notes, homework questions, and exam questions from algorithms courses I taught at the University of Illinois at Urbana-Champaign in Spring 1999, Fall 2000, Spring 2001, Fall 2002, Spring 2004, Fall 2005, Fall 2006, Spring 2007, Fall 2008, and...
John Wiley & Sons, 2002. — 708 p. This book is designed to provide a comprehensive introduction to the design and analysis of computer algorithms and data structures. In terms of the computer science and computer engineering curricula, we have written this book to be primarily focused on the Junior-Senior level Algorithms (CS7) course, which is taught as a first-year graduate...
New York: Pearson, 1997. — 425 p. This work prepares students for the world of computing by giving them a solid foundation in the science of computer science, algorithms. By taking an algorithm-based approach to the subject, this introductory text seeks to help students grasp overall concepts, rather than bogging them down in specific syntax detail of a programming language...
Oxford University Press, 2015. — 727 p. — ISBN13: 978-0-19-945666-6. Algorithms: Design and Analysis of is a textbook designed for the undergraduate and postgraduate students of computer science engineering, information technology, and computer applications. It helps the students to understand the fundamentals and applications of algorithms. The book has been divided into four...
Course Technology, 2005. — 738 p. This second edition expands upon the solid, practical foundation established in the first edition of the text. A new four-part organizational structure increases the flexibility of the text, and all material is presented in a straightforward manner accompanied by an array of examples and visual diagrams.
Springer-Verlag, Berlin, Heidelberg, 2004. — 260 p. — (Lecture Notes in Mathematics 1838) — ISBN: 3540209123 Big Queues aims to give a simple and elegant account of how large deviations theory can be applied to queueing problems. Large deviations theory is a collection of powerful results and general techniques for studying rare events, and has been applied to queueing problems...
Hoboken: Wiley, 2010. - 393 p. Written by one of the developers of the technology, Hashing is both a historical document on the development of hashing and an analysis of the applications of hashing in a society increasingly concerned with security. The material in this book is based on courses taught by the author, and key points are reinforced in sample problems and an...
Springer-Verlag, Berlin, Heidelberg, 2007. — 391 p. — (Texts in Computational Science 4) — ISBN13: 978354068088 This is a book about a code and about coding. The code is a case study which has been used to teach courses in e-Science at the Australian National University since 2001. Students learn advanced programming skills and techniques in the Java TM language. Above all,...
New York: Pearson, 1999. - 694 p. This book is intended for an upper-division or graduate course in algorithms. It has sufficient material to allow several choices of topics. The purpose of the book is threefold. It is intended to teach algorithms for solving real problems that arise frequently in computer applications, to teach basic principles and techniques of computational...
Charlottesville: University of Virginia, 2011. — 264 p. Computer science studies how to describe, predict properties of, and efficiently implement information processes. This book introduces the most important ideas in computing using the Scheme and Python programming languages.
Revised Edition. — World Scientific Publishing, 2016. — 571 p. — (Lecture Notes Series on Computing - Vol. 14). — ISBN: 9814723649, 9789814723640 Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc...
World Scientific, 2003. — 354. Data Structures and Algorithms is the first textbook in hard copy produced by the Macro University Consortium. It is intended for undergraduate students in computer science and information sciences. The thirteen chapters written by an international group of experienced teachers cover the fundamental concepts of algorithms and most of the important...
Cambridge University Press, 2012. — 515. Pseudo-random sequences are essential ingredients of every modern digital communication system, from cellular telephones to satellite imagery. This book describes the design, mathematical analysis and implementation of pseudo-random sequences. Suitable for graduate students of mathematics or electrical engineering, it also serves as a...
Wiley, 2014. — 800 p. Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected...
CRC Press, 2016. — 512 p. — ISBN: 978-1482215397. Combining knowledge with strategies, Data Structure Practice for Collegiate Programming Contests and Education presents the first comprehensive book on data structure in programming contests. This book is designed for training collegiate programming contest teams in the nuances of data structure and for helping college students...
Cambridge University Press, 1995. — 489 p. This book presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to advanced undergraduates and to graduate students. We expect it will also prove to be a reference to professionals wishing to implement such algorithms and to researchers seeking to establish new results in the area. We...
Cambridge University Press, 1995. — 489 p. This book presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to advanced undergraduates and to graduate students. We expect it will also prove to be a reference to professionals wishing to implement such algorithms and to researchers seeking to establish new results in the area. We...
N.-Y.: O’Reilly Media, 2015. — 435 p. Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs — with...
Springer, 2015. — 613 p. — ISBN: 3319212745 This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut &...
CRC Press, 2014. — 236 p. — ISBN10: 1466589892, ISBN13: 978-1-4665-8990-2. A student-friendly text, A Concise Introduction to Data Structures Using Java takes a developmental approach, starting with simpler concepts first and then building toward greater complexity. Important topics, such as linked lists, are introduced gradually and revisited with increasing depth. More code...
Jones & Bartlett Learning, 2001. — 314 p. — ISBN: 0763716340, 9780763716349 McConnell (Canisius College) developed this course to make students aware of the impact of algorithms on a program's efficiency and instruct them in the skills to analyze algorithms used in programs. Students learn the basics of analysis; searching, selecting, and sorting algorithms; and the element
N.-Y.: Jones & Bartlett Learning, 2014. - 676 p. Foundations of Algorithms, Fifth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. Ideal for any computer science students with a background in college algebra and discrete structures, the text presents mathematical concepts using standard English and...
N.-Y.: Wiley, 2014. - 800 p. Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are...
Prentice-Hall. Englewood Cliffs, NJ, USA. 1968. 238 p. Includes index. ISBN: 0131657208 This book developed from lecture notes for a class that were taught for several years at the IBM Systems Research Institute. This is an eight-week class on mathematical methods used in function evaluation routines for digital computers. This was the first textbook to contain all the main...
Franklin, Beedle & Associates, 2009. — 583 p. — ISBN: 1590282337, 9781590282335 This book is intended for use in a traditional college-level data structures course (commonly known as CS2). This book assumes that students have learned the basic syntax of Python and been exposed to the use of existing classes. Most traditional CS1 courses that use Python will have covered all the...
Birkhauser, 2001. — 599 p. — ISBN: 0817642536, 9780817642532 Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing,...
New York: Springer-Verlag, 1992. — 360 p. A text for a graduate course in mathematics, for students with at least some basic knowledge of set theory, rational integers, combinatorics (Newton is sufficient), and elementary analysis and algebra.
Cambridge University Press, 2007, -393 p. This book is intended for lectures on string processing and pattern matching in master’s courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. This book is also...
Jones and Bartlett Publishers, 2004. - 618 p. ISBN: 0763723878 3rd edition Foundations of Algorithms Using C++ Pseudocode, Third Edition offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and...
Addison Wesley, 2011, ISBN: 0132316811, 592 p. Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal...
2nd Edition. John Wiley & Sons, Inc., 2011. – 738 p. This second edition of Data Structures and Algorithms in C++ is designed to provide an introduction to data structures and algorithms, including their design, analysis, and implementation. In terms of curricula based on the IEEE/ACM2001 Computing Curriculum, this book is appropriate for use in the courses CS102 (I/O/B...
Comments