Codeless Data Structures and Algorithms : Learn DSA Without Writing a Single Line of Code

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