Codeless Data Structures and Algorithms
Apress (Verlag)
978-1-4842-5724-1 (ISBN)
In this book, author Armstrong Subero will help you learn DSAs without writing a single line of code. Straightforward explanations and diagrams give you a confident handle on the topic while ensuring you never have to open your code editor, use a compiler, or look at an integrated development environment. Subero introduces you to linear, tree, and hash data structures and gives you important insights behind the most common algorithms that youcan directly apply to your own programs.
Codeless Data Structures and Algorithms provides you with the knowledge about DSAs that you will need in the professional programming world, without using any complex mathematics or irrelevant information. Whether you are a new developer seeking a basic understanding of the subject or a decision-maker wanting a grasp of algorithms to apply to your projects, this book belongs on your shelf. Quite often, a new, refreshing, and unpretentious approach to a topic is all you need to get inspired.
What You'll Learn
Understand tree data structures without delving into unnecessary details or going into too much theory
Get started learning linear data structures with a basic discussion on computer memory
Study an overview of arrays, linked lists, stacks and queues
Who This Book IsForThis book is for beginners, self-taught developers and programmers, and anyone who wants to understand data structures and algorithms but don’t want to wade through unnecessary details about quirks of a programming language or don’t have time to sit and read a massive book on the subject. This book is also useful for non-technical decision-makers who are curious about how algorithms work.
Armstrong Subero started learning electronics at the age of 8. From then on he got into programming and embedded systems development. Within the realm of programming, he has a special interest in algorithms and data structures and enjoys implementing them in different programming languages and on different processor architectures, particularly resource-constrained systems. He currently works at the Ministry of National Security in his country and he has degrees in computer science as well as liberal arts and sciences from Thomas Edison State University. He is the author of Programming PIC Microcontrollers in XC8 (Apress, 2018).
Part 1: Data Structures.- Chapter 1: Intro to DSA, Types and Big-O.- Chapter 2: Linear Data Structures.- Chapter 3: Tree Data Structures.- Chapter 4: Hash Data Structures.- Chapter 5: Graphs.- Part 2: Algorithms.- Chapter 6: Linear and Binary Search.- Chapter 7: Sorting Algorithms.- Chapter 8: Searching Algorithms.- Chapter 9: Clustering Algorithms.- Chapter 10: Randomness.- Chapter 11: Scheduling Algorithms.- Chapter 12: Algorithm Planning and Design.- Appendix A: Going Further.
Erscheinungsdatum | 24.02.2020 |
---|---|
Zusatzinfo | 108 Illustrations, black and white; XIII, 146 p. 108 illus. |
Verlagsort | Berkley |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Informatik ► Theorie / Studium ► Kryptologie | |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
ISBN-10 | 1-4842-5724-3 / 1484257243 |
ISBN-13 | 978-1-4842-5724-1 / 9781484257241 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich