ساختمان داده‌ها و الگوریتم‌های بدون کد: یادگیری DSA بدون نوشتن حتی یک خط کد

In the era of self-taught developers and programmers, essential topics in the industry are frequently learned without a formal academic foundation. A solid grasp of data structures and algorithms (DSA) is imperative for anyone looking to do professional software development and engineering, but classes in the subject can be dry or spend too much time on theory and unnecessary readings. Regardless of your programming language background, __Codeless Data Structures and Algorithms__ has you covered. 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 you can 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 Is For This 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. pdf.pdf Contents About the Author Acknowledgments Introduction Part I: Data Structures Chapter 1: Intro to DSA, Types, and Big O An Overview of Data Structures and Algorithms Data Structures Algorithms Algorithms and Data Structures in Tandem Primitive Types Boolean Character Integer Floating-Point Number Functions Functions, Methods, Procedures, and Subroutines Recursion and Iteration The Three Types of Algorithms Analyzing Algorithms Big O Conclusion Chapter 2: Linear Data Structures Computer Memory An Overview of Linear Data Structures The Array Lists Stacks Queues Priority Queues Conclusion Chapter 3: Tree Data Structures Trees Binary Trees AVL Tree Red-Black Tree B-trees Heaps Conclusion Chapter 4: Hash Data Structures Hashes and Hash Functions Hash Table Computer Security Basics Cryptosystems Public-Key Cryptosystem Hashing vs. Encryption Role of Hashes in Computer Security Hashes and Cyclic Redundancy Check Other Hash Uses Conclusion Chapter 5: Graphs Dimensions, Points, and Lines Graphs Graphs vs. Trees More About Graphs Weighted Graphs Graphs and Social Networking Applications The Graph Database Conclusion Part II: Algorithms Chapter 6: Linear and Binary Search Mathematical Concepts Linearity Logarithms Linear Search Binary Search Conclusion Chapter 7: Sorting Algorithms Sorting Bubble Sort Selection Sort Insertion Sort Merge Sort Quick Sort Conclusion Chapter 8: Searching Algorithms Breadth-First Search Dijkstra’s Algorithm A* Algorithm Conclusion Chapter 9: Clustering Algorithms K-Means Algorithm K-Nearest Neighbor Machine Learning Neural Networks Deep Learning Conclusion Chapter 10: Randomness Random Some Hardware Background Circuits and the Transistor Amplifiers, Feedback, Clocks, and Oscillators Logic Gates Combinational and Sequential Logic Mixed-Signal Circuits, Reactance, and Noise Pseudorandom Numbers Linear-Feedback Shift Register True Random Number Generator Conclusion Chapter 11: Scheduling Algorithms Operating Systems General-Purpose Operating Systems Real-Time Operating Systems Interrupts and Interrupt Service Routines Finite-State Machines Kernels, Processes, Threads, and Tasks Memory Management Unit Task Control Blocks The Scheduler and Scheduling First Come First Serve Shortest Job First Priority Round Robin Multilevel Queue and Multilevel Feedback Queue Conclusion Chapter 12: Algorithm Planning and Design The Need for Proper Planning and Design The Three Stages of Algorithms Flowcharts Flowchart Symbols Arrows Terminator Input and Output Process Decision Predefined Process Program Structures Sequence If-Then If-Then-Else While Loop Do-While Loop Switch Example Algorithm Linear Search Pseudocode Conclusion Appendix A: Going Further Index In the era of self-taught developers and programmers, essential topics in the industry are frequently learned without a formal academic foundation. A solid grasp of data structures and algorithms (DSA) is imperative for anyone looking to do professional software development and engineering, but classes in the subject can be dry or spend too much time on theory and unnecessary readings. Regardless of your programming language background, "Codeless data structures and algorithms" has you covered. 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 enxuring 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 you can directly apply to your own programs. "Codeless data structures and algorithms" provides you with the knowledge about DSTs 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