CS: Difference between revisions
From charlesreid1
| Line 99: | Line 99: | ||
=Study Resources= | =Study Resources= | ||
Math: | |||
* Awesome math: https://github.com/rossant/awesome-math | |||
Some nice awesome lists: | Some nice awesome lists: | ||
| Line 113: | Line 116: | ||
Growth hacking: | Growth hacking: | ||
* https://github.com/btomashvili/awesome-growth-hacking | * https://github.com/btomashvili/awesome-growth-hacking | ||
=Flags= | =Flags= | ||
Revision as of 22:12, 11 July 2017
Computer Science: the science of computing. Or, the science of problem-solving with computers, computational devices, and computational methods.
Study Notes
See CS study plan repo for more detailed notes: https://charlesreid1.com:3000/cs/study-plan
Topics
Computer Science
Link: https://charlesreid1.com:3000/cs/study-plan/src/master/TODOSoftwareEngineering.md
CS list of topics:
Data Structures
Algorithms
Mathematics - Combinatorics and Probability
Mathematics - Number Theory
Mathematics - Numerics
Languages
Data Structures
For polished/digested study guides see: Study Guides
Link: https://charlesreid1.com:3000/cs/study-plan/src/master/TODOSoftwareEngineering.md
See also: Template:DataStructuresFlag
- Data Structures
- Algorithm complexity
- Arrays
- Lists
- StacksQueues
- Priority Queues
- Maps
- Binary Trees
- Abstract Data Types - general classes of data structures
Algorithms
Algorithms can be divided into categories:
- Algorithms/Data Structures - algorithmic analysis of data structures
- Algorithms/Strings - algorithms for operations on strings
- Algorithms/Search - search algorithms for searching and search-related data structures
- Algorithms/Sort - basic and advanced algorithms for sorting data
- Algorithms/Graphs -
- Algorithms/Optimization -
Programming practice and writeups:
- Competitive programming
- Project Euler
- Research and Teaching Blog - https://charlesreid1.github.io
Combinatorics and Probability
Number Theory
Numerics
Link: https://charlesreid1.com:3000/cs/study-plan/src/master/TODONumerics.md
Following the content of Numerical Recipes - algorithmic analysis, &c.
Numerics topics corresponding to particular chapters:
- Linear algebra
- Interpolation and Extrapolation
- Integration and Evaluation of Functions
- Root Finding
Languages and Tools
Languages:
- Java (solid)
- Python (solid)
- Go (minimal)
- C++ (minimal)
Tool categories:
- Built-in data structures (solid, comfortable with its API)
- Extended data structures (Pandas, Guava) and utilities (itertools, Apache Commons)
- Numerical libraries (big numbers, factoring, exponents, root finding, linear solvers, nonlinear solvers)
- Graph library
Infrastructure:
- Testing infrastructure & best practices (JUnit)
- Build tools (Bezel, Maven)
Study Resources
Math:
- Awesome math: https://github.com/rossant/awesome-math
Some nice awesome lists:
- Awesome algorithms: https://github.com/tayllan/awesome-algorithms
- Awesome challenges: https://github.com/mauriciovieira/awesome-challenges
Meta:
- awesome-awesomeness: https://github.com/sindresorhus/awesome
- sindresorhus/awesome: https://github.com/sindresorhus/awesome
Programming tests:
Growth hacking:
Flags
Computer Science
 |
