Appendix A: Going Further
If you have completed the book, congratulations again! There is a chance you will want some resources to take your studies further. In this appendix, I provide resources to help you succeed.
- First, you will want to check out Project Euler ( https://projecteuler.net/ ). It’s the best resource to improve your understanding of data structures and algorithms. Project Euler will help you practice solving different algorithmic problems while learning valuable skills in mathematics.
- Another good resource that you can use to develop your skills is Code Wars ( https://www.codewars.com/ ). You’ll use a language of your choice to solve lots of challenges and problems.
- Finally, take a look at FreeCodeCamp ( https://www.freecodecamp.org/ ). While not solely focused on algorithms and data structures, it has a challenging section on algorithms and data structures that will enhance your understanding. As a bonus, you will learn some of the latest web development trends, all for free.
It is my hope that these resources will increase your understanding of data structures and algorithms and help you on your computer science journey.
Good luck going forward!
Index
A
Abstraction
Algorithms
See alsoFlowcharts
analysis
data structures
divide-and-conquer
dynamic programming–based
greedy
linear search
natural languages
planning and design
problem solving
pseudocode
stages
structures
SeeSequence structure
tandem
Alternating current (AC)
Amplification
Analog-to-digital conversion (ADC)
Arithmetic logic unit (ALU)
Arrays
Artificial intelligence (AI)
Artificial neural network (ANN)
A star (A∗) algorithm
Asymptotic analysis
Atomic data types
AVL tree
B
Balanced binary tree
Bellman-Ford algorithm
Best-first search
Big O
Binary search
Binary search tree
Binary trees
3-bit shift register
Boolean primitive data type
Breadth-first search
B-trees
Bubble sort
C
Cache
Capacitors
C-based programming languages
Centroid
Character
Ciphertext
Circular linked list
Circular singly linked list
Clock
Cluster analysis
Clustering algorithms
deep learning
K-means algorithm
KNN algorithm
machine learning
neural networks
Coin-operated turnstile FSM
Combinational logic circuits
Comparator
Computer memory
binary prefix
byte
cache
data structures
hard disk
hierarchical
memory address
memory speed hierarchy
memory stack
registers
type of workspace
virtual memory
Computer science tree
Computer security basics
Convoy effect
CPU scheduling algorithms
Cryptographic functions
Cryptographic pseudorandom number generators (CPRNGs)
Cryptosystems
Cyclic redundancy check (CRC)
D
Dataset
Data structures
Decimals
Deep learning
Dendrogram
Deterministic finite automaton (DFA)
D flip-flop
Digital Signature Algorithm (DSA)
Digital-to-analog conversion (DAC)
Dijkstra’s algorithm
Directed graph
Dispatcher
Divide-and-conquer algorithms
Divide-and-conquer method
Doubles
Doubly linked list data structure
Dynamic approach
Dynamic programming–based algorithms
E
Encryption
Enqueue
Euclidean distance
F
Feedback
Feed-forward neural network
Final state concentric circle representation
Finite-state automata (FSAs)
Finite-state machine (FSM)
First come first serve (FCFS)
First in first out (FIFO) data structure
Flip-flops
Floating-point number
Flowcharts
logical flaws
pictorial representation
symbols
arrows
decision
input and output
predefined process
process
terminator
Functions
G
Garbage in garbage out (GIGO)
General-purpose operating system (GPOS)
Graph clustering
Graphs
database
digraphs
directed graph
edges
geometrical shapes
line
mathematical dimension
objects/vertices
point
social networking applications
subgraph
vs.
trees
undirected graph
vertex
weighted
Graph theory
Greedy algorithms
H
Hard disk drive (HDD)
Hardware random number generator (HRNG)
Hash data structures
chaining method
computer security
CRC module
function box
linked list structure
Hash function
Hashingvs.
encryption
Hash table
Hash uses
Hash value
Heaps
Heuristic algorithms
Hierarchical clustering
I, J
Inductors
Infinite loop
Initial pseudostate
Insertion sort
Integer
International Electrotechnical Commission (IEC) units
Internet of Everything (IoE)
Internet of Things (IoT)
Interrupt priorities
Interrupts
Interrupt service routine (ISR)
Iteration
K
Kernel
Key-value lookup system
Key-value type structure
K-means algorithm
centroid
data clusters
dendrogram
graph clustering
unsupervised machine learning applications
K-nearest neighbor (KNN) algorithm
classification
machine learning
octagon
shape classification
L
Last in first out (LIFO) data structure
Latch
Lightweight processes
Linear algorithm
Linear data structures
array
list
priority queue
queue
stacks
Linear feedback shift register (LFSR)
Linearity
Linear search
Linear search algorithm
Linked list data structure
Logarithms
exponent
exponential graph
graph
logs and exponents relationship
Logical data type
Logic gates
Loop structures
M
Machine learning
Mathematical function
Matrix
Memory address
Memory management unit (MMU)
Memory speed hierarchy
Merge sort
Message authentication code (MAC)
Metal-oxide semiconductor field effect transistor (MOSFET)
Mixed-signal circuits
Monolithic kernel
Moore’s law
Multidimensional array
Multilayer perception
Multilevel feedback queue scheduling algorithm
Multilevel queue scheduling algorithm
Multitasking
N
Neural networks
Nodes/units
Nondeterministic finite automaton (NFA)
Nonpreemptive priority scheduling
Nonpreemptive scheduling
O
Object-oriented programming (OOP)
One-dimensional array
Operating systems (OSs)
Operational amplifier
Oscillation
P
Parallel in parallel out (PIPO)
Parallel in serial out (PISO)
Partitional clustering
Pivot
Preemptive priority scheduling
Preemptive scheduling
Primitive data types
Boolean
character
floating-point number
integer
Priority queue
Priority scheduling
Probability
Program structures
SeeSequence structure
Pseudocode
Pseudorandom number generator (PRNG)
Pseudorandom numbers
Public-key cryptosystem
Q
Quantum
Qubits
Queues
Quick sort
R
Random access memory (RAM)
Randomness
amplification
circuits and transistor
clock
combinational and sequential logic
feedback
GIGO
hardware background
LFSR
logic gates
mixed-signal circuits
modus operandi
noise
oscillators
probability
pseudorandom numbers
reactance
TRNG
Random number generator (RNG)
Reactance
Real-time operating systems (RTOSs)
Recomputed centroid
Recursion
Red-black binary search tree
Registers
Relational database management system (RDBMS)
Resource-constrained systems
Rivest-Shamir-Adleman (RSA)
Round-robin
S
Scheduler
Scheduling algorithms
FCFS
FSM
GPOS
interrupts and ISR
kernel
MMU
multilevel and multilevel feedback queue
OSs
priority
processes
process scheduler and scheduling
round-robin
RTOSs
SJF
task
TCB
threads
Searching algorithms
A∗ algorithm
breadth-first search
Dijkstra’s algorithm
Secure Hash Algorithm (SHA)
Seed number
Selection/decision structures
Selection sort
Sequence structure
do-while loop
if-then
if-then-else
switch case
while loop
Sequential circuits
Serial in parallel out (SIPO)
Serial in serial out (SISO)
Shift registers
Shortest job first (SJF)
Shortest path
Single-layer perceptron
Singly linked list
Solid-state drive (SDD)
Sorting algorithms
bubble sort
identify duplicate data
insertion sort
library functions
merge sort
quick sort
selection sort
Space complexity
Stack overflow error
Stacks
State diagram
Subroutine
Subtree
Supercomputers
Supervised learning
T
Task
Task control block (TCB)
Threads
Time complexity
Transistor
MOSFET
schematic diagram
schematic symbol
Traversal
Tree-based data structures
AVL tree
binary trees
biological tree
B-trees
computer science
heaps
red-black binary search tree
root node
Trees
leaf nodes
parent and children
root node
subtree and edge
True random number generator (TRNG)
U
Unbalanced binary tree
Undirected graph
Unsupervised learning
V
Virtual memory
W
Weighted graphs
X, Y, Z
XOR gate
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.