Content added
This commit is contained in:
Ibrahim Hasnat
GitHub
parent
bd9ea00001
commit
ded69784c4
90
README.md
90
README.md
@ -129,6 +129,51 @@ software development/engineering roles.
|
|||||||
|
|
||||||
### Topics of Study
|
### Topics of Study
|
||||||
|
|
||||||
|
- [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
|
||||||
|
- [Data Structures](#data-structures)
|
||||||
|
- [Arrays](#arrays)
|
||||||
|
- [Linked Lists](#linked-lists)
|
||||||
|
- [Stack](#stack)
|
||||||
|
- [Queue](#queue)
|
||||||
|
- [Hash table](#hash-table)
|
||||||
|
- [More Knowledge](#more-knowledge)
|
||||||
|
- [Binary search](#binary-search)
|
||||||
|
- [Bitwise operations](#bitwise-operations)
|
||||||
|
- [Trees](#trees)
|
||||||
|
- [Trees - Notes & Background](#trees---notes--background)
|
||||||
|
- [Binary search trees: BSTs](#binary-search-trees-bsts)
|
||||||
|
- [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
|
||||||
|
- balanced search trees (general concept, not details)
|
||||||
|
- traversals: preorder, inorder, postorder, BFS, DFS
|
||||||
|
- [Sorting](#sorting)
|
||||||
|
- selection
|
||||||
|
- insertion
|
||||||
|
- heapsort
|
||||||
|
- quicksort
|
||||||
|
- merge sort
|
||||||
|
- [Graphs](#graphs)
|
||||||
|
- directed
|
||||||
|
- undirected
|
||||||
|
- adjacency matrix
|
||||||
|
- adjacency list
|
||||||
|
- traversals: BFS, DFS
|
||||||
|
- [Even More Knowledge](#even-more-knowledge)
|
||||||
|
- [Recursion](#recursion)
|
||||||
|
- [Dynamic Programming](#dynamic-programming)
|
||||||
|
- [Design Patterns](#design-patterns)
|
||||||
|
- [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
|
||||||
|
- [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
|
||||||
|
- [How computers process a program](#how-computers-process-a-program)
|
||||||
|
- [Caches](#caches)
|
||||||
|
- [Processes and Threads](#processes-and-threads)
|
||||||
|
- [Testing](#testing)
|
||||||
|
- [String searching & manipulations](#string-searching--manipulations)
|
||||||
|
- [Tries](#tries)
|
||||||
|
- [Floating Point Numbers](#floating-point-numbers)
|
||||||
|
- [Unicode](#unicode)
|
||||||
|
- [Endianness](#endianness)
|
||||||
|
- [Networking](#networking)
|
||||||
|
- [Final Review](#final-review)
|
||||||
|
|
||||||
### Getting the Job
|
### Getting the Job
|
||||||
|
|
||||||
@ -143,6 +188,51 @@ software development/engineering roles.
|
|||||||
|
|
||||||
### Optional Extra Topics & Resources
|
### Optional Extra Topics & Resources
|
||||||
|
|
||||||
|
- [Additional Books](#additional-books)
|
||||||
|
- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
|
||||||
|
- [Additional Learning](#additional-learning)
|
||||||
|
- [Compilers](#compilers)
|
||||||
|
- [Emacs and vi(m)](#emacs-and-vim)
|
||||||
|
- [Unix command line tools](#unix-command-line-tools)
|
||||||
|
- [Information theory](#information-theory-videos)
|
||||||
|
- [Parity & Hamming Code](#parity--hamming-code-videos)
|
||||||
|
- [Entropy](#entropy)
|
||||||
|
- [Cryptography](#cryptography)
|
||||||
|
- [Compression](#compression)
|
||||||
|
- [Computer Security](#computer-security)
|
||||||
|
- [Garbage collection](#garbage-collection)
|
||||||
|
- [Parallel Programming](#parallel-programming)
|
||||||
|
- [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
||||||
|
- [A*](#a)
|
||||||
|
- [Fast Fourier Transform](#fast-fourier-transform)
|
||||||
|
- [Bloom Filter](#bloom-filter)
|
||||||
|
- [HyperLogLog](#hyperloglog)
|
||||||
|
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
||||||
|
- [van Emde Boas Trees](#van-emde-boas-trees)
|
||||||
|
- [Augmented Data Structures](#augmented-data-structures)
|
||||||
|
- [Balanced search trees](#balanced-search-trees)
|
||||||
|
- AVL trees
|
||||||
|
- Splay trees
|
||||||
|
- Red/black trees
|
||||||
|
- 2-3 search trees
|
||||||
|
- 2-3-4 Trees (aka 2-4 trees)
|
||||||
|
- N-ary (K-ary, M-ary) trees
|
||||||
|
- B-Trees
|
||||||
|
- [k-D Trees](#k-d-trees)
|
||||||
|
- [Skip lists](#skip-lists)
|
||||||
|
- [Network Flows](#network-flows)
|
||||||
|
- [Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
||||||
|
- [Math for Fast Processing](#math-for-fast-processing)
|
||||||
|
- [Treap](#treap)
|
||||||
|
- [Linear Programming](#linear-programming-videos)
|
||||||
|
- [Geometry, Convex hull](#geometry-convex-hull-videos)
|
||||||
|
- [Discrete math](#discrete-math)
|
||||||
|
- [Machine Learning](#machine-learning)
|
||||||
|
- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
|
||||||
|
- [Video Series](#video-series)
|
||||||
|
- [Computer Science Courses](#computer-science-courses)
|
||||||
|
- [Papers](#papers)
|
||||||
|
|
||||||
---
|
---
|
||||||
|
|
||||||
## Why use it?
|
## Why use it?
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user