Computer Science notes on computer science topics on the wiki, for educational and learning purposes
Part of the 2017 CS Study Plan.
Python/Exceptions · Python/Assertions · Python/Decorators Python/Os (os module) · Python/Strings Python/Splat · Python/Iterators · Python/Generators Python/Comparators · Python/Lambdas
Builtin features of Java: Java/Exceptions · Java/Assertions · Java/Memory · Java/Interfaces Java/Generics · Java/Decorators · Java/Diamond Notation Java/Iterators · Java/Iterable · Iterators vs Iterable Java/Comparators · Java/Comparable · Comparators vs Comparable Java/Numeric · Java/TypeChecking · Java/Testing · Java/Timing · Java/Profiling Documentation: Javadocs · Java/Documentation Tools and functionality: Java/URLs · Java/CSV External libraries: Guava · Fastutil · Eclipse Collections OOP: OOP Checklist · Java/Abstract Class · Java/Encapsulation · Java/Generics
|
See also:
Data Structures
|
Data Structures Part of Computer Science Notes
This is the staging ground for computer science notes as part of the 2017 CS Study Plan.
Classes of data structures: Abstract Data Types Array-based and Link-based memory management: ArrayLists and Linked Lists Algorithmic Analysis of Data Structures: Algorithmic Analysis of Data Structures Advanced data structures: Advanced Data Structures
|
|
Arrays Part of Computer Science Notes
Series on Data Structures Python: Arrays/Python · Arrays/Python/Sizeof · Arrays/Python/AppendCost · Arrays/Python/CaesarCipher · Arrays/Python/CompactArrays · Arrays/Python/DynamicArray Java: Arrays/Java · Arrays/Java/CaesarCipher · Arrays/Java/FisherYates · Arrays/Java/PythonList · Arrays/Java/Repeatedly_Remove Categories: Category:Python Arrays
|
|
Stacks and Queues Part of Computer Science Notes
Series on Data Structures
Stacks and Queues: Python StacksQueues/Python · StacksQueues/Python/ArrayStack · StacksQueues/Python/ArrayQueue · StacksQueues/Python/ArrayDeque StacksQueues/Python/LinkedStack
Stacks and Queues: Java StacksQueues/Java · StacksQueues/Java/ArrayStack · StacksQueues/Java/ArrayQueue · StacksQueues/Java/ArrayQueueFS · StacksQueues/Java/ArrayDeque StacksQueues/Java/LinkedStack · StacksQueues/Java/LinkedQueue · StacksQueues/Java/LinkedDeque
Applications Postfix_Expressions#Stacks · StacksQueues/Subsets · StacksQueues/Subsets/Java
|
|
Priority Queues and Heaps Part of Computer Science Notes
Series on Data Structures
Java: Priority Queues/Java · Priority Queues/ADT · Priority Queues/Sorted · Priority Queues/Unsorted Performance: Priority Queues/Timing and Performance Applications: Maximum Oriented Priority Queue · Priority Queues/Stack
Priority Queues/Heap · Priority Queues/Java · Priority Queues/Comparators
|
|
Linked List Part of Computer Science Notes
Series on Data Structures Java: Linked Lists/Java · Linked Lists/Java/Single · Linked Lists/Java/Double · Linked Lists/Java/Circular Performance: Linked Lists/Java/Timing · Linked Lists/Java/Reverse Python: Linked Lists/Python · Linked Lists/Python/Single
|
|
Trees Part of Computer Science Notes
Series on Data Structures Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Traversal Preorder traversal: Trees/Preorder Postorder traversal: Trees/Postorder In-Order traversal: Binary Trees/Inorder Breadth-First Search: BFS Breadth-First Traversal: BFT Depth-First Search: DFS Depth-First Traversal: DFT OOP Principles for Traversal: Tree Traversal/OOP · Tree Traversal/Traversal Method Template Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications Finding Minimum in Log N Time: Tree/LogN Min Search
Abstract data type: Binary Trees/ADT Concrete implementations: Binary Trees/LinkedBinTree · Binary Trees/ArrayBinTree Binary Trees/Cheat Sheet · Binary Trees/OOP · Binary Trees/Implementation Notes
|
|
Search Trees Part of Computer Science Notes
Series on Data Structures
Binary Search Trees · Balanced Search Trees Trees/OOP · Search Trees/OOP · Tree Traversal/OOP · Binary Trees/Inorder
(Note that heaps are also value-sorting trees with minimums at the top. See Template:PriorityQueuesFlag and Priority Queues.)
|
|
Maps and Dictionaries Part of Computer Science Notes
Series on Data Structures
Maps/Dictionaries Maps · Maps/ADT · Maps in Java · Maps/OOP · Maps/Operations and Performance Map implementations: Maps/AbstractMap · Maps/UnsortedArrayMap · Maps/SortedArrayMap Dictionary implementations: Dictionaries/LinkedDict · Dictionaries/ArrayDict
Hashes Hash Maps/OOP · Hash Maps/Operations and Performance Hash Maps/Dynamic Resizing · Hash Maps/Collision Handling with Chaining Hash functions: Hash Functions · Hash Functions/Cyclic Permutation Hash map implementations: Hash Maps/AbstractHashMap · Hash Maps/ChainedHashMap
Skip Lists · Java/ConcurrentSkipList · Java implementations: SkipList
Sets Sets · Sets/ADT · Sets in Java · Sets/OOP · Multisets
|
Algorithms
|
Algorithms Part of Computer Science Notes
Series on Algorithms
Algorithms/Sort · Algorithmic Analysis of Sort Functions · Divide and Conquer · Divide and Conquer/Master Theorem Three solid O(n log n) search algorithms: Merge Sort · Heap Sort · Quick Sort Algorithm Analysis/Merge Sort · Algorithm Analysis/Randomized Quick Sort
Algorithms/Search · Binary Search · Binary Search Modifications
Algorithms/Combinatorics · Algorithms/Combinatorics and Heuristics · Algorithms/Optimization · Divide and Conquer
Algorithms/Strings · Algorithm Analysis/Substring Pattern Matching
Algorithm complexity · Theta vs Big O Amortization · Amortization/Aggregate Method · Amortization/Accounting Method Algorithm Analysis/Matrix Multiplication
Estimation Estimation · Estimation/BitsAndBytes
Algorithm Practice and Writeups Project Euler · Five Letter Words · Letter Coverage
